| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yosemite (0) - 2 freq semit (3) - 1 freq yolewife (3) - 1 freq nosedive (3) - 1 freq rosette (3) - 5 freq rosemill (3) - 1 freq smite (3) - 4 freq rose-fite (3) - 1 freq hosepipe (3) - 1 freq codeine (4) - 1 freq poesie (4) - 15 freq polemics (4) - 2 freq roset (4) - 2 freq somelike (4) - 2 freq olite (4) - 3 freq toremore (4) - 1 freq moste (4) - 1 freq oneste (4) - 9 freq rasmie (4) - 10 freq frostbite (4) - 5 freq semitic (4) - 1 freq petite (4) - 1 freq phemie (4) - 2 freq seemit (4) - 20 freq goamit (4) - 1 freq |
yosemite (0) - 2 freq smite (3) - 4 freq semit (3) - 1 freq smote (4) - 2 freq sumit (4) - 1 freq seemit (4) - 20 freq smit (4) - 16 freq houmit (5) - 1 freq doomit (5) - 2 freq smile (5) - 458 freq simeto (5) - 2 freq slite (5) - 4 freq swite (5) - 3 freq remote (5) - 27 freq somewie (5) - 1 freq suite (5) - 16 freq souerte (5) - 2 freq temote (5) - 1 freq somat (5) - 1 freq seimits (5) - 1 freq site (5) - 100 freq shite (5) - 325 freq comte (5) - 1 freq roamit (5) - 1 freq skite (5) - 43 freq |
SoundEx code - Y253 yosemite - 2 freq yciwmd - 1 freq ysinational - 5 freq |
MetaPhone code - YSMT yosemite - 2 freq |
YOSEMITE |
| Time to execute Levenshtein function - 0.409703 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 - 1.004686 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.165432 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.038278 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.061071 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. |