The relationship between Tree Adjoining Grammars and Head Grammars

Authors:
D. J. Weir;K. Vijay-Shanker;A. K. Joshi
Affiliations:
University of Pennsylvania, Philadelphia, PA;University of Pennsylvania, Philadelphia, PA;University of Pennsylvania, Philadelphia, PA
Venue:
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Year:
1986

Citing 2
Cited 3

Some computational properties of Tree Adjoining Grammars

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Tree adjoining and head wrapping

COLING '86 Proceedings of the 11th coference on Computational linguistics

A formal model for context-free languages augmented with reduplication

Computational Linguistics
Fragmentation and part of speech disambiguation

EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Tree adjoining and head wrapping

COLING '86 Proceedings of the 11th coference on Computational linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine the relationship between the two grammatical formalisms: Tree Adjoining Grammars and Head Grammars. We briefly investigate the weak equivalence of the two formalisms. We then turn to a discussion comparing the linguistic expressiveness of the two formalisms.