Expressing generalizations in unification-based grammar formalisms

Authors:
Marc Moens;Jo Calder;Ewan Klein;Mike Reape;Henk Zeevat
Affiliations:
University of Edinburgh, Edinburgh, Scotland, UK;University of Edinburgh, Edinburgh, Scotland, UK;University of Edinburgh, Edinburgh, Scotland, UK;University of Edinburgh, Edinburgh, Scotland, UK;University of Edinburgh, Edinburgh, Scotland, UK
Venue:
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Year:
1989

Citing 7
Cited 11

A mechanical solution of Schubert's steamroller by many-sorted resolution

Artificial Intelligence
Information-based syntax and semantics: Vol. 1: fundamentals

Information-based syntax and semantics: Vol. 1: fundamentals
A flexible graph-unification formalism and its application to natural-language processing

IBM Journal of Research and Development
Implementing systemic classification by unification

Computational Linguistics
Unification and some new grammatical formalisms

TINLAP '87 Proceedings of the 1987 workshop on Theoretical issues in natural language processing
Parsing Head-driven Phrase Structure Grammar

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Unification Categorial Grammar: a concise, extendable grammar for natural language processing

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1

Syntactic and semantic knowledge in the DELPHI unification grammar

HLT '90 Proceedings of the workshop on Speech and Natural Language
Inheritance in natural language processing

Computational Linguistics - Special issue on inheritance: I
The formal and processing models of CLG

EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
A language for the statement of binary relations over feature structures

EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
CLG(n): constraint logic grammars

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Typed unification grammars

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
The semantic representation of spatial configurations: a conceptual motivation for generation in machine translation

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Shake-and-bake translation

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Enjoy the paper: lexical semantics via lexicology

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Polyadic Dynamic Logics for HPSG Parsing

Journal of Logic, Language and Information
A neurocomputational approach to prepositional phrase attachment ambiguity resolution

Neural Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 type-checking 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.