| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wannabees (0) - 3 freq wannabe (2) - 6 freq wanners (3) - 3 freq cannases (3) - 1 freq wannae (3) - 6 freq cannabis (3) - 1 freq winnable (3) - 1 freq annabel (3) - 1 freq baabees (3) - 1 freq cannaee (3) - 1 freq jannies (4) - 3 freq fannies (4) - 12 freq mannie's (4) - 20 freq carnbee (4) - 1 freq windaes (4) - 151 freq manages (4) - 14 freq winners (4) - 30 freq sannals (4) - 1 freq wadnae (4) - 60 freq cannae (4) - 1640 freq wann'er (4) - 1 freq dinnaes (4) - 1 freq valuables (4) - 3 freq annie's (4) - 8 freq winnae (4) - 46 freq |
wannabees (0) - 3 freq wannabe (3) - 6 freq cannabis (4) - 1 freq wanners (4) - 3 freq winnable (4) - 1 freq winnie's (5) - 1 freq waunners (5) - 2 freq wonners (5) - 1 freq wunners (5) - 21 freq annabel (5) - 1 freq cannases (5) - 1 freq wannae (5) - 6 freq winners (5) - 30 freq mannies (6) - 32 freq wannert (6) - 22 freq banners (6) - 15 freq annas (6) - 2 freq cannas (6) - 2 freq fanners (6) - 1 freq hannles (6) - 5 freq annals (6) - 5 freq wannered (6) - 3 freq wundaes (6) - 9 freq hannies (6) - 3 freq wauners (6) - 1 freq |
SoundEx code - W512 winnipeg - 1 freq wimps - 1 freq wampishin - 1 freq wannabees - 3 freq whin-bush - 1 freq wampish - 1 freq whinbush - 1 freq wimpykid - 3 freq wwnvbgkiy - 1 freq wmbps - 1 freq win-fucking-dow - 1 freq |
MetaPhone code - WNBS wannabees - 3 freq |
WANNABEES |
| Time to execute Levenshtein function - 0.201254 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.358241 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.027430 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.037245 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.000946 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. |