Parsing non-recursive context-free grammars

Authors:
Mark-Jan Nederhof;Giorgio Satta
Affiliations:
University of Groningen, The Netherlands;Università di Padova, Padova, Italy
Venue:
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Year:
2002

Citing 4
Cited 2

An efficient context-free parsing algorithm

Communications of the ACM
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Preserving Ambiguities in Generation via Automata Intersection

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Forest-based statistical sentence generation

NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference

The language intersection problem for non-recursive context-free grammars

Information and Computation
Training tree transducers

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars that generate finite languages. In natural language processing, this problem arises in several areas of application, including natural language generation, speech recognition and machine translation. We present two tabular algorithms for parsing of non-recursive context-free grammars, and show that they perform well in practical settings, despite the fact that this problem is PSPACE-complete.