| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whussle (0) - 3 freq whusslet (1) - 1 freq whustle (1) - 10 freq whussles (1) - 2 freq whussh (2) - 1 freq whummle (2) - 7 freq whussilt (2) - 1 freq whusslin (2) - 1 freq whusslit (2) - 1 freq whuskie (2) - 6 freq hussie (2) - 1 freq fussle (2) - 8 freq hustle (2) - 1 freq hushle (2) - 1 freq whustled (2) - 2 freq hassle (2) - 24 freq wrassle (2) - 1 freq whistle (2) - 54 freq whustles (2) - 3 freq whussil (2) - 5 freq bussie (3) - 7 freq hunnle (3) - 2 freq wurse (3) - 16 freq girssle (3) - 1 freq whessan (3) - 3 freq |
whussle (0) - 3 freq whussil (2) - 5 freq whusslet (2) - 1 freq whussles (2) - 2 freq whustle (2) - 10 freq whistle (3) - 54 freq hassle (3) - 24 freq wrassle (3) - 1 freq whussilt (3) - 1 freq whussh (3) - 1 freq whusslin (3) - 1 freq whusslit (3) - 1 freq whessed (4) - 2 freq whass (4) - 1 freq whussilin (4) - 1 freq whassup (4) - 1 freq whess (4) - 3 freq wheestle (4) - 1 freq whessan (4) - 3 freq whisselt (4) - 1 freq fussle (4) - 8 freq hussie (4) - 1 freq whuskie (4) - 6 freq whummle (4) - 7 freq whustles (4) - 3 freq |
SoundEx code - W240 weekly - 25 freq wisely - 8 freq waikly - 3 freq wycely - 2 freq wiggly - 3 freq whussle - 3 freq weakly - 6 freq weasley - 2 freq weegle - 1 freq wauchle - 4 freq weasel - 3 freq wachle - 1 freq wigly - 1 freq weechil - 2 freq wechle - 1 freq waxweel - 1 freq weechile - 1 freq wicely - 2 freq whussil - 5 freq wheaselie - 1 freq waxwell - 1 freq whizzly - 1 freq wauchil - 1 freq wissel - 1 freq 'wascally - 1 freq wooglie - 1 freq wikkly - 1 freq wickly - 2 freq weigle - 1 freq wxl - 2 freq wcgl - 1 freq weasely - 1 freq wuejl - 1 freq wsshl - 1 freq |
MetaPhone code - WSL wisely - 8 freq whussle - 3 freq weasley - 2 freq weasel - 3 freq wicely - 2 freq whussil - 5 freq wheaselie - 1 freq whizzly - 1 freq wissel - 1 freq weasely - 1 freq |
WHUSSLE |
| Time to execute Levenshtein function - 0.229710 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.392615 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.027550 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.037177 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.000911 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. |