OpenFst: A General and Efficient Weighted Finite-State Transducer Library
We describe OpenFst, an open-source library for weighted finite-state transducers (WFSTs). OpenFst consists of a C++ template library with efficient WFST representations and over twenty-five operations for constructing, combining, optimizing, and searching them. At the shell-command level, there are corresponding transducer file representations and programs that operate on them. OpenFst is designed to be both very efficient in time and space and to scale to very large problems.
This library has key applications speech, image, and natural language processing, pattern and string matching, and machine learning.
We give an overview of the library, examples of its use, details of its design that allow customizing the labels, states, and weights and the lazy evaluation of many of its operations.
Further information and a download of the OpenFst library can be obtained from http://www.openfst.org.
Keywordsweighted automata finite-state transducers rational power series
Unable to display preview. Download preview PDF.
- 2.Adant, A.: WFST: a finite-state template library in C++ (2000), http://membres.lycos.fr/adant/tfe
- 3.Hetherington, L.: The MIT finite-state transducer toolkit for speech and language processing. In: Proceedings of the ICSLP, Jeju, South Korea (2004)Google Scholar
- 4.Kanthak, S., Ney, H.: FSA: An efficient and flexible C++ toolkit for finite state automata using on-demand computation. In: Proceedings of 42nd Meeting of the ACL, pp. 510–517 (2004)Google Scholar
- 9.Cortes, C., Mohri, M., Rastogi, A., Riley, M.: On the computation of the relative entropy of probabilistic automata. International Journal of Foundations of Computer Science (2007)Google Scholar
- 10.Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23 (1997)Google Scholar