Research on Language and Computation

, Volume 7, Issue 1, pp 55–99

A Declarative Characterization of Different Types of Multicomponent Tree Adjoining Grammars

Article

DOI: 10.1007/s11168-009-9064-z

Cite this article as:
Kallmeyer, L. Res on Lang and Comput (2009) 7: 55. doi:10.1007/s11168-009-9064-z

Abstract

Multicomponent Tree Adjoining Grammars (MCTAGs) are a formalism that has been shown to be useful for many natural language applications. The definition of non-local MCTAG however is problematic since it refers to the process of the derivation itself: a simultaneity constraint must be respected concerning the way the members of the elementary tree sets are added. Looking only at the result of a derivation (i.e., the derived tree and the derivation tree), this simultaneity is no longer visible and therefore cannot be checked. i.e., this way of characterizing MCTAG does not allow to abstract away from the concrete order of derivation. In this paper, we propose an alternative definition of MCTAG that characterizes the trees in the tree language of an MCTAG via the properties of the derivation trees (in the underlying TAG) the MCTAG licences. We provide similar characterizations for various types of MCTAG. These characterizations give a better understanding of the formalisms, they allow a more systematic comparison of different types of MCTAG, and, furthermore, they can be exploited for parsing.

Keywords

Tree Adjoining GrammarMCTAGMulticomponent rewritingSimple Range Concatenation Grammar

Copyright information

© Springer Science+Business Media B.V. 2009

Authors and Affiliations

  1. 1.Collaborative Research Center 833University of TübingenTübingenGermany