| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evite (0) - 12 freq elite (1) - 21 freq levite (1) - 2 freq evites (1) - 1 freq evie (1) - 8 freq evyte (1) - 2 freq ite (2) - 3 freq evir (2) - 4 freq edith (2) - 18 freq vile (2) - 14 freq revile (2) - 3 freq bite (2) - 156 freq elie (2) - 1 freq revise (2) - 6 freq flite (2) - 2 freq olite (2) - 3 freq efiter (2) - 1 freq devine (2) - 3 freq exit (2) - 27 freq device (2) - 23 freq exile (2) - 20 freq exits (2) - 2 freq vine (2) - 25 freq ekit (2) - 1 freq eise (2) - 2 freq |
evite (0) - 12 freq evyte (1) - 2 freq elite (2) - 21 freq eveit (2) - 3 freq vitae (2) - 3 freq vote (2) - 253 freq vit (2) - 3 freq vita (2) - 1 freq evites (2) - 1 freq levite (2) - 2 freq evie (2) - 8 freq eita (3) - 1 freq wite (3) - 3 freq evoke (3) - 3 freq site (3) - 100 freq vibe (3) - 9 freq tite (3) - 2 freq inite (3) - 6 freq gite (3) - 2 freq mite (3) - 7 freq eviry (3) - 1 freq evitit (3) - 2 freq nite (3) - 87 freq revote (3) - 1 freq edit (3) - 17 freq |
SoundEx code - E130 evyte - 2 freq evade - 2 freq e-boat - 2 freq eft - 3 freq ebbit - 1 freq effete - 4 freq ev'dy - 1 freq evite - 12 freq eveit - 3 freq evdy - 7 freq ept - 1 freq ebbhid - 1 freq efty' - 1 freq epty - 1 freq |
MetaPhone code - EFT eight - 66 freq eaught - 1 freq evyte - 2 freq evade - 2 freq eft - 3 freq eeight - 1 freq effete - 4 freq eighty - 12 freq ev'dy - 1 freq eyght - 4 freq evite - 12 freq eveit - 3 freq evdy - 7 freq €œeight - 1 freq €˜eighty - 1 freq efty' - 1 freq |
EVITE |
| Time to execute Levenshtein function - 0.219995 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.326477 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.027756 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.038308 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.000861 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. |