Dynamic compilation of weighted context-free grammars

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 2, Issue , 1998, Pages 891-897

  Mohri, Mehryar ^a   Pereira, Fernando C N ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE LANGUAGES; SPEECH RECOGNITION;

CONTEXT-FREE; CONTEXT-FREE GRAMMARS; DYNAMIC COMPILATION; GRAMMAR RULES; GRAMMATICAL CONSTRUCTION; LANGUAGE PROCESSING; PROCESSING APPLICATIONS; SPEECH UNDERSTANDING; TERMINAL SYMBOLS; WEIGHTED FINITE AUTOMATON;

CONTEXT FREE GRAMMARS;

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

References (18)

1. Alfred V. Aho and Jeffrey D. Ullman. 1973. The Theory of Parsing, Translation and Compiling. Prentice-Hall.
2. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. 1974. The design and analysis of computer algorithms. Addison Wesley: Reading, MA.
3. Jean-Michel Autebert, Jean Berstel, and Luc Boasson. 1997. Context-free languages and pushdown automata. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages, volume 1, pages 111-172. Springer.
4. Lalit R. Bahl, Fred Jelinek, and Robert Mercer. 1983. A maximum likelihood approach to continuous speech recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 5(2):179-190.
5. Jean Berstel. 1979. Transductions and Context-Free Languages. Teubner Studienbucher: Stuttgart.
6. Michael K. Brown and Bruce M. Buntschuh. 1994. A context-free grammar compiler for speech understanding systems. In Proceedings of the International Conference on Spoken Language Processing (ICSLP '94), pages 21-24, Yokohama, Japan.
7. st Meeting of the Association for Computational Linguistics (ACL '83), Proceedings of the Conference. ACL.
8. Fred Karlsson, Atro Voutilainen, Juha Heikkila, and Atro Anttila. 1995. Constraint Grammar, A language-Independent System for Parsing Unrestricted Text. Mouton de Gruyter.
9. Mehryar Mohri and Richard Sproat. 1996. An efficient compiler for weighted rewrite rules. In Z4th Meeting of the Association for Computational Linguistics (ACL 96), Proceedings of the Conference, Santa Cruz, California. ACL.
10. Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley. 1998a. A rational design for a weighted finite-state transducer library. Lecture Notes in Computer Science, to appear.
11. Mehryar Mohri, Michael Riley, Don Hindle, Andrej Ljolje, and Fernando C. N. Pereira. 1998b. Full expansion of context-dependent networks in large vocabulary speech recognition. In Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP '98), Seattle, Washington.
12. Mehryar Mohri. 1997. Finite-state transducers in language and speech processing. Computational Linguistics, 23:2.
13. Mehryar Mohri. 1998a. Minimization algorithms for sequential transducers. Theoretical Computer Science, to appear.
14. Mehryar Mohri. 1998b. Weighted Grammar Tools: the GRM Library. In preparation.
15. Fernando C. N. Pereira and Rebecca N. Wright. 1997. Finite-state approximation of phrase-structure grammars. In Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing, pages 149-173. MIT Press, Cambridge, Massachusetts.
16. Lawrence Rabiner and Biing-Hwang Juang. 1993. Fundamentals of Speech Recognition. Prentice-Hall, Englewood Cliffs, NJ.
17. Arto Salomaa and Matti Soittola. 1978. Automata-Theoretic Aspects of Formal Power Series. Springer-Verlag: New York.
18. Joseph S. Ullian. 1967. Partial algorithm problems for context free languages. Information and Control, 11:90-101.