Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
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
Some computational properties of Tree Adjoining Grammars
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Automatic Generation of Natural Language Parsers from Declarative Specifications
Proceedings of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium
A compiler for parsing schemata
Software—Practice & Experience
Generation of indexes for compiling efficient parsers from formal specifications
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Compiling declarative specifications of parsing algorithms
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
In this paper, a generic system that generates parsers from parsing schemata is applied to the particular case of the XTAG English grammar. In order to be able to generate XTAG parsers, some transformations are made to the grammar, and TAG parsing schemata are extended with feature structure unification support and a simple tree filtering mechanism. The generated implementations allow us to study the performance of different TAG parsers when working with a large-scale, wide-coverage grammar.