Guaranteeing parsing termination of unification grammars

Authors:
Efrat Jaeger;Nissim Francez;Shuly Wintner
Affiliations:
Israel Institute of Technology, Haifa, Israel;Israel Institute of Technology, Haifa, Israel;University of Haifa, Haifa, Israel
Venue:
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Year:
2002

Citing 4
Cited 1

The generative lexicon

Computational Linguistics
Information Retrieval

Information Retrieval
Scenario customization for information extraction

Scenario customization for information extraction
The role of wordnet in the creation of a trainable message understanding system

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

Unification Grammars and Off-Line Parsability

Journal of Logic, Language and Information

Quantified Score

Hi-index	0.01

Visualization

Abstract

Unification grammars are known to be Turing-equivalent; given a grammar G and a word w, it is undecidable whether w ε L (G). In order to ensure decidability, several constraints on grammars, commonly known as off-line parsability (OLP) were suggested. The recognition problem is decidable for grammars which satisfy OLP. An open question is whether it is decidable if a given grammar satisfies OLP. In this paper we investigate various definitions of OLP, discuss their inter-relations and show that some of them are undecidable.