Abstract
Context-Free Grammars are the object of increasing interest in the pattern recognition research community in an attempt to overcome the limited modeling capabilities of the simpler regular grammars, and have application in a variety of fields such as language modeling, speech recognition, optical character recognition, computational biology, etc. This paper proposes an efficient algorithm to solve one of the problems associated to the use of weighted and stochastic Context-Free Grammars: the problem of computing the N best parse trees of a given string. After the best parse tree has been computed using the CYK algorithm, a large number of alternative parse trees are obtained, in order by weight (or probability), in a small fraction of the time required by the CYK algorithm to find the best parse tree. This is confirmed by experimental results using grammars from two different domains: a chromosome grammar, and a grammar modeling natural language sentences from the Wall Street Journal corpus.
This work has been supported in part by the Spanish Generalitat Valenciana under contract GV98-14-134.
Chapter PDF
Similar content being viewed by others
Keywords
References
R. Cole, editor. Survey of the State of the Art in Human Language Technology. Studies in Natural Language Processing. Cambridge University Press, 1998.
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.
K. S. Fu. Syntactic Pattern Recognition and Applications. Prentice-Hall, Englewood Cliffs, NJ, 1982.
R. C. Gonzalez and M. G. Thomason. Syntactic Pattern Recognition, An Introduction. Addison-Wesley, Reading, MA, 1978.
M. A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, MA, 1978.
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.
D. E. Knuth. The Art of Computer Programming, volume 3 / Sorting and Searching. Addison-Wesley, Reading, MA, 1973.
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.
S. E. Levinson. Structural methods in automatic speech recognition. Proceedings of the IEEE, 73(11):1625–1650, 1985.
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.
H. Ney. Dynamic programming parsing for context-free grammars in continuous speech recognition. IEEE Trans. on Signal Processing, 39(2):336–340, 1991.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiménez, V.M., Marzal, A. (2000). Computation of the N Best Parse Trees for Weighted and Stochastic Context-Free Grammars. In: Ferri, F.J., Iñesta, J.M., Amin, A., Pudil, P. (eds) Advances in Pattern Recognition. SSPR /SPR 2000. Lecture Notes in Computer Science, vol 1876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44522-6_19
Download citation
DOI: https://doi.org/10.1007/3-540-44522-6_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67946-2
Online ISBN: 978-3-540-44522-7
eBook Packages: Springer Book Archive