Abstract
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.
Cite
CITATION STYLE
Kallmeyer, L., & Satta, G. (2009). A Polynomial-Time Parsing Algorithm for TT-MCTAG. In ACL-IJCNLP 2009 - Joint Conf. of the 47th Annual Meeting of the Association for Computational Linguistics and 4th Int. Joint Conf. on Natural Language Processing of the AFNLP, Proceedings of the Conf. (pp. 994–1002). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1690219.1690285
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
