Earley Parsing

Earley Parsing is a dynamic programming algorithm for parsing strings that belong to a context-free grammar, distinguished by its use of chart parsing to efficiently handle ambiguous and left-recursive grammars through forward prediction, backward completion, and simultaneous scanning of input tokens.

44

Publications

5.5K

Citations

63

Authors

38

Institutions

Publications per year

2017–2026

3

Authors

63

  1. YS
    Yves Schabes

    University of Pennsylvania, United States

    4 publications · 370 citations

    4

    h-index

  2. RL
    René Leermakers

    Philips (Netherlands), Netherlands

    3 publications · 74 citations

    3

    h-index

  3. AS
    Andreas Stolcke

    SRI International, United States

    3 publications · 540 citations

    3

    h-index

  4. RL
    Roger Lévy

    Massachusetts Institute of Technology, United States

    3 publications · 2.2K citations

    3

    h-index

  5. DM
    David M. Magerman

    University of Pennsylvania, United States

    2 publications · 96 citations

    2

    h-index

1–5 of 63

Venues

  1. Electronic Notes in Theoretical Computer Science

    ENTCS · 3 publications · 54 citations

    3

    h-index

  2. 2

    h-index

  3. Information Processing Letters

    1 publications · 29 citations

    1

    h-index

  4. arXiv (Cornell University)

    Repository · 1 publications · 159 citations

    1

    h-index

  5. Purdue e-Pubs (Purdue University System)

    Repository · 1 publications · 10 citations

    1

    h-index

1–5