TY  - INPR
A1  - Kallmeyer, Laura
A1  - Satta, Giorgio
T1  - A polynomial-time parsing algorithm for TT-MCTAG
N2  - This paper investigates the class of Tree-Tuple MCTAG with Shared Nodes, TT-MCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language processing, in particular for dealing with discontinuities and word order variation in languages such as German. It has been shown that the universal recognition problem for this formalism is NP-hard, but so far it was not known whether the class of languages generated by TT-MCTAG is included in PTIME. We provide a positive answer to this question, using a new characterization of TT-MCTAG.
KW  - Syntaktische Analyse
KW  - Multicomponent Tree Adjoining Grammar
Y1  - 2009
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/12623
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-1135111
UR  - http://www.sfs.uni-tuebingen.de/~lk/papers/KallmSatta-ACL09.pdf
SN  - 978-1-932432-46-6
N1  - Erschienen in: Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP, Volume 2, Stroudsburg, PA : Association for Computational Linguistics, 2009, S. 994–1002, ISBN: 978-1-932432-46-6
ER  -