Handbook of formal languages, vol. 3
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
A Review of Early-Based Parser for TIG
IEA/AIE '98 Proceedings of the 11th international conference on Industrial and engineering applications of artificial intelligence and expert systems: methodology and tools in knowledge-based systems
The computational complexity of the correct-prefix property for TAGs
Computational Linguistics
Tabular algorithms for TAG parsing
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
| Hi-index | 0.00 |
Tree Adjoining Grammar (TAG) is a grammar formalism that has become very popular for the description of natural languages, however, this context-sensitive formalism entails important computation costs (O(n6)-time). Tree Insertion Grammar (TIG) is a compromise between Context Free Grammar (CFG) and TAG that can be parsed in O(n3) - time. In the literature, just two Earley-like parsers for TIGs have been defined. In this paper, we define a new variant of Earley-like parser for TIGs. In order to improve the performance of this parser, we show how the left corner relation for CFG can be generalized to the case of TIG and we present an efficient parser for TIG that uses this relation.