Parsing CFGs and PCFGs with a Chomsky-Schützenberger representation

Authors:
Mans Hulden
Affiliations:
University of Helsinki, Language Technology, University of Helsinki, Finland
Venue:
LTC'09 Proceedings of the 4th conference on Human language technology: challenges for computer science and linguistics
Year:
2009

Citing 5
Cited 0

Formal languages

Formal languages
Automata and Computability

Automata and Computability
An efficient context-free parsing algorithm

An efficient context-free parsing algorithm
Foma: a finite-state compiler and library

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session
Statistical parsing with a context-free grammar and word statistics

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Quantified Score

Hi-index	0.01

Visualization

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.