Tree Unification Grammar

Authors:
Fred Popowich
Affiliations:
Simon Fraser University, Burnaby, B.C., Canada
Venue:
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Year:
1989

Citing 7
Cited 0

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
A logical semantics for feature structures

ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Categorial unification grammars

COLING '86 Proceedings of the 11th coference on Computational linguistics
Discourse, anaphora and parsing

COLING '86 Proceedings of the 11th coference on Computational linguistics
Parsing strategies with 'lexicalized' grammars: application to tree adjoining grammars

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Feature structures based Tree Adjoining Grammars

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tree Unification Grammar is a declarative unification-based linguistic framework. The basic grammar structures of this framework are partial descriptions of trees, and the framework requires only a single grammar rule to combine these partial descriptions. Using this framework, constraints associated with various linguistic phenomena (reflexivisation in particular) can be stated succinctly in the lexicon.