The OpenGrm open-source finite-state grammar software libraries

Authors:
Brian Roark;Richard Sproat;Cyril Allauzen;Michael Riley;Jeffrey Sorensen;Terry Tai
Affiliations:
Oregon Health & Science University, Portland, Oregon;Oregon Health & Science University, Portland, Oregon and Google, Inc., New York;Google, Inc., New York;Google, Inc., New York;Google, Inc., New York;Google, Inc., New York
Venue:
ACL '12 Proceedings of the ACL 2012 System Demonstrations
Year:
2012

Citing 5
Cited 0

Regular models of phonological rule systems

Computational Linguistics - Special issue on computational phonology
An efficient compiler for weighted rewrite rules

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
MAP adaptation of stochastic grammars

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

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
The zero-frequency problem: estimating the probabilities of novel events in adaptive text compression

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a new collection of open-source software libraries that provides command line binary utilities and library classes and functions for compiling regular expression and context-sensitive rewrite rules into finite-state transducers, and for n-gram language modeling. The OpenGrm libraries use the OpenFst library to provide an efficient encoding of grammars and general algorithms for building, modifying and applying models.