Line: 1 to 1  

OpenFst Background MaterialThe following material is provided as background reading about finite state transducers. However, it is not necessary to read this material before using the OpenFst Library. For the mathematical foundations of the library, the theory of transductions and rational power series, see: Jean Berstel, "Transductions and ContextFree Languages", Teubner Studienbucher: Stuttgart, 1979 and Jean Berstel and Christophe Reutenauer, "Rational Series and Their Languages", SpringerVerlag: BerlinNew York, 1988. For a survey of weighted automata algorithms see: Mehryar Mohri, "Weighted automata algorithms". In Manfred Droste, Werner Kuich, and Heiko Vogler, editors, Handbook of Weighted Automata. Monographs in Theoretical Computer Science, pages 213254. Springer, 2009. For a general discussion on the design of an FST library, see: Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley, "The Design Principles of a Weighted FiniteState Transducer Library", Theoretical Computer Science, 231:1732, 2000. For a specific application to speech recognition, see:
The AT&T FSM Library shares many of the same goals as the OpenFst Library. For an overview of the design of the OpenFst Library, see: Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut and Mehryar Mohri, "OpenFst: A General and Efficient Weighted FiniteState Transducer LIbrary", Proceedings of the Twelfth International Conference on Implementation and Application of Automata, (CIAA 2007), Lecture Notes in Computer Science, Vol. 4783. pp. 1123. Prague, Czech Republic. Springer. For a tutorial, see: "OpenFst: An OpenSource, Weighted FiniteState Transducer Library and its Applications to Speech and Language", a presentation at NAACL HLT 2009. For the tutorial given at SLT 2010, see: "OpenFst: a General and Efficient Weighted FiniteState Transducer Library". Additional references are given with the description of individual algorithms.
