| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eyvnoo (0) - 7 freq eynoo (1) - 3 freq eanoo (2) - 3 freq e'noo (2) - 2 freq enenoo (2) - 8 freq ayenoo (2) - 2 freq enoo (2) - 8 freq eenoo (2) - 57 freq eenow (3) - 1 freq en'o (3) - 2 freq noo (3) - 5800 freq ethno (3) - 1 freq ytno (3) - 1 freq i'noo (3) - 12 freq yvio (3) - 1 freq anoo (3) - 7 freq enou (3) - 1 freq eyan (3) - 1 freq evoc (3) - 1 freq thenoo (3) - 14 freq eino (3) - 1 freq govnor (3) - 1 freq eyebroo (3) - 10 freq pjsnoo (3) - 1 freq yahoo (3) - 5 freq |
eyvnoo (0) - 7 freq eynoo (2) - 3 freq ivinoo (3) - 1 freq eyven (3) - 10 freq evn (3) - 1 freq eenoo (3) - 57 freq enoo (3) - 8 freq e'noo (3) - 2 freq eanoo (3) - 3 freq ivnou (3) - 1 freq enenoo (3) - 8 freq ayenoo (3) - 2 freq ebvn (4) - 1 freq voo (4) - 3 freq eno (4) - 9 freq nyoo (4) - 3 freq eyvind (4) - 2 freq eevin (4) - 5 freq inoo (4) - 10 freq eyne (4) - 5 freq eenno (4) - 1 freq lyno (4) - 2 freq vino (4) - 10 freq von (4) - 1 freq even (4) - 2669 freq |
SoundEx code - E150 even - 2669 freq eyven - 10 freq ehappin - 1 freq ebony - 1 freq 'even - 6 freq effin - 14 freq evn - 1 freq ebbin - 3 freq evin - 64 freq eyvnoo - 7 freq eff-in - 1 freq ebban - 1 freq evein - 3 freq ev'n - 1 freq eevin - 5 freq evan - 12 freq epona - 1 freq €˜even - 2 freq €œeven - 3 freq ebvn - 1 freq |
MetaPhone code - EFN even - 2669 freq eyven - 10 freq 'even - 6 freq effin - 14 freq evn - 1 freq evin - 64 freq eyvnoo - 7 freq eff-in - 1 freq evein - 3 freq ev'n - 1 freq eevin - 5 freq evan - 12 freq €˜even - 2 freq €œeven - 3 freq eoghan - 1 freq |
EYVNOO |
| Time to execute Levenshtein function - 0.240966 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.560529 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.028407 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.070636 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. |