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

Simple item page
dc.creatorGerdemann, Dale
dc.creatorKing, Paul John
dc.date1994-08-01
dc.date1994-08-02
dc.date.accessioned2026-07-07T08:58:37Z
dc.date.available2026-07-07T08:58:37Z
dc.descriptionIn 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.
dc.description5 pages, postscript, compressed and uuencoded (uudecodes to gerd_king.ps.Z)
dc.identifierhttps://arxiv.org/abs/cmp-lg/9408001
dc.identifierhttp://arxiv.org/abs/cmp-lg/9408001
dc.identifierCOLING 94 paper
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/147392
dc.subjectComputation and Language
dc.titleThe Correct and Efficient Implementation of Appropriateness Specifications for Typed Feature Structures
dc.typetext

Files

Collections

arXiv