| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elsewhere (0) - 28 freq erywhere (3) - 1 freq 'naewhere (3) - 1 freq naewhere (3) - 49 freq oniewhere (3) - 1 freq evriwhere (3) - 1 freq elsewhaur (3) - 13 freq somewhere (3) - 74 freq elsewhaar (3) - 2 freq ersewipe (4) - 1 freq 'sphere (4) - 1 freq pleesher (4) - 2 freq flesher (4) - 5 freq sewers (4) - 5 freq erse-hole (4) - 1 freq oniwhere (4) - 1 freq €œwhere (4) - 3 freq ivrywhere (4) - 2 freq elsewhautr (4) - 1 freq €˜where (4) - 15 freq somewheres (4) - 1 freq lswhr (4) - 1 freq sphere (4) - 14 freq enshore (4) - 2 freq €™where (4) - 2 freq |
elsewhere (0) - 28 freq elsewhaar (3) - 2 freq elsewhaur (3) - 13 freq lswhr (4) - 1 freq elsewhautr (5) - 1 freq erywhere (5) - 1 freq somewhere (5) - 74 freq 'naewhere (5) - 1 freq oniewhere (5) - 1 freq naewhere (5) - 49 freq evriwhere (5) - 1 freq onywhere (6) - 27 freq esther (6) - 46 freq lether (6) - 2 freq sewer (6) - 4 freq where (6) - 739 freq fleshery (6) - 1 freq cleesher (6) - 1 freq naywhere (6) - 1 freq elsker (6) - 1 freq naewher (6) - 4 freq 'onywhere (6) - 1 freq everywhere (6) - 45 freq elbower (6) - 1 freq 'where (6) - 15 freq |
SoundEx code - E426 elsewhaur - 13 freq elsewhere - 28 freq eleazar - 4 freq eliezer - 3 freq elosser - 1 freq elsewhaar - 2 freq eilsewharniss - 1 freq eleckoralwalliedraggs - 1 freq elywkearney - 1 freq ellsworth - 1 freq elcourier - 34 freq elixor - 1 freq elsker - 1 freq |
MetaPhone code - ELSHR elsewhaur - 13 freq elsewhere - 28 freq elsewhaar - 2 freq |
ELSEWHERE |
| Time to execute Levenshtein function - 0.216394 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.385703 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.027870 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.037282 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.000917 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. |