A general weighted grammar library

Lecture Notes in Computer Science

Volumn 3317, Issue , 2005, Pages 23-34

  Allauzen, Cyril ^a   Mohri, Mehryar ^b   Roark, Brian ^c  

^a AT AND T LABS RESEARCH   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

^c OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; DIGITAL LIBRARIES; SPEECH PROCESSING;

BIOSEQUENCE PROCESSING; GRAMMER LIBRARY; LARGE GRAMMERS;

COMPUTATIONAL GRAMMARS;

EID: 23944496571     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30500-2_3     Document Type: Conference Paper

References (24)

1. A. V. Aho and M. J. Corasick. Efficient string matching: An aid to bibliographic search. Communications of the ACM, 18(6):333-340, 1975.
2. C. Allauzen, M. Crochemore, and M. Raffinot. Efficient experimental string matching by weak factor recognition. In Proceedings of CPM 2001, volume 2089 of Lecture Notes in Computer Science, pages 51-72, 2001.
3. C. Allauzen, M. Mohri, and B. Roark. Generalized algorithms for constructing language models. In Proceedings of ACL 2003), pages 40-47, 2003.
4. C. Allauzen and M. Raffinot. Simple optimal string matching. Journal of Algorithms, 36(1):102-116, 2000.
5. A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, and J. I. Seiferas. The smallest automaton recognizing the subwords of a text. Theoretical Computer Science, 40(1):31-55, 1985.
6. A. Blumer, J. Blumer, D. Haussler, R. M. McConnel, and A. Ehrenfeucht. Complete inverted files for efficient text retrieval and analysis. Journal of the ACM, 34(3):578-595, 1987.
7. C. Cortes and M. Mohri. Distribution Kernels Based on Moments of Counts. In Proceedings of the Twenty-First International Conference on Machine Learning (ICML 2004), Banff, Alberta, Canada, July 2004.
8. M. Crochemore. Transducers and repetitions. Theoretical Computer Science, 45(1):63-86, 1986.
9. M. Crochemore, A. Czumaj, L. Gasieniec, S. Jarominek, T. Lecroq, W. Plandowski, and W. Rytter. Speeding up two string-matching algorithms. Algorithmica, 12(4/5): 247-267, 1994.
10. R. Durbin, S. Eddy, A. Krogh, and G. Mitchison. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge UK, 1998.
11. S. M. Katz. Estimation of probabilities from sparse data for the language model component of a speech recogniser. IEEE Transactions on Acoustic, Speech, and Signal Processing, 35(3):400-401, 1987.
12. R. Kneser and H. Ney. Improved backing-off for m-gram language modeling. In Proceedings of ICASSP, volume 1, pages 181-184, 1995.
13. D. E. Knuth, J. H. Morris, Jr., and V. R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6(2):323-350, 1977.
14. M. Mohri. Syntactic analysis by local grammars automata: an efficient algorithm. In Proceedings of the International Conference on Computational Lexicography (COMPLEX 94). Linguistic Institute, Hungarian Academy of Science, 1994.
15. M. Mohri. String-matching with automata. Nordic Journal of Computing, 2(2):217-231, 1997.
16. M. Mohri. Robustness in Language and Speech Technology, chapter Weighted Grammar Tools: the GRM Library, pages 165-186. Kluwer, 2001.
17. M. Mohri and M.-J. Nederhof. Robustness in Language and Speech Technology, chapter Regular Approximation of Context-Free Grammars through Transformation, pages 153-163. Kluwer, 2001.
18. M. Mohri, F. C. N. Pereira, and M. Riley. The design principles of a weighted finite-state transducer library. Theoretical Computer Science, 231:17-32, January 2000. http://www.research.att.com/sw/tools/fsm.
19. M. Mohri, F. C. N. Pereira, and M. Riley. Weighted Finite-State Transducers in Speech Recognition. Computer Speech and Language, 16(1):69-88, 2002.
20. H. Ney, U. Essen, and R. Kneser. On structuring probabilistic dependences in stochastic language modeling. Computer Speech and Language, 8(1):1-38, 1994.
21. K. Seymore and R. Rosenfeld. Scalable backoff language models. In Proceedings of ICSLP, volume 1, pages 232-235, Philadelphia, Pennsylvania, 1996.
22. A. Stolcke. Entropy-based pruning of backoff language models. In Proc. DARPA Broadcast News Transcription and Understanding Workshop, pages 270-274, 1998.
23. A. Stolcke. SRILM - an extensible language modeling toolkit. In Proc. Intl. Conf. on Spoken Language Processing (ICSLP'2002), volume 2, pages 901-904, 2002.
24. J. Ullian. Partial algorithm problems for context free languages. Information and Control, 11:80-101, 1967.