He invented the Earley parser in his early career in computer science.

The non-deterministic features include an Earley parser generator used for natural language processing.

In computer science, the Earley parser is an algorithm for parsing strings that belong to a given context-free language.

Charty a Python implementation of an Earley parser.

Spark an Object Oriented "little language framework" for Python that implements an Earley parser.

Charty-Racket A Scheme / Racket implementation of an Earley parser.

NLTK a Python toolkit that has an Earley parser.

The Earley parser is a type of chart parser mainly used for parsing in computational linguistics, named for its inventor.

C Earley Parser' An Earley parser C.

CL-EARLEY-PARSER A Common Lisp library that implements an Earley parser.

An Earley parser is an example of such an algorithm, while the widely used LR and LL parsers are simpler algorithms that deal only with more restrictive subsets of context-free grammars.

Human languages are better handled by parsers like Generalized LR parser, the Earley parser, or the CYK algorithm that can simultaneously compute all possible parse trees in one pass.

The Earley parser executes in cubic time in the general case , where n is the length of the parsed string, quadratic time for unambiguous grammars , and linear time for almost all LR(k) grammars.