The Correct and Efficient Implementation of Appropriateness Specifications for Typed Feature Structures
<|reference_start|>The Correct and Efficient Implementation of Appropriateness Specifications for Typed Feature Structures: 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.<|reference_end|>
@article{gerdemann1994the,
    title={The Correct and Efficient Implementation of Appropriateness
  Specifications for Typed Feature Structures},
    author={Dale Gerdemann and Paul John King (University of Tuebingen, Germany)},
    journal={COLING 94 paper},
    year={1994},
    archivePrefix={arXiv},
    eprint={cmp-lg/9408001},
    primaryClass={cmp-lg cs.CL}
}