A least-errors recognizer is developed informally using the well-known recognizer of Earley, along with elements of Bellman's dynamic programming. The analyzer takes a general class of context-free grammars as drivers, and any finite string as input. Recognition consists of a least-errors count for a corrected version of the input relative to the driver grammar. The algorithm design emphasizes practical aspects which help in programming it.
No takes yet. Share an insight, caveat, or question.
Gordon Lyon (1974) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: