The computational complexity of sentence derivation in functional unification grammar

Authors:
Graeme Ritchie
Affiliations:
University of Edinburgh, Edinburgh
Venue:
COLING '86 Proceedings of the 11th coference on Computational linguistics
Year:
1986

Citing 3
Cited 3

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Computational complexity and lexical-functional grammar

Computational Linguistics
Functional Unification Grammar: a formalism for machine translation

ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics

Computational aspects of M-grammars

EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Unification and the new grammatism

TINLAP '87 Proceedings of the 1987 workshop on Theoretical issues in natural language processing
Functional unification grammar revisited

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Functional unification (FU) grammar is a general linguistic formalism based on the merging of feature-sets. An informal outline is given of how the definition of derivation within FU grammar can be used to represent the satisfiability of an arbitrary logical formula in conjunctive normal form. This suggests that the generation of a structure from an arbitrary arbitrary FU grammar is NP-hard, which is an undesirably high level of computational complexity.