5 ms·
Typos in search queries at Khan Academy
- houseofshards 11y agoCool ! 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).
- castell 11y agoAs you mentioned, phonetic algorithm like Double Metaphone (stored e.g. in an SQL database) gives you probably better results (if you order the results by its score).
- gingerlime 11y agoI was also wondering about using phonetic matching as a substitute for spell checking. I guess one downside to phonetic matching vs spell-checking would be that you're not really telling the user that results are shown for a different term from the one they entered?
- drikerf 11y agoGreat approach for simple spell checking in search!
- jay-saint 11y agoThis method assumes that your content has no typos.
- Tepix 11y agoPerhaps the spell checker should only run when there are 0 results?
- iamds 11y agoHow do you has words so that polynomial hashes to the same value as pollinomial?
- lovelearning 11y agoFor the input word, generate all variants which are within edit distance of 2, generate their hashes, and check if any of those hashes are in the list of hashes generated from corpus.
- iamds 11y agosounds very expensive, surely there must be a more efficient way?