Some remarks on the decidability of the generation problem in LFG- and PATR-style unification grammars

Authors:
Jürgen Wedekind
Affiliations:
University of Stuttgart, Stuttgart, FRG
Venue:
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Year:
1995

Citing 2
Cited 4

Classical logics for attribute-value languages

EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Feature graphs and abstract data types: a unifying approach

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1

Ambiguity-preserving generation with LFG-and PATR-style grammars

Computational Linguistics
Semantic-driven generation with LFG-and PATR-style grammars

Computational Linguistics
LFG generation produces context-free languages

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Lfg generation by grammar specialization

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we prove the decidability of the generation problem for those unification grammars which are based on context-free phrase structure rule skeletons, like e.g. LFG and PATR-II. The result shows a perhaps unexpected asymmetry, since it is valid also for those unification grammars whose parsing problem is undecidable, e.g. grammars which do not satisfy the off-line parsability constraint. The general proof is achieved by showing that the space of the derivations which have to be considered in order to decide the problem for a given input is always restricted to derivations whose length is limited by some fixed upper bound which is determined relative to the "size" of the input.