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

  • Authors:
  • Cyril Allauzen;Michael Riley;Johan Schalkwyk;Wojciech Skut;Mehryar Mohri

  • Affiliations:
  • Courant Institute of Mathematical Sciences, New York, NY;Google Inc., New York, NY;Google Inc., New York, NY;Google Inc., New York, NY;Courant Institute of Mathematical Sciences, New York, NY

  • Venue:
  • CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.