by houseofshards on 4/13/15, 6:19 AM
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).
by Tepix on 4/13/15, 11:51 AM
Perhaps the spell checker should only run when there are 0 results?
by iamds on 4/13/15, 12:17 PM
How do you has words so that polynomial hashes to the same value as pollinomial?
by drikerf on 4/13/15, 11:39 AM
Great approach for simple spell checking in search!