OpenFst: A general and efficient weighted finite-state transducer library

Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut, Mehryar Mohri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationImplementation and Application of Automata - 12th International Conference, CIAA 2007, Revised Selected Papers
PublisherSpringer Verlag
Pages11-23
Number of pages13
ISBN (Print)9783540763352
DOIs
StatePublished - 2007
Event12th International Conference on Implementation and Application of Automata, CIAA 2007 - Prague, Switzerland
Duration: Jul 16 2007Jul 18 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4783 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Conference on Implementation and Application of Automata, CIAA 2007
CountrySwitzerland
CityPrague
Period7/16/077/18/07

Keywords

  • Finite-state transducers
  • Rational power series
  • Weighted automata

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'OpenFst: A general and efficient weighted finite-state transducer library'. Together they form a unique fingerprint.

  • Cite this

    Allauzen, C., Riley, M., Schalkwyk, J., Skut, W., & Mohri, M. (2007). OpenFst: A general and efficient weighted finite-state transducer library. In Implementation and Application of Automata - 12th International Conference, CIAA 2007, Revised Selected Papers (pp. 11-23). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4783 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-76336-9_3