Earley parser (CFG Parsing CFG Problems)

Time Complexity

$O(n^{3})$

Space Complexity

$O(n^{2})$ words

(https://web.archive.org/web/20040708052627/http://www-2.cs.cmu.edu/afs/cs.cmu.edu/project/cmt-55/lti/Courses/711/Class-notes/p94-earley.pdf)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1968

Reference

https://web.archive.org/web/20040708052627/http://www-2.cs.cmu.edu/afs/cs.cmu.edu/project/cmt-55/lti/Courses/711/Class-notes/p94-earley.pdf