// n. A particularly powerful and efficient parsing algorithm for context-free grammars; it always produces a result within time Kn3 and space Kn2, where K is a constant depending on the grammar and n is the length of the input string; if ambiguous...

The Earley parser is a type of chart parser mainly used for parsing in computational linguistics, named after its inventor, Jay Earley. The algorithm uses dynamic programming. Earley parsers are appealing because they can parse all context-free...