Formal and computational aspects of natural language syntax
Formal and computational aspects of natural language syntax
Handbook of formal languages, vol. 3
Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
Long-distance scrambling and tree adjoining grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Some computational properties of Tree Adjoining Grammars
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Tree-Local Multicomponent Tree-Adjoining Grammars with Shared Nodes
Computational Linguistics
Lexicalized Non-Local MCTAG with Dominance Links is NP-Complete
Journal of Logic, Language and Information
On Mildly Context-Sensitive Non-Linear Rewriting
Research on Language and Computation
| Hi-index | 0.00 |
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.