Paper: Bottom-Up Earley Deduction

ACL ID C94-2127
Title Bottom-Up Earley Deduction
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1994

We propose a bottom-up variant of Earley de- duction. Bottom-up deduction is preferable to top-down deduction because it allows incremen- tai 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 deduc- tion steps.