Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
On multiple context-free grammars
Theoretical Computer Science
Formal and computational aspects of natural language syntax
Formal and computational aspects of natural language syntax
Handbook of formal languages, vol. 3
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
An efficient context-free parsing algorithm
An efficient context-free parsing algorithm
A study of tree adjoining grammars
A study of tree adjoining grammars
Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
An alternative conception of tree-adjoining derivation
Computational Linguistics
On the complexity of ID/LP parsing 1
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
Automated extraction of tags from the penn treebank
New developments in parsing technology
Some computational complexity results for synchronous context-free grammars
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Factoring synchronous grammars by sorting
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Extraction phenomena in synchronous TAG syntax and semantics
SSST '07 Proceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation
Factorization of synchronous context-free grammars in linear time
SSST '07 Proceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation
TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
Journal of Computer and System Sciences
Synchronous and multicomponent tree-adjoining grammars: complexity, algorithms and linguistic applications
Hi-index | 0.00 |
Tree-Local Multi-Component Tree-Adjoining Grammar (TL-MCTAG) is an appealing formalism for natural language representation because it arguably allows the encapsulation of the appropriate domain of locality within its elementary structures. Its multicomponent structure allows modeling of lexical items that may ultimately have elements far apart in a sentence, such as quantifiers and wh-words. When used as the base formalism for a synchronous grammar, its flexibility allows it to express both the close relationships and the divergent structure necessary to capture the links between the syntax and semantics of a single language or the syntax of two different languages. Its limited expressivity provides constraints on movement and, we posit, may have generated additional popularity based on a misconception about its parsing complexity. Although TL-MCTAG was shown to be equivalent in expressivity to TAG when it was first introduced, the complexity of TL-MCTAG is still not well understood. This article offers a thorough examination of the problem of TL-MCTAG recognition, showing that even highly restricted forms of TL-MCTAG are NP-complete to recognize. However, in spite of the provable difficulty of the recognition problem, we offer several algorithms that can substantially improve processing efficiency. First, we present a parsing algorithm that improves on the baseline parsing method and runs in polynomial time when both the fan-out and rank of the input grammar are bounded. Second, we offer an optimal, efficient algorithm for factorizing a grammar to produce a strongly equivalent TL-MCTAG grammar with the rank of the grammar minimized.