| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evein (0) - 3 freq evenin (1) - 133 freq eveit (1) - 3 freq even (1) - 2669 freq svein (1) - 1 freq eyein (1) - 3 freq eein (1) - 7 freq evin (1) - 64 freq vein (1) - 5 freq ennin (2) - 2 freq skein (2) - 8 freq venn (2) - 1 freq erin (2) - 9 freq e'enin (2) - 3 freq leein (2) - 29 freq hiein (2) - 1 freq tiein (2) - 1 freq pevin (2) - 1 freq evan (2) - 12 freq frein (2) - 36 freq eveluin (2) - 1 freq doein (2) - 1 freq edwin (2) - 29 freq rein (2) - 14 freq apein (2) - 3 freq |
evein (0) - 3 freq evin (1) - 64 freq vein (1) - 5 freq even (1) - 2669 freq ievin (2) - 1 freq eevin (2) - 5 freq eyven (2) - 10 freq veiny (2) - 2 freq avin (2) - 2 freq yovein (2) - 1 freq vain (2) - 30 freq evn (2) - 1 freq vin (2) - 6 freq evan (2) - 12 freq oven (2) - 51 freq svein (2) - 1 freq eein (2) - 7 freq eyein (2) - 3 freq eveit (2) - 3 freq vyin (2) - 1 freq evenin (2) - 133 freq eamin (3) - 1 freq evri (3) - 13 freq haein (3) - 661 freq cyein (3) - 1 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 |
EVEIN |
| Time to execute Levenshtein function - 0.204168 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.358606 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.035654 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.039110 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.000933 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. |