A Polynomial-Time Parsing Algorithm for TT-MCTAG

This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG 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 TTMCTAG.

• Type: Journal
• Year: 2009
• Where: ACL
• Authors: Laura Kallmeyer, Giorgio Satta
• Keywords: ACL 2009, Computational Linguistics, Tree Adjoining Grammars, Universal Recognition Problem, Word Order Variation