Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

To be fair even Norvig’s implementation wasn’t great for a mobile device. It can be improved with a more efficient trie structure…


Do you have any links?


The hard part in the early spellcheckers wasn't figuring out that you want to find a set of words with a minimum edit distance from the input.

The hard part was fitting the dictionary in memory, and then searching all possible strings 1 and 2 edits away from the input to find the candidates.

The progress is that we don't have to care about storing 2.5MBytes (they ran on machines with 640k!) in RAM, or searching it 100,000 times (e.g. edits2('something')).


You do care about the 2.5 MB if memory is a concern and are limited by process where there is a very concrete threshold :)

Try fitting GIFs, Videos, images + spellchecker & autocorrection into that process


Somewhere in my email if my look back long enough haha… try searching for tightly packed tries on Google




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: