Bottom-Up Earley Deduction
cmp-lg
2016-08-31 v1 Computation and Language
Abstract
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.
Cite
@article{arxiv.cmp-lg/9502004,
title = {Bottom-Up Earley Deduction},
author = {Gregor Erbach},
journal= {arXiv preprint arXiv:cmp-lg/9502004},
year = {2016}
}
Comments
7 pages, LaTeX, eaclap.sty