Computation of the N best parse trees for weighted and stochastic context-free grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1876 LNCS, Issue , 2000, Pages 183-192

  Jiménez, Víctor M ^a   Marzal, Andrés ^a  

^a UNIVERSITAT JAUME I   (Spain)

Author keywords

CYK algorithm; JV best parse trees; Stochastic context free grammars; Weighted context free grammars

Indexed keywords

CHROMOSOMES; COMPUTATIONAL EFFICIENCY; CONTEXT FREE LANGUAGES; FORESTRY; MODELING LANGUAGES; NATURAL LANGUAGE PROCESSING SYSTEMS; OPTICAL CHARACTER RECOGNITION; SPEECH RECOGNITION; STOCHASTIC SYSTEMS; TREES (MATHEMATICS); ALGORITHMS; BIOINFORMATICS; CHARACTER RECOGNITION; CONTEXT FREE GRAMMARS; PATTERN RECOGNITION;

COMPUTATIONAL BIOLOGY; DIFFERENT DOMAINS; NATURAL LANGUAGES; PARSE TREES; REGULAR GRAMMAR; RESEARCH COMMUNITIES; STOCHASTIC CONTEXT FREE GRAMMAR; WALL STREET JOURNAL;

CONTEXT FREE GRAMMARS; CONTEXT FREE LANGUAGES;

EID: 46949095440     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44522-6_19     Document Type: Conference Paper

References (14)

1. R. Cole, editor. Survey of the State of the Art in Human Language Technology. Studies in Natural Language Processing. Cambridge University Press, 1998.
2. A. Corazza, R. De Mori, R. Gretter, and G. Satta. Optimal probabilistic evaluation functions for search controlled by stochastic context-free grammars. IEEE Trans. on Pattern Analysis and Machine Intelligence, 16(10):1018-1027, 1994.
3. K. S. Fu. Syntactic Pattern Recognition and Applications. Prentice-Hall, Engle-wood Cliffs, NJ, 1982.
4. R. C. Gonzalez and M. G. Thomason. Syntactic Pattern Recognition, An Introduction. Addison-Wesley, Reading, MA, 1978.
5. M. A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, MA, 1978.
6. F. Jelinek, J. D. Lafferty, and R. L. Mercer. Basic methods of probabilistic context free grammars. In P. Laface and R. De Mori, editors, Speech Recognition and Understanding, volume F75 of NATO ASI, pages 345-360. Springer-Verlag, 1992.
7. D. E. Knuth. The Art of Computer Programming, volume 3 / Sorting and Searching. Addison-Wesley, Reading, MA, 1973.
8. K. Lari and S. J. Young. Applications of stochastic context-free grammars using the Inside-Outside algorithm. Computer, Speech and Language, 5:237-257, 1991.
9. S. E. Levinson. Structural methods in automatic speech recognition. Proceedings of the IEEE, 73(11):1625-1650, 1985.
10. M. P. Marcus, B. Santorini, and M. A. Marcinkiewicz. Building a large annotated corpus of English: the Penn Treebank. Computational Linguistics, 19(2):313-330, 1993.
11. H. Ney. Dynamic programming parsing for context-free grammars in continuous speech recognition. IEEE Trans. on Signal Processing, 39(2):336-340, 1991.
12. Y. Sakakibara, M. Brown, R. Hughey, I. S. Mian, K. Sjolander, R. C. Underwood, and D. Haussler. Stochastic context-free grammars for tRNA modeling. Nucleic Acids Research, 22(23):5112-5120, 1994.
13. J. A. Sánchez and J. M. Benedí. Estimation of the probability distributions of stochastic context free grammars from the K-best derivations. In Proc. Int. Conf. on Spoken Language Processing (ICSLP), pages 2495-2498, 1998.
14. J. A. Sánchez and J. M. Benedí. Learning of stochastic context-free grammars by means of estimation algorithms. In Proc. of the European Conf. on Speech Communication and Technology (EUROSPEECH), 1999.