Transition network grammars for natural language analysis
Communications of the ACM
Parsing some constrained grammar formalisms
Computational Linguistics
Some computational properties of Tree Adjoining Grammars
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Head automata and bilingual tiling: translation with minimal representations
ACL '96 Proceedings of the 34th 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
New models for improving supertag disambiguation
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Parsing with an extended domain of locality
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Repair strategies for lexicalized tree grammars
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Lexicalized Tree Automata-based Grammars for translating conversational texts
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Refining tabular parsers for TAGs
NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
| Hi-index | 0.00 |
In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that in conventional parsing algorithms some of the computation associated with different structures is duplicated. In this paper we describe a precompilation technique for such grammars which allows some of this computation to be shared. In our approach the elementary structures of the grammar are transformed into finite state automata which can be merged and minimised using standard algorithms, and then parsed using an automaton-based parser. We present algorithms for constructing automata from elementary structures, merging and minimising them, and string recognition and parse recovery with the resulting grammar.