The Correct and Efficient Implementation of Appropriateness Specifications for Typed Feature Structures
cmp-lg
2008-02-03 v2 Computation and Language
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.
Keywords
Cite
@article{arxiv.cmp-lg/9408001,
title = {The Correct and Efficient Implementation of Appropriateness Specifications for Typed Feature Structures},
author = {Dale Gerdemann and Paul John King},
journal= {arXiv preprint arXiv:cmp-lg/9408001},
year = {2008}
}
Comments
5 pages, postscript, compressed and uuencoded (uudecodes to gerd_king.ps.Z)