The logic of typed feature structures
The logic of typed feature structures
Parsing and generation of unification grammars
Parsing and generation of unification grammars
The ACQUILEX LKB: an introduction
Inheritance, defaults and the lexicon
Typed feature structures as descriptions
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Feature logic with disjunctive unification
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Computational and Structural Aspects of Openly Specified Type Hierarchies
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
A computational treatment of lexical rules in HPSG as covariation in lexical entries
Computational Linguistics
Default representation in constraint-based frameworks
Computational Linguistics
On building a more efficient grammar by exploiting types
Natural Language Engineering
Off-line optimization for Earley-style HPSG processing
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Typed feature structures as descriptions
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Modularizing contexted constraints
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
In this paper, we argue that type inferencing incorrectly implements appropriateness specifications for typed feature structures, promote a combination of type resolution and unfilling as a correct and efficient alternative, and consider the expressive limits of this alternative approach. Throughout, we use feature cooccurence restrictions as illustration and linguistic motivation.