FSA: An efficient and flexible C++ toolkit for finite state automata using on-demand computation

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn , Issue , 2004, Pages 510-517

  Kanthak, Stephan ^a   Ney, Hermann ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; C++ (PROGRAMMING LANGUAGE); COMPUTATIONAL LINGUISTICS; COMPUTER AIDED LANGUAGE TRANSLATION; MACHINE TRANSLATION; OPEN SYSTEMS; PYTHON;

C++ TOOLKIT; COMMAND LINE; EFFICIENT IMPLEMENTATION; FINITE-STATE AUTOMATA; HIGH LEVEL INTERFACE; INTERACTIVE MANIPULATION; MEMORY REQUIREMENTS; ON-DEMAND COMPUTATIONS; STATISTICAL MACHINE TRANSLATION SYSTEM; TOOLKIT SUPPORT;

OPEN SOURCE SOFTWARE;

EID: 84941164160     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Alfred V. Aho and Jeffrey D. Ullman, 1972, The Theory of Parsing, Translation and Compiling, volume 1, Prentice-Hall, Englewood Cliffs, NJ, 1972.
2. Arnaud Adant, 2000, WFST: A Finite-State Template Library in C++, http://membres.lycos.fr/adant/tfe/.
3. Cyril Allauzen, Mehryar Mohri, and Brian Roark, 2003, Generalized Algorithms for Constructing Statistical Language Models, In Proc. of the 41st Meeting of the Association for Computational Linguistics, Sapporo, Japan, July 2003.
4. Cyril Allauzen and Mehryar Mohri, 2003, Generalized Optimization Algorithm for Speech Recognition Transducers, In Proc. of the IEEE Int. Conf. on Acoustics, Speech, and Signal Processing, pp., Hong Kong, China, April 2003.
5. Srinivas Bangalore and Giuseppe Riccardi, 2000, Stochastic Finite-State models for Spoken Language Machine Translation, In Proc. of the Workshop on Embedded Machine Translation Systems, pp. 52–59, 2000.
6. David Beazley, William Fulton, Matthias Köppe, Lyle Johnson, Richard Palmer, 1996, SWIG - Simplified Wrapper and Interface Generator, Electronic Document, http://www.swig.org, February 1996.
7. F. Casacuberta, D. Llorens, C. Martinez, S. Molau, F. Nevado, H. Ney, M. Pasto, D. Pico, A. Sanchis, E. Vidal and J.M. Vilar, 2001, Speech-to-Speech Translation based on Finite-State Transducer, In Proc. IEEE Int. Conf. on Acoustics, Speech and Signal Processing, pp. 613-616, Salt Lake City, Utah, May 2001.
8. Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest, 1990, Introductions to Algorithms, The MIT Press, Cambridge, MA, 1990.
9. Jason Eisner, 2001, Expectation Semirings: Flexible EM for Finite-State Transducers, In Proc. of the ESSLLI Workshop on Finite-State Methods in NLP (FSMNLP), Helsinki, August 2001.
10. Free Software Foundation, 1991, GNU General Public License, Version 2, Electronic Document, http://www.gnu.org/copyleft/gpl.html, June 1991.
11. Takaaki Hori, Chiori Hori and Yasuhiro Minami, 2003, Speech Summarization using Weighted Finite-State Transducers, In Proc. of the European Conf. on Speech Communication and Technology, Geneva, Switzerland, September 2003.
12. Vincent Le Maout, 1998, ASTL: Automaton Standard Template Library, http://www-igm.univmlv.fr/lemaout/.
13. Kurt Mehlhorn, 1984, Data Structures and Efficient Algorithms, Chapter 4, Springer Verlag, EATCS Monographs, 1984, also available from http://www.mpisb.mpg.de/mehlhorn/DatAlgbooks.html.
14. Mehryar Mohri, 1997, Finite-State Transducers in Language and Speech Processing, Computational Linguistics, 23:2, 1997.
15. Mehryar Mohri, Fernando C.N. Pereira, and Michael Riley, 2000, Weighted Finite-State Transducers in Speech Recognition, In Proc. of the ISCA Tutorial and Research Workshop, Automatic Speech Recognition: Challenges for the new Millenium (ASR2000), Paris, France, September 2000.
16. Mehryar Mohri, Fernando C.N. Pereira, and Michael Riley, 2000, The Design Principles of a Weighted Finite-State Transducer Library, Theoretical Computer Science, 231:17-32, January 2000.
17. Mehryar Mohri and Michael Riley, 2000, A Weight Pushing Algorithm for Large Vocabulary Speech Recognition, In Proc. of the European Conf. on Speech Communication and Technology, pp. 1603–1606, Åalborg, Denmark, September 2001.
18. Mehryar Mohri, 2001, Generic Epsilon-Removal Algorithm for Weighted Automata, In Sheng Yu and Andrei Paun, editor, 5th Int. Conf., CIAA 2000, London Ontario, Canada. volume 2088 of Lecture Notes in Computer Science, pages 230-242. Springer-Verlag, Berlin-NY, 2001.
19. Mehryar Mohri and Michael Riley, 2002, An Efficient Algorithm for the N-Best-Strings Problem, In Proc. of the Int. Conf. on Spoken Language Processing, pp. 1313–1316, Denver, Colorado, September 2002.
20. Franz J. Och and Hermann Ney, 2000, Improved Statistical Alignment Models, In Proc. of the 38th Annual Meeting of the Association for Computational Linguistics, pp. 440-447, Hongkong, China, October 2000.
21. Fernando C.N. Pereira and Michael Riley, 1996, Speech Recognition by Composition of Weighted Finite Automata, Available from http://xxx.lanl.gov/cmplg/9603001, Computation and Language, 1996.
22. Gertjan van Noord, 2000, FSA6 Reference Manual, http://odur.let.rug.nl/vannoord/Fsa/.
23. Enrique Vidal, 1997, Finite-State Speech-to-Speech Translation, In Proc. of the IEEE Int. Conf. on Acoustics, Speech and Signal Processing, pp. 111–114, Munich, Germany, 1997.
24. Richard Zens, Franz J. Och and H. Ney, 2002, Phrase-Based Statistical Machine Translation, In: M. Jarke, J. Koehler, G. Lakemeyer (Eds.): KI - 2002: Advances in artificial intelligence. 25. Annual German Conference on AI, KI 2002, Vol. LNAI 2479, pp. 18-32, Springer Verlag, September 2002.