Syntactic locality and tree adjoining grammar: grammatical, acquisition and processing perspectives
Syntactic locality and tree adjoining grammar: grammatical, acquisition and processing perspectives
An alternative conception of tree-adjoining derivation
Computational Linguistics
Tree-adjoining grammar parsing and boolean matrix multiplication
Computational Linguistics
Lexicalized context-free grammars
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
TAL recognition in O(M(n2)) time
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Capturing CFLs with Tree Adjoining Grammars
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
The weak generative capacity of linear tree-adjoining grammars
TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
Dynamic programming for higher order parsing of gap-minding trees
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
| Hi-index | 0.00 |
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n6) worst case running time. In this paper we investigate which restrictions on TAGs and TAG derivations are needed in order to lower this O(n6) time complexity, without introducing large runtime constants, and without losing any of the generative power needed to capture the syntactic constructions in natural language that can be handled by unrestricted TAGs. In particular, we describe an algorithm for parsing a strict subcalss of TAG in O(n5), and attempt to show that this subclass retains enough generative power to make it useful in the general case.