Estimation of stochastic context-free grammars and their use as language models

Computer Speech and Language

Volumn 19, Issue 3, 2005, Pages 249-274

  Benedi J M ^a   Sanchez J A ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; ESTIMATION; FORMAL LANGUAGES; MATHEMATICAL MODELS; PROBABILITY; STATISTICAL METHODS; STOCHASTIC CONTROL SYSTEMS; SYNTACTICS; TREES (MATHEMATICS);

CLASSICAL ESTIMATION ALGORITHMS; COMPLEX TASKS; SYNTATIC PATTERN RECOGNITION; TEST SET PERPLEXITY;

CONTEXT FREE GRAMMARS;

EID: 16344386984     PISSN: 08852308     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.csl.2004.09.001     Document Type: Article

References (41)

1. Amaya, F., Benedí, J., Sánchez, J., May 1999. Learning of stochastic context-free grammars from bracketed corpora by means of reestimation algorithms. In: Torres, M., Sanfeliu, A. (Eds.), Proceedings of the VIII Spanish Symposium on Pattern Recognition and Image Analysis. AERFAI, Bilbao, España, pp. 119-126
2. L. Bahl, F. Jelinek, and R. Mercer A maximum likelihood approach to continuous speech recognition IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-5 2 1983 179 190
3. Baker, J., June 1979. Trainable grammars for speech recognition. In: Klatt, W. (Eds.), Speech Communications for the 97th Meeting of the Acoustical Society of America. Acoustical Society of America, pp. 31-35
4. L. Baum, and G. Sell Growth transformation for functions on manifolds Pacific Journal of Mathematics 27 2 1968 211 227
5. J. Bellegarda Large vocabulary speech recognition with multispan statistical language models IEEE Transactions on Speech and Audio Processing 8 1 2000 76 84
6. Benedí, J., Sánchez, J., 2000. Combination of n-grams and stochastic context-free grammars for language modeling. In: Proceedings of COLING. International Committee on Computational Linguistics, Saarbrncken, Germany, pp. 55-61
7. T. Booth, and R. Thompson Applying probability measures to abstract languages IEEE Transactions on Computers C-22 5 1973 442 450
8. P. Brown, P. deSouza, R. Mercer, V. Pietra, and J. Lai Class-based n-gram models of natural language Computational Linguistics 18 4 1992 467 479
9. F. Casacuberta Growth transformations for probabilistic functions of stochastic grammars IJPRAI 10 3 1996 183 201
10. E. Charniak Tree-bank grammars. Tech. rep. 1996 Department of Computer Science, Brown University Providence, Rhode Island
11. Charniak, E., July 2001. Immediate-head parsing for language models. In: Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics, Toulouse, pp. 116-123
12. C. Chelba, and F. Jelinek Structured language modeling Computer Speech and Language 14 2000 283 332
13. Chen, S., 1996. Building probabilistic models for natural language. Ph.D. dissertation, Harvard University
14. Z. Chi Statistical properties of probabilistic context-free grammars Computational Linguistics 25 1 1999 131 160
15. Z. Chi, and S. Geman Estimation of probabilistic context-free grammars Computational Linguistics 24 2 1998 299 306
16. Dupont, P., 1993. Efficient integration of context-free grammars based language models in continuous speech recognition. In: New Advances and Trends in Speech Recognition and Coding. NATO ASI, pp. 179-182
17. Gilet, J., Ward, W., 1998. A language model combining trigrams and stochastic context-free grammars. In: In 5th International Conference on Spoken Language Processing. Sidney, Australia, pp. 2319-2322
18. F. Jelinek Statistical Methods for Speech Recognition 1998 MIT Press New York
19. F. Jelinek, and J. Lafferty Computation of the probability of initial substring generation by stochastic context-free grammars Computational Linguistics 17 3 1991 315 323
20. V. Jiménez, and A. Marzal Computation of the n best parse trees for weighted and stochastic context-free grammars F. Ferri J. Iñesta A. Amin P. Pudil Advances in Pattern Recognition. Lecture Notes in Computer Science, 1876 2000 Springer-Verlag 183 192
21. Jurafsky, D., Wooters, C., Segal, J., Stolcke, A., Fosler, E., Tajchman, G., Morgan, N., 1995. Using a stochastic context-free grammar as a language model for speech recognition. In: Proc. ICASSP-95. pp. 189-192
22. Kim, W., Khudanpur, S., Wu, J., 2001. Smoothing issues in the structured language model. In: Proc. EUROSPEECH'01. Aalborg, Denmark, pp. 717-720
23. K. Lari, and S. Young The estimation of stochastic context-free grammars using the inside-outside algorithm Computer, Speech and Language 4 1990 35 56
24. D. Linares, J. Benedí, and J. Sánchez Learning of stochastic context-free grammars by means of estimation algorithms and initial treebank grammars F. Perales A. Campilho N. PTrez A. Sanfeliu Iberian Conference on Pattern Recognition and Image Analysis. Lecture Notes in Computer Science, 2652 2003 Springer Berlin 403 410
25. M. Marcus, B. Santorini, and M. Marcinkiewicz Building a large annotated corpus of english: the penn treebank Computational Linguistics 19 2 1993 313 330
26. Martin, S., Kellner, A., Portele, T., 2000. Interpolation of stochastic grammar and word bigram models in natural language understanding. In: International Conference on Spoken Language Processing. Beijing, China
27. F. Nevado, J. Sánchez, and J. Benedí Combination of estimation algorithms and grammatical inference techniques to learn stochastic context-free grammars A.L. Oliveira Grammatical Inference and Applications, LNAI 1891 2000 Springer-Verlag Berlin 196 206
28. H. Ney Stochastic grammars and pattern recognition P. Laface R.D. Mori Speech Recognition and Understanding Recent Advances 1992 Springer-Verlag Berlin 319 344
29. H. Ney, U. Essen, and R. Knesser On structuring probabilistic dependences in stochastic language modelling Computer, Speech and Language 8 1994 1 38
30. Niesler, T., Woodland, P., 1996. Combination of word-based and category-based language models. In: International Conference on Spoken Language Processing. pp. 1779-1782
31. Pereira, F., Schabes, Y., 1992. Inside-outside reestimation from partially bracketed corpora. In: Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics. University of Delaware, pp. 128-135
32. B. Roark Probabilistic top-down parsing and language modeling Computational Linguistics 27 2 2001 249 276
33. Rosenfeld, R., 1995. The cmu statistical language modeling toolkit and its use in the 1994 arpa csr evaluation. In: ARPA Spoken Language Technology Workshop. Austin, Texas, USA
34. Y. Sakakibara Efficient learning of context-free grammars from positive structural examples Information and Computation 97 1992 23 60
35. Samuelsson, C., Reichl, W., 1999. A class-based language model for large-vocabulary speech recognition extracted from part-of-speech statistics. In: Proceedings of ICASSP. pp. 537-540
36. M. Siu, and M. Ostendorf Variable n-grams and extensions for conversational speech language modeling IEEE Transactions on Speech and Audio Processing 8 1 2000 63 75
37. Stolcke, A., 1994. Bayesian learning of probabilistic language models. Ph.D. thesis, University of California, Berkeley, CA
38. J. Sánchez, and J. Benedí Consistency of stochastic context-free grammmars from probabilistic estimation based on growth transformation IEEE Transactions on Pattern Analysis and Machine Intelligence 19 9 1997 1052 1055
39. Sánchez, J., Benedí, J., 1998. Estimation of the probability distributions of stochastic context-free grammars from the k-best derivations. In: In 5th International Conference on Spoken Language Processing. Sidney, Australia, pp. 2495-2498
40. Sánchez, J., Benedí, J., 1999. Learning of stochastic context-free grammars by means of estimation algorithms. In: Proc. EUROSPEECH'99. Vol. 4. Budapest, Hungary, pp. 1799-1802
41. J. Sánchez, J. Benedí, and F. Casacuberta Comparison between the inside-outside algorithm and the viterbi algorithm for stochastic context-free grammars P. Perner P. Wang A. Rosenfeld Advances in Structural and Syntactical Pattern Recognition 1996 Springer-Verlag Berlin 50 59