Abstract
In this work, we present a fast stochastic context-free parsing algorithm that is based on a stochastic version of the Valiant algorithm. First, the problem of computing the string probability is reduced to a transitive closure problem. Then, the closure problem is reduced to a matrix multiplication problem of matrices of a special type. Afterwards, some fast algorithm can be used to solve the matrix multiplication problem. Preliminary experiments show that, in practice, an important time savings can be obtained.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Stolcke, A.: An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics 21(2), 165–200 (1995)
Benedí, J., Sánchez, J.: Estimation of stochastic context-free grammars and their use as language models. Computer Speech and Language 19(3), 249–274 (2005)
Ney, H.: Stochastic grammars and pattern recognition. In: Laface, P., Mori, R.D. (eds.) Speech Recognition and Understanding. Recent Advances, pp. 319–344. Springer, Heidelberg (1992)
Sakakibara, Y., Brown, M., Hughey, R., Mian, I., Sjölander, K., Underwood, R., Haussle, D.: The application of stochastic context-free grammars to folding, aligning and modeling homologous rna. Computer and Information Science UCSC-CRL-94-14, Univ. of California, Santa Cruz, CA (1993)
Baker, J.: Trainable grammars for speech recognition. In: Klatt, D.H., Wolf, J.J. (eds.) Speech Communications for the 97th Meeting of the Acoustical Society of America, pp. 31–35. Acoustical Society of America (1979)
Valiant, L.: General context-free recognition in less than cubic time. Journal of computer and system sciences 10, 308–315 (1975)
Lee, L.: Fast context-free grammar parsing requires fast boolean matrix multiplication. Journal of the ACM 49(1), 1–15 (2002)
Rytter, W.: Context-free recognition via shortest paths computation: a version of valiant’s algorithm. Theoretical Computer Science 143, 343–352 (1995)
Strassen, V.: Gaussian elimination is not optimal. Numerische Mathematik 13, 354–356 (1969)
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9(3), 251–280 (1990)
Goodman, J.: Semiring parsing. Computational Linguistics 25(4), 573–605 (1999)
Harrison, M.: Introduction to Formal Language Theory. Addison-Wesley, London (1978)
Marcus, M., Santorini, B., Marcinkiewicz, M.: Building a large annotated corpus of english: the penn treebank. Computational Linguistics 19(2), 313–330 (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Benedí, JM., Sánchez, JA. (2007). Fast Stochastic Context-Free Parsing: A Stochastic Version of the Valiant Algorithm. In: Martí, J., Benedí, J.M., Mendonça, A.M., Serrat, J. (eds) Pattern Recognition and Image Analysis. IbPRIA 2007. Lecture Notes in Computer Science, vol 4477. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72847-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-72847-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72846-7
Online ISBN: 978-3-540-72847-4
eBook Packages: Computer ScienceComputer Science (R0)