| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wealtht (0) - 18 freq wealthy (1) - 11 freq wealth (1) - 25 freq wealthie (2) - 1 freq walthy (2) - 10 freq wealt (2) - 1 freq walth (2) - 35 freq health (2) - 131 freq healthy (2) - 62 freq 'wealth (2) - 2 freq whalpit (3) - 4 freq wecht (3) - 133 freq fealty (3) - 4 freq eaucht (3) - 1 freq wattet (3) - 1 freq feartit (3) - 1 freq wrastlt (3) - 2 freq healt (3) - 11 freq twelth (3) - 1 freq telttt (3) - 1 freq wantit (3) - 279 freq meltet (3) - 1 freq welch (3) - 2 freq wantet (3) - 82 freq waftit (3) - 4 freq |
wealtht (0) - 18 freq wealth (2) - 25 freq wealthy (2) - 11 freq walth (3) - 35 freq walthy (3) - 10 freq wealthie (3) - 1 freq wailth (4) - 1 freq claitht (4) - 1 freq wiltit (4) - 1 freq walthie (4) - 6 freq ywetht (4) - 1 freq 'wealth (4) - 2 freq health (4) - 131 freq healthy (4) - 62 freq wealt (4) - 1 freq waantit (5) - 22 freq waaltz (5) - 5 freq walit (5) - 11 freq watt (5) - 27 freq waitet (5) - 20 freq waicht (5) - 9 freq weathir (5) - 1 freq waitit (5) - 79 freq walter (5) - 56 freq tealight (5) - 1 freq |
SoundEx code - W433 wild-ee'd - 1 freq welded - 1 freq walted - 1 freq waldit - 1 freq wealtht - 18 freq wallie-teeth - 1 freq weel-widdit - 1 freq 'wildwood' - 1 freq weel-tae-dae - 3 freq wiltit - 1 freq wildwood - 1 freq wielded - 2 freq wildethingy - 14 freq wildathillswick - 1 freq |
MetaPhone code - WL0T wealtht - 18 freq |
WEALTHT |
| Time to execute Levenshtein function - 0.204823 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.531538 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.027638 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.070050 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.000833 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. |