Using an annotated corpus as a stochastic grammar
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Applying explanation-based learning to control and speeding-up natural language generation
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
A probabilistic corpus-driven model for lexical-functional analysis
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Some novel applications of Explanation-Based Learning to parsing Lexicalized Tree-Adjoining Grammars
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Grammar specialization through entropy thresholds
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Relating complexity to practical performance in parsing with wide-coverage unification grammars
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Fast parsing using pruning and grammar specialization
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Corpus-based grammar specialization
ConLL '00 Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning - Volume 7
From ubgs to cfgs a practical corpus-driven approach
Natural Language Engineering
| Hi-index | 0.00 |
Sophisticated grammar formalisms, such as LFG, allow concisely capturing complex linguistic phenomena. The powerful operators provided by such formalisms can however introduce spurious ambiguity, making parsing inefficient. A simple form of corpus-based grammar pruning is evaluated experimentally on two wide-coverage grammars, one English and one French. Speedups of up to a factor 6 were obtained, at a cost in grammatical coverage of about 13%. A two-stage architecture allows achieving significant speedups without introducing additional parse failures.