The OpenGrm open-source finite-state grammar software libraries

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn , Issue , 2012, Pages 61-66

  Roark, Brian ^a   Sproat, Richard ^a   Allauzen, Cyril ^b   Riley, Michael ^b   Sorensen, Jeffrey ^b   Tai, Terry ^b  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; CONTEXT FREE LANGUAGES; LIBRARIES; MODELING LANGUAGES; OPEN SYSTEMS;

COMMAND LINE; CONTEXT-SENSITIVE; FINITE STATE TRANSDUCERS; FINITE-STATE; N-GRAM LANGUAGE MODELS; OPEN-SOURCE; OPEN-SOURCE SOFTWARES; REGULAR EXPRESSIONS; REWRITE RULES; SOFTWARE LIBRARIES;

OPEN SOURCE SOFTWARE;

EID: 85119990515     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Cyril Allauzen, Mehryar Mohri, and Brian Roark. 2005. The design principles and algorithms of a weighted grammar library. International Journal of Foundations of Computer Science, 16(3):403-421.
2. Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut, and Mehryar Mohri. 2007. OpenFst: A general and efficient weighted finite-state transducer library. In Proceedings of the Twelfth International Conference on Implementation and Application of Automata (CIAA 2007), Lecture Notes in Computer Science, volume 4793, pages 11-23.
3. Michiel Bacchiani, Michael Riley, Brian Roark, and Richard Sproat. 2006. MAP adaptation of stochastic grammars. Computer Speech and Language, 20(1):41-68.
4. Stanley Chen and Joshua Goodman. 1998. An empirical study of smoothing techniques for language modeling. Technical report, TR-10-98, Harvard University.
5. Ronald M. Kaplan and Martin Kay. 1994. Regular models of phonological rule systems. Computational Linguistics, 20:331-378.
6. Slava M. Katz. 1987. Estimation of probabilities from sparse data for the language model component of a speech recogniser. IEEE Transactions on Acoustics, Speech, and Signal Processing, 35(3):400-401.
7. Reinhard Kneser and Hermann Ney. 1995. Improved backing-off for m-gram language modeling. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), pages 181-184.
8. Mehryar Mohri and Richard Sproat. 1996. An efficient compiler for weighted rewrite rules. In Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics, pages 231-238.
9. Hermann Ney, Ute Essen, and Reinhard Kneser. 1994. On structuring probabilistic dependences in stochastic language modeling. Computer Speech and Language, 8:1-38.
10. Kristie Seymore and Ronald Rosenfeld. 1996. Scalable backoff language models. In Proceedings of the International Conference on Spoken Language Processing (ICSLP).
11. Andreas Stolcke. 1998. Entropy-based pruning of backoff language models. In Proc. DARPA Broadcast News Transcription and Understanding Workshop, pages 270-274.
12. Ian H. Witten and Timothy C. Bell. 1991. The zero-frequency problem: Estimating the probabilities of novel events in adaptive text compression. IEEE Transactions on Information Theory, 37(4):1085-1094.