Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
A study of tree adjoining grammars
A study of tree adjoining grammars
On two recent attempts to show that English is not a CFL
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Some computational properties of Tree Adjoining Grammars
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
A CYK approach to parsing in parallel: a case study
SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
Bidirectional parsing of lexicalized tree adjoining grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Comparison between CFG filtering techniques for LTAG and HPSG
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.01 |
In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description --- analysis as well as generation. In this paper we concentrate on the direction of analysis. Especially important for an implementation of that task is how efficiently this can be done, i.e., how readily the word problem can be solved for TAGs. Up to now, a parser with O(n6) steps in the worst case was known where n is the length of the input string. In this paper, the result is improved to O(n4 log n) as a new lowest upper bound. The paper demonstrates how local interpretion of TAG trees allows this reduction.