Disjunctions and inheritance in the context feature structure system

Authors:
Martin Böttcher
Affiliations:
GMD-IPSI, Darmstadt, Germany
Venue:
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Year:
1993

Citing 6
Cited 0

An assumption-based TMS

Artificial Intelligence
Distributed Disjunctions for LIFE

PDK '91 Proceedings of the International Workshop on Processing Declarative Knowledge
A unification method for disjunctive feature descriptions

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Unification with lazy non-redundant copying

ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Feature logic with disjunctive unification

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Strategic lazy incremental copy graph unification

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

Substantial efforts have been made in order to cope with disjunctions in constraint based grammar formalisms (e.g. [Kasper, 1987; Maxwell and Kaplan, 1991; Dörre and Eisele, 1990].). This paper describes the roles of disjunctions and inheritance in the use of feature structures and their formal semantics. With the notion of contexts we abstract from the graph structure of feature structures and properly define the search space of alternatives. The graph unification algorithm precomputes nogood combinations, and a specialized search procedure which we propose here uses them as a controlling factor in order to delay decisions as long as there is no logical necessity for deciding.