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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Hulden, M. (2011). Parsing CFGs and PCFGs with a Chomsky-Schützenberger representation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6562 LNAI, pp. 151–160). https://doi.org/10.1007/978-3-642-20095-3_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
