This algorithm can take exponential time on bad sentences for bad CFGs. With well-behaved grammars, it can be a linear time algorithm. NL grammars are not usually all that well-behaved . 1 The 2 dogs 3 cried. A chart is sometimes also called a well-formed substring table .
Actual charts get complex rapidly.
A. Thirty cents each. An attempt to parse 3 as a sentence fails, but all is not lost, as the analysis of plums as an NP is on the chart. Successful parsing of the entire utterance as any kind of structure can be useful. This algorithm expresses an efficient bottom-up parsing process. We shall use the sentence the green fly flies as an example in describing a NL-oriented parser similar to Earley's algorithm.