@TechReport{Erbach:1994_4,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Bottom-Up Earley Deduction},
      YEAR = {1994},
      MONTH = {April},
      NUMBER = {39},
      PAGES = {7},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus39.ps ftp://ftp.coli.uni-sb.de/pub/claus/claus39.dvi},
      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.},
      ANNOTE = {COLIURL : Erbach:1994:BEDb.pdf Erbach:1994:BEDb.ps Erbach:1994:BEDb.dvi}
}