OpenFst

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.\parThis library has key applications speech, image, and natural language processing, pattern and string matching, and machine learning.\parWe 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.\parFurther information and a download of the OpenFst library can be obtained from\par\url{http://www.openfst.org}.


References in zbMATH (referenced in 11 articles , 1 standard article )

Showing results 1 to 11 of 11.
Sorted by year (citations)

  1. Maletti, Andreas: Survey: finite-state technology in natural language processing (2017)
  2. Heuberger, Clemens; Krenn, Daniel; Kropf, Sara: Automata in SageMath -- combinatorics meet theoretical computer science (2016)
  3. Konstantinidis, Stavros; Meijer, Casey; Moreira, Nelma; Reis, Rogério: Implementation of code properties via transducers (2016)
  4. Demaille, Akim; Duret-Lutz, Alexandre; Lombardy, Sylvain; Saiu, Luca; Sakarovitch, Jacques: A type system for weighted automata and rational expressions (2014)
  5. Roche-Lima, Abiel; Domaratzki, Michael; Fristensky, Brian: Pairwise rational kernels obtained by automaton operations (2014)
  6. Allauzen, Cyril; Riley, Michael: A pushdown transducer extension for the OpenFst library (2012)
  7. Allauzen, Cyril; Riley, Michael; Schalkwyk, Johan: Filters for efficient composition of weighted finite-state transducers (2011)
  8. Engelfriet, Joost; Lilin, Eric; Maletti, Andreas: Extended multi bottom-up tree transducers (2009)
  9. Lindén, Krister; Silfverberg, Miikka; Pirinen, Tommi: HFST tools for morphology --- an efficient open-source package for construction of morphological analyzers (2009)
  10. Maletti, Andreas: Minimizing deterministic weighted tree automata (2009)
  11. Allauzen, Cyril; Riley, Michael; Schalkwyk, Johan; Skut, Wojciech; Mohri, Mehryar: OpenFst: A general and efficient weighted finite-state transducer library. (Extended abstract of an invited talk) (2007)