🧾 Chart parsing §

= a parsing strategy suitable for ambiguous grammars, which works without backtracking

How? §

• For each input word, record all possible parses
• Build up candidate trees in a chart
• onEnd: chart contains all possible parses

Algorithms §

• 🏎️ Early algorithm