On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG)

Authors:
Laura Kallmeyer;Yannick Parmentier
Affiliations:
Collaborative Research Center 441, University of Tübingen, Germany;Collaborative Research Center 441, University of Tübingen, Germany
Venue:
Language and Automata Theory and Applications
Year:
2008

Citing 3
Cited 1

Tree-adjoining grammars

Handbook of formal languages, vol. 3
Characterizing mildly context-sensitive grammar formalisms

Characterizing mildly context-sensitive grammar formalisms
Tree-Local Multicomponent Tree-Adjoining Grammars with Shared Nodes

Computational Linguistics

On the computational complexity of dominance links in grammatical formalisms

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the relation between TT-MCTAG, a formalism used in computational linguistics, and RCG. RCGs are known to describe exactly the class PTIME; simple RCG even have been shown to be equivalent to linear context-free rewriting systems, i.e., to be mildly context-sensitive. TT-MCTAG has been proposed to model free word order languages. In general, it is NP-complete. In this paper, we will put an additional limitation on the derivations licensed in TT-MCTAG. We show that TT-MCTAG with this additional limitation can be transformed into equivalent simple RCGs. This result is interesting for theoretical reasons (since it shows that TT-MCTAG in this limited form is mildly context-sensitive) and, furthermore, even for practical reasons: We use the proposed transformation from TT-MCTAG to RCG in an actual parser that we have implemented.