论文信息 - The Correct and Efficient Implementation of Appropriateness Specifications for Typed Feature Structures

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.

Dale Gerdemann | Paul John King | P. J. King | D. Gerdemann

[1] Dale Gerdemann. Parsing and generation of unification grammars , 1992 .

[2] Ronald M. Kaplan,et al. An Overview of Disjunctive Constraint Satisfaction , 1989, IWPT.

[3] Geoffrey K. Pullum,et al. Generalized Phrase Structure Grammar , 1985 .

[4] Dale Gerdemann,et al. Typed Feature Structures for Expressing and Computationally Implementing Feature Cooccurence Restrictions , 1993 .

[5] Ted Briscoe,et al. The ACQUILEX LKB: an introduction , 1994 .

[6] Ivan A. Sag,et al. Book Reviews: Head-driven Phrase Structure Grammar and German in Head-driven Phrase-structure Grammar , 1996, CL.

[7] Thilo Gotz. A Normal Form For Typed Feature Structures , 1994 .

[8] Paul John King,et al. Typed Feature Structures as Descriptions , 1994, COLING.

[9] Bob Carpenter,et al. The logic of typed feature structures , 1992 .

[10] Bob Carpenter,et al. ALE : the attribute logic engine user's guide, version 2.0.1 , 1992 .

[11] Andreas Eisele,et al. Feature Logic with Disjunctive Unification , 1990, COLING.