Feature formalisms and linguistic ambiguity
Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
Head-driven parsing for lexicalist grammars: experimental results
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
A comparison of rule-invocation strategies in context-free chart parsing
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
A uniform architecture for parsing and generation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Stochastic Parsing and Parallelism
CICLing '01 Proceedings of the Second International Conference on Computational Linguistics and Intelligent Text Processing
Offline Grammar-Based Recognition of Handwritten Sentences
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
We propose a botto - up variant of Earley deduction. Bottom-up deduction is preferable to top-down deduction because it allows incremental processing (even for head-driven grammars), it is data-driven, no subsumption check is needed, and preference values attached to lexical items can be used to guide best-first search. We discuss the scanning step for bottom-up Earley deduction and indexing schemes that help avoid useless deduction steps.