4 ms·
There is no such magical hash. Any hash splits the space of words into equivalence classes and unless there's only one equivalence class, there must be words th
by StefanKarpinski 12y ago
There is no such magical hash. Any hash splits the space of words into equivalence classes and unless there's only one equivalence class, there must be words that are edit distance one apart that are in different classes since you can get from any word to any other by a sequence of single edits.
- fchollet 12y agoAny single hash will be suboptimal; the "magic" would be to use a bunch of different hashes to partition your space into suboptimal buckets, and use all of them at once to get very good (though still approximative) query results. This is what Spotify's excellent Annoy library does. [1] [1] https://github.com/spotify/annoy https://github.com/spotify/annoy