Skip to content

The Correct and Efficient Implementation of Appropriateness Specifications for Typed Feature Structures

Dale Gerdemann, Paul John King

cmp-lgarXiv:cmp-lg/9408001

Abstract

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.

Create a lesson