Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
An optimal linear-time parallel parser for tree adjoining languages
SIAM Journal on Computing
Introduction to algorithms
Syntactic locality and tree adjoining grammar: grammatical, acquisition and processing perspectives
Syntactic locality and tree adjoining grammar: grammatical, acquisition and processing perspectives
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
Mathematical and computational aspects of lexicalized grammars
Mathematical and computational aspects of lexicalized grammars
The use of shared forests in tree adjoining grammar parsing
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Bidirectional parsing of lexicalized tree adjoining grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Some computational properties of Tree Adjoining Grammars
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
An Earley-type parsing algorithm for Tree Adjoining Grammars
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Fast context-free grammar parsing requires fast boolean matrix multiplication
Journal of the ACM (JACM)
The computational complexity of the correct-prefix property for TAGs
Computational Linguistics
Fast context-free parsing requires fast Boolean matrix multiplication
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Restrictions on tree adjoining languages
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
On the applicability of Global Index Grammars
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
Highly constrained unification grammars
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
GIGs: restricted context-sensitive descriptive power in bounded polynomial-time
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
Parsing by matrix multiplication generalized to Boolean grammars
Theoretical Computer Science
| Hi-index | 0.00 |
The computational problem of parsing a sentence in a tree-adjoining language is investigated. An interesting relation is studied between this problem and the well-known computational problem of Boolean matrix multiplication: it is shown that any algorithm for the solution of the former problem can easily be converted into an algorithm for the solution of the latter problem. This result bears on at least two important computational issues. First, we realize that a straightforward method that improves the known upper bound for tree-adjoining grammar parsing is hard to find. Second, we understand which features of the tree-adjoining grammar parsing problem are responsible for the claimed difficulty.