The Correct and Efficient Implementation of Appropriateness Specifications for Typed Feature Structures
classification
cmp-lg
cs.CL
keywords
featurealternativeappropriatenesscorrectefficientspecificationsstructurestype
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.