An XML Format Proposal for the Description of Weighted Automata, Transducers and Regular Expressions

Authors:
Akim Demaille;Alexandre Duret-Lutz;Florian Lesaint;Sylvain Lombardy;Jacques Sakarovitch;Florent Terrones
Affiliations:
LRDE, EPITA, {name}@lrde.epita.fr;LRDE, EPITA, {name}@lrde.epita.fr;LRDE, EPITA, {name}@lrde.epita.fr;IGM, Université Paris Est Marne-la-Vallée, lombardy@univ-mlv.fr;LTCI, CNRS / ENST, sakarovitch@enst.fr;LRDE, EPITA, {name}@lrde.epita.fr
Venue:
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Year:
2009

Citing 3
Cited 1

A Rational Design for a Weighted Finite-State Transducer Library

WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
OpenFst: a general and efficient weighted finite-state transducer library

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata

Implementation concepts in vaucanson 2

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an XML format that allows to describe a large class of finite weighted automata and transducers. Our design choices stem from our policy of making the implementation as simple as possible. This format has been tested for the communication between the modules of our automata manipulation platform Vaucanson, but this document is less an experiment report than a position paper intended to open the discussion among the community of automata software writers.