| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whummles (0) - 1 freq hummles (1) - 1 freq whummle (1) - 7 freq whummled (1) - 7 freq whummlet (1) - 1 freq whammle (2) - 2 freq wummled (2) - 3 freq stummles (2) - 1 freq rummles (2) - 3 freq thrummles (2) - 1 freq hummled (2) - 1 freq wummle (2) - 1 freq brummles (2) - 4 freq whummlin (2) - 2 freq whustles (2) - 3 freq fummles (2) - 2 freq whammled (2) - 1 freq mummles (2) - 1 freq hummle (2) - 12 freq tummles (2) - 2 freq whummlins (2) - 1 freq whammlet (2) - 1 freq whussles (2) - 2 freq hummlys (2) - 1 freq whummlle (2) - 1 freq |
whummles (0) - 1 freq whummled (2) - 7 freq whummlet (2) - 1 freq whummle (2) - 7 freq hummles (2) - 1 freq whammled (3) - 1 freq whummlin (3) - 2 freq whummlins (3) - 1 freq whummlle (3) - 1 freq whammlet (3) - 1 freq hummlys (3) - 1 freq whammle (3) - 2 freq whussles (4) - 2 freq crummles (4) - 4 freq whammlins (4) - 1 freq hummels (4) - 1 freq whummilt (4) - 2 freq whummiins (4) - 1 freq whummelt (4) - 5 freq whammlin (4) - 1 freq whummil (4) - 1 freq thrummles (4) - 1 freq brummles (4) - 4 freq wummle (4) - 1 freq rummles (4) - 3 freq |
SoundEx code - W542 wanlos - 1 freq wameless - 1 freq wanless - 3 freq wanlessly - 1 freq wanluck - 1 freq whummles - 1 freq wean-like - 1 freq winless - 1 freq wanlockheid - 1 freq wanlas - 1 freq wanluk - 1 freq wanlucky - 1 freq winnelstrae - 1 freq |
MetaPhone code - WMLS wameless - 1 freq whummles - 1 freq |
WHUMMLES |
| Time to execute Levenshtein function - 0.201294 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.374442 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.027973 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.037702 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000940 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |