Parsing CFGs and PCFGs with a Chomsky-Schützenberger Representation
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.
Unable to display preview. Download preview PDF.
- 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)Google Scholar
- Earley, J.: An efficient context-free parsing algorithm. PhD thesis, Carnegie-Mellon University, Pittsburgh, Pa (1968)Google Scholar
- Eisner, J.: Bilexical grammars and a cubic-time probabilistic parser. In: Proceedings of the 1997 International Workshop on Parsing Technologies (1997)Google Scholar
- Hulden, M.: Foma: a finite-state compiler and library. In: Proceedings of EACL 2009, pp. 29–32 (2009)Google Scholar