| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| willamina (0) - 1 freq wilhemina (2) - 1 freq villain (3) - 3 freq villainy (3) - 1 freq willin' (3) - 3 freq bellamaina (3) - 2 freq willin (3) - 59 freq illumine (3) - 1 freq willint (3) - 5 freq pillaging (3) - 1 freq willans (3) - 1 freq villains (3) - 3 freq willan (3) - 5 freq ballamena (3) - 1 freq pillagin (3) - 3 freq willing (3) - 10 freq willna (3) - 25 freq will'a (4) - 1 freq gleaming (4) - 2 freq welcoming (4) - 3 freq willies (4) - 6 freq killagan (4) - 4 freq dillan (4) - 1 freq tinamint (4) - 1 freq glamin' (4) - 1 freq |
willamina (0) - 1 freq wilhemina (3) - 1 freq illumine (4) - 1 freq ballamena (4) - 1 freq willin (4) - 59 freq bellamaina (4) - 2 freq willan (4) - 5 freq willna (4) - 25 freq williams (5) - 32 freq willni (5) - 2 freq welcomin (5) - 8 freq hillman (5) - 3 freq wellbein (5) - 1 freq willem (5) - 1 freq willeen (5) - 2 freq wellin (5) - 5 freq william (5) - 239 freq wallopin (5) - 16 freq williamson (5) - 15 freq willno (5) - 1 freq willen (5) - 4 freq hillmen (5) - 1 freq william' (5) - 4 freq willnae (5) - 101 freq killymain (5) - 1 freq |
SoundEx code - W455 weill-muntit - 1 freq well-mannered - 1 freq weill-named - 1 freq weel-meanin - 1 freq whalman - 1 freq weel-meant - 2 freq weel-mainteened - 1 freq willamina - 1 freq wilhemina - 1 freq |
MetaPhone code - WLMN whalman - 1 freq willamina - 1 freq |
WILLAMINA |
| Time to execute Levenshtein function - 0.418462 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.595480 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.028575 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.077967 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.001217 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. |