Typos in search queries at Khan Academy

Cool ! At some point, you could also consider building an index: retrieve "possible candidate corrections" by issuing a query against this index, and score the candidates using some combination of features (such as edit distance, phonetic similarity etc).

Perhaps the spell checker should only run when there are 0 results?

How do you has words so that polynomial hashes to the same value as pollinomial?

Great approach for simple spell checking in search!