Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
An optimal linear-time parallel parser for tree adjoining languages
SIAM Journal on Computing
On line context free language recognition in less than cubic time(Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
An Earley-type parsing algorithm for Tree Adjoining Grammars
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Some computational properties of tree adjoining grammars
HLT '86 Proceedings of the workshop on Strategic computing natural language
The computational complexity of the correct-prefix property for TAGs
Computational Linguistics
Restrictions on tree adjoining languages
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
An empirical evaluation of Probabilistic Lexicalized Tree Insertion Grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
We propose an O(M(n2)) time algorithm for the recognition of Tree Adjoining Languages (TALs), where n is the size of the input string and M(k) is the time needed to multiply two k x k boolean matrices. Tree Adjoining Grammars (TAGs) are formalisms suitable for natural language processing and have received enormous attention in the past among not only natural language processing researchers but also algorithms designers. The first polynomial time algorithm for TAL parsing was proposed in 1986 and had a run time of O(n6). Quite recently, an O(n3 M (n)) algorithm has been proposed. The algorithm presented in this paper improves the run time of the recent result using an entirely different approach.