Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
The equivalence of four extensions of context-free grammars
Mathematical Systems Theory
An efficient context-free parsing algorithm
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
Parsing some constrained grammar formalisms
Computational Linguistics
An alternative conception of tree-adjoining derivation
Computational Linguistics
Tree-adjoining grammar parsing and boolean matrix multiplication
Computational Linguistics
An alternative LR algorithm for TAGS
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Some computational properties of Tree Adjoining Grammars
ACL '85 Proceedings of the 23rd 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
An optimal tabular parsing algorithm
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
An extended theory of head-driven parsing
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Deterministic left to right parsing of Tree Adjoining Languages
ACL '90 Proceedings of the 28th 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
Mixed Parsing of Tree Insertion and Tree Adjoining Grammars
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Left Corner Parser for Tree Insertion Grammars
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Relating tabular parsing algorithms for LIG and TAG
New developments in parsing technology
Generating XTAG parsers from algebraic specifications
TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
| Hi-index | 0.00 |
A new upper bound is presented for the computational complexity of the parsing problem for TAGs, under the constraint that input is read from left to right in such a way that errors in the input are observed as soon as possible, which is called the "correct-prefix property." The former upper bound, O(n9), is now improved to O(n6), which is the same as that of practical parsing algorithms for TAGs without the additional constraint of the correct-prefix property.