In search of epistemic primitives in the English Resource Grammar (or Why HPSG can't live without higher-order datatypes)

This paper seeks to improve HPSG engineering through the design of more terse, readable and intuitive type signatures. It argues against the exclusive use of IS-A networks and, with reference to the English Resource Grammar, demonstrates that a collection of higher-order datatypes are already acutely in demand in contemporary HPSG design. Some default specification conventions to assist in maximizing the utility of higher-order type constructors are also discussed.

[1]  Gerald Penn.  Parametric Types for Typed Attribute-Value Logic , 1998, COLING-ACL.

[2]  Ronald J. Brachman,et al.  What's in a Concept: Structural Foundations for Semantic Networks , 1977, Int. J. Man Mach. Stud..

[3]  Gregor Erbach.  Multi-Dimensional Inheritance , 1994, ArXiv.

[4]  I. Sag.  English relative clause constructions , 1997, Journal of Linguistics.

[5]  Roger Levy,et al.  Coordination and neutralization in HPSG , 2002, Proceedings of the International Conference on Head-Driven Phrase Structure Grammar.

[6]  Jean-Pierre Koenig,et al.  Type underspecification and On-line Type Construction in the Lexicon , 1994 .

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

[8]  Gerald Penn.  Tractability and Structural Closures in Attribute Logic Type Signatures , 2001, ACL.

[9]  FlickingerDan.  On building a more efficient grammar by exploiting types , 2000 .

[10]  Michael W. Daniels.  On a Type-Based Analysis of Feature Neutrality and the Coordination of Unlikes , 2002 .

[11]  Hans-Ulrich Krieger,et al.  TDL-A Type Description Language for Constraint-Based Grammars , 1994, COLING.

[12]  Gerald Penn,et al.  The Algebraic Structure of Attributed Type Signatures , 2000 .

[13]  Gregor Erbach,et al.  ProFIT: Prolog with Features, Inheritance and Templates , 1995, EACL.

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

[15]  H. Aït-Kaci.  A lattice theoretic approach to computation based on a calculus of partially ordered type structures (property inheritance, semantic nets, graph unification) , 1984 .