Abstract
In this invited talk, 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 OpenFst can be obtained from http://www.openfst.org .
The accompanying tutorial, “OpenFst in Depth”, gives an overview of algorithms, OpenFst code design and applications.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schalkwyk, J. (2010). OpenFst. In: Yli-Jyrä, A., Kornai, A., Sakarovitch, J., Watson, B. (eds) Finite-State Methods and Natural Language Processing. FSMNLP 2009. Lecture Notes in Computer Science(), vol 6062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14684-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-14684-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14683-1
Online ISBN: 978-3-642-14684-8
eBook Packages: Computer ScienceComputer Science (R0)