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
Pages11-23
Number of pages13
Volume4783 LNCS
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Transducers
Transducer
Libraries
Natural Language Processing
String Matching
Pattern Matching
C++
Open Source
Natural Language
Learning systems
Labels
Template
Shell
Machine Learning
Weights and Measures
Evaluation
Processing

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

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 (Vol. 4783 LNCS, pp. 11-23). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4783 LNCS).

OpenFst : A general and efficient weighted finite-state transducer library. / Allauzen, Cyril; Riley, Michael; Schalkwyk, Johan; Skut, Wojciech; Mohri, Mehryar.

Implementation and Application of Automata - 12th International Conference, CIAA 2007, Revised Selected Papers. Vol. 4783 LNCS 2007. p. 11-23 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4783 LNCS).

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

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. vol. 4783 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4783 LNCS, pp. 11-23, 12th International Conference on Implementation and Application of Automata, CIAA 2007, Prague, Switzerland, 7/16/07.
Allauzen C, Riley M, Schalkwyk J, Skut W, Mohri M. OpenFst: A general and efficient weighted finite-state transducer library. In Implementation and Application of Automata - 12th International Conference, CIAA 2007, Revised Selected Papers. Vol. 4783 LNCS. 2007. p. 11-23. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Allauzen, Cyril ; Riley, Michael ; Schalkwyk, Johan ; Skut, Wojciech ; Mohri, Mehryar. / OpenFst : A general and efficient weighted finite-state transducer library. Implementation and Application of Automata - 12th International Conference, CIAA 2007, Revised Selected Papers. Vol. 4783 LNCS 2007. pp. 11-23 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{5bc8b719e69f42e08e4e6edec8aa51b0,
title = "OpenFst: A general and efficient weighted finite-state transducer library",
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.",
keywords = "Finite-state transducers, Rational power series, Weighted automata",
author = "Cyril Allauzen and Michael Riley and Johan Schalkwyk and Wojciech Skut and Mehryar Mohri",
year = "2007",
language = "English (US)",
isbn = "9783540763352",
volume = "4783 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "11--23",
booktitle = "Implementation and Application of Automata - 12th International Conference, CIAA 2007, Revised Selected Papers",

}

TY - GEN

T1 - OpenFst

T2 - A general and efficient weighted finite-state transducer library

AU - Allauzen, Cyril

AU - Riley, Michael

AU - Schalkwyk, Johan

AU - Skut, Wojciech

AU - Mohri, Mehryar

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

KW - Finite-state transducers

KW - Rational power series

KW - Weighted automata

UR - http://www.scopus.com/inward/record.url?scp=38149133882&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149133882&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:38149133882

SN - 9783540763352

VL - 4783 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 11

EP - 23

BT - Implementation and Application of Automata - 12th International Conference, CIAA 2007, Revised Selected Papers

ER -