Treatment of long distance dependencies in LFG and TAG: functional uncertainty in LFG is a corollary in TAG

Authors:
Aravind K. Joshi;K. Vijay-Shanker
Affiliations:
University of Pennsylvania, Philadelphia, PA;University of Delaware, Newark, DE
Venue:
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Year:
1989

Citing 7
Cited 3

A study of tree adjoining grammars

A study of tree adjoining grammars
A logical semantics for feature structures

ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Characterizing structural descriptions produced by various grammatical formalisms

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
An Earley-type parsing algorithm for Tree Adjoining Grammars

ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Combinatory Categorial Grammars: generative power and relationship to Linear Context-Free Rewriting Systems

ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
An algorithm for functional uncertainty

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

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

Using descriptions of trees in a tree adjoining grammar

Computational Linguistics
Synchronous tree-adjoining grammars

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Generating parallel multilingual LFG-TAG grammars from a MetaGrammar

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the functional uncertainty machinery in LFG is compared with the treatment of long distance dependencies in TAG. It is shown that the functional uncertainty machinery is redundant in TAG, i.e., what functional uncertainty accomplishes for LFG follows from the TAG formalism itself and some aspects of the linguistic theory instantiated in TAG. It is also shown that the analyses provided by the functional uncertainty machinery can be obtained without requiring power beyond mildly context-sensitive grammars. Some linguistic and computational aspects of these results have been briefly discussed also.