A faster Earley parser

  • Philippe McLean
  • R. Nigel Horspool
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1060)


We present a parsing technique which is a hybrid of Earley's method and the LR(k) methods. The new method retains the ability of Earley's method to parse using arbitrary context-free grammars. However, by using precomputed LR(k) sets of items, we obtain much faster recognition speeds while also reducing memory requirements.


Parse Tree Input Symbol Reduce Memory Requirement Parsing Technique Parsing Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Donnelly, C., and Stallman, R. BISON: Reference Manual. Free Software Foundation, Cambridge, MA, 1992.Google Scholar
  2. 2.
    Earley, J. An Efficient Context-Free Parsing Algorithm. Comm. ACM 13, 2 (Feb. 1970), 94–102.Google Scholar
  3. 3.
    Earley, J. An Efficient Context-Free Parsing Algorithm. Ph.D. Thesis, Camegie-Mellon University, 1968.Google Scholar
  4. 4.
    Grune, D., and Jacob, C.J.H. Parsing Techniques: a practical guide. Ellis Horwood, Chichester, 1990.Google Scholar
  5. 5.
    Johnson, S.C. YACC: Yet Another Compiler-Compiler. UNIX Programmer's Supplementary Documents, vol 1, 1986.Google Scholar
  6. 6.
    Tomita, M. Efficient Parsing for Natural Language. Kluwer Academic Publishers, Boston, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Philippe McLean
    • 1
  • R. Nigel Horspool
    • 1
  1. 1.Dept. of Computer ScienceUniversity of VictoriaVictoriaCanada

Personalised recommendations