Search⌘ K
AI Features

Putting It All Together

Explore how to construct a basic spellchecker using a Norvig-inspired model and understand the four key mechanisms involved. Learn to identify and improve the weaknesses in candidate generation, language modeling, error modeling, and selection methods to enhance overall spellchecker accuracy.

Review

In this section, we learned the general equation for building a spellchecker:

 arg maxc  candidates P(c)P(wc)\underset{c \ \in \ \text{candidates}} { \text{ arg\ max}} \ P(c) P(w|c)

And then, we broke this down into the four mechanisms that fulfill this equation:

  • ...