Bottom-Up Earley Deduction
<|reference_start|>Bottom-Up Earley Deduction: We propose a bottom-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.<|reference_end|>
@article{erbach1995bottom-up,
    title={Bottom-Up Earley Deduction},
    author={Gregor Erbach (University of the Saarland, Comptational Linguistics
  Dept.)},
    journal={Proceedings of COLING 94, pages 796-802},
    year={1995},
    number={CLAUS Report 39},
    archivePrefix={arXiv},
    eprint={cmp-lg/9502004},
    primaryClass={cmp-lg cs.CL}
}