> Any two words within a Levenshtein distance D of each other will have the same hash (you pick D). Wait, what? Doesn't this transitively result in the whole d

> Any two words within a Levenshtein distance D of each other will have the same hash (you pick D). Wait, what? Doesn't this transitively result in the whole dictionary hashing to the same value?