Abstract
We present a parsing algorithm for arbitrary context-free and probabilistic context-free grammars based on a representation of such grammars as a combination of a regular grammar and a grammar of balanced parentheses, similar to the representation used in the Chomsky-Schützenberger theorem. The basic algorithm has the same worst-case complexity as the popular CKY and Earley parsing algorithms frequently employed in natural language processing tasks.
This research has received funding from the European Commission’s 7th Framework Program under grant agreement no. 238405 (CLARA).
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
Charniak, E.: Statistical parsing with a context-free grammar and word statistics. In: Proceedings of the 14th National Conference on Artificial Intelligence, pp. 598–603 (1997)
Chomsky, N., Schützenberger, M.-P.: The algebraic theory of context-free languages. In: Braffort, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems, pp. 118–161. North Holland, Amsterdam (1963)
Earley, J.: An efficient context-free parsing algorithm. PhD thesis, Carnegie-Mellon University, Pittsburgh, Pa (1968)
Eisner, J.: Bilexical grammars and a cubic-time probabilistic parser. In: Proceedings of the 1997 International Workshop on Parsing Technologies (1997)
Hulden, M.: Foma: a finite-state compiler and library. In: Proceedings of EACL 2009, pp. 29–32 (2009)
Kozen, D.C.: Automata and Computability. Springer, Heidelberg (1997)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
Younger, D.H.: Recognition and parsing of context-free languages in time n 3. Information and Control 10, 189–208 (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hulden, M. (2011). Parsing CFGs and PCFGs with a Chomsky-Schützenberger Representation. In: Vetulani, Z. (eds) Human Language Technology. Challenges for Computer Science and Linguistics. LTC 2009. Lecture Notes in Computer Science(), vol 6562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20095-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-20095-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20094-6
Online ISBN: 978-3-642-20095-3
eBook Packages: Computer ScienceComputer Science (R0)