TY  - INPR
A1  - Kallmeyer, Laura
A2  - Rehm, Georg
A2  - Witt, Andreas
A2  - Lemnitzer, Lothar
T1  - A declarative characterization of different types of multicomponent tree adjoining grammars
N2  - Multicomponent Tree Adjoining Grammars (MCTAG) is a formalism that has been shown to be useful for many natural language applications. The definition of 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. 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. This definition gives a better understanding of the formalism, it allows a more systematic comparison of different types of MCTAG, and, furthermore, it can be exploited for parsing.
KW  - Syntaktische Analyse
KW  - Multicomponent Tree Adjoining Grammar
KW  - Datenstruktur
KW  - Computerlinguistik
KW  - Kongress
KW  - Tübingen <2007>
Y1  - 2007
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/9838
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-1110160
UR  - http://www.sfs.uni-tuebingen.de/~lk/papers/gldv07.pdf
SN  - 978-3-8233-6314-9
N1  - Erschienen in: Georg Rehm ; Andreas Witt ; Lothar Lemnitzer (Hrsg.): Datenstrukturen für linguistische Ressourcen und ihre Anwendungen = Data structures for linguistic resources and applications : proceedings of the biennial GLDV conference 2007, April 11 - 13, 2007, Eberhard-Karls-Universität Tübingen, Tübingen : Narr, 2007, S. 61-70, ISBN: 978-3-8233-6314-9
N1  - Erweiterte Fassung erschienen in: Research on language and computation, 7.2009, Nr. 1, S. 55–99, doi:10.1007/s11168-009-9064-z
ER  -