| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unhealthy (0) - 9 freq healthy (2) - 64 freq unearthly (3) - 1 freq healthy' (3) - 1 freq wealthy (3) - 11 freq health (3) - 133 freq unsealt (3) - 1 freq 'health (3) - 1 freq heaithy (3) - 1 freq aneath' (4) - 1 freq unhappy (4) - 10 freq unsheathit (4) - 1 freq unnerlay (4) - 1 freq wealth (4) - 28 freq heaith (4) - 1 freq stealth (4) - 4 freq unhelpfu (4) - 1 freq lealty (4) - 5 freq unselt (4) - 1 freq wealtht (4) - 18 freq healthy (4) - 1 freq unhalie (4) - 1 freq unreal (4) - 10 freq uneasy (4) - 18 freq hearth (4) - 30 freq |
unhealthy (0) - 9 freq healthy (3) - 64 freq health (4) - 133 freq 'health (4) - 1 freq halth (5) - 10 freq heaithy (5) - 1 freq hilthy (5) - 1 freq helth (5) - 1 freq unsealt (5) - 1 freq healthy' (5) - 1 freq wealthy (5) - 11 freq unholy (6) - 4 freq healt (6) - 11 freq hearth (6) - 30 freq heath (6) - 2 freq unnerthe (6) - 1 freq untelt (6) - 2 freq neath (6) - 4 freq unhailly (6) - 1 freq dishealth (6) - 1 freq sheath (6) - 3 freq aneath (6) - 106 freq 'wealth (6) - 2 freq unselt (6) - 1 freq wealth (6) - 28 freq |
SoundEx code - U543 unload - 3 freq unloadin - 6 freq unhealthy - 9 freq unilateral - 1 freq unloadit - 1 freq unwieldy - 1 freq umlaut - 3 freq unloddan - 1 freq unyauld - 1 freq unlatch - 1 freq unloaded - 1 freq unladin - 1 freq unilaterally - 5 freq umlauts - 2 freq unliterally - 1 freq |
MetaPhone code - UNHL0 unhealthy - 9 freq |
UNHEALTHY |
| Time to execute Levenshtein function - 0.190414 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.334711 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.027129 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.040101 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.000919 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. |