TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Typos in search queries at Khan Academy

70 pointsby johncsabout 10 years ago

4 comments

houseofshardsabout 10 years ago
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).
评论 #9366313 未加载
Tepixabout 10 years ago
Perhaps the spell checker should only run when there are 0 results?
iamdsabout 10 years ago
How do you has words so that polynomial hashes to the same value as pollinomial?
评论 #9367514 未加载
drikerfabout 10 years ago
Great approach for simple spell checking in search!
评论 #9367101 未加载