Paper: A Logical Semantics For Feature Structures

ACL ID P86-1038
Title A Logical Semantics For Feature Structures
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1986

Unification-based grammar formalisms use struc- tures containing sets of features to describe lin- guistic objects. Although computational algo- rithms for unification of feature structures have been worked out in experimental research, these algcwithms become quite complicated, and a more precise description of feature structures is desir- able. We have developed a model in which de- scriptions of feature structures can be regarded as logical formulas, and interpreted by sets of di- rected graphs which satisfy them. These graphs are, in fact, transition graphs for a special type of deterministic finite automaton. This semantics for feature structures extends the ideas of Pereira and Shieber [11], by providing an interpretation for values which are specified by disjunctions and path values...