Expressing generalizations in unification-based grammar formalisms

This paper shows how higher levels of generalization can be introduced into unification grammars by exploiting methods for typing grammatical objects. We discuss the strategy of using global declarations to limit possible linguistic structures, and sketch a few unusual aspects of our typechecking algorithm. We also describe the sort system we use in our semantic representation language and illustrate the expressive power gained by being able to state global constraints over these sorts. Finally, we briefly illustrate the sort system by applying it to some agreement phenomena and to problems of adjunct resolution.

• Type: Conference
• Year: 1989
• Where: EACL
• Authors: Marc Moens, Jonathan Calder, Ewan Klein, Mike Reape, Henk Zeevat
• Keywords: EACL 1989, Natural Language Processing, Possible Linguistic Structures, Semantic Representation Language, Unification Grammars