| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eevin (0) - 5 freq eerin (1) - 2 freq eenin (1) - 5 freq ievin (1) - 1 freq gevin (1) - 1 freq pevin (1) - 1 freq levin (1) - 1 freq hevin (1) - 20 freq leevin (1) - 195 freq evin (1) - 64 freq eetin (1) - 3 freq eekin (1) - 1 freq heevin (1) - 9 freq eesin (1) - 1 freq meevin (1) - 17 freq seevin (1) - 27 freq eein (1) - 7 freq deevin (1) - 4 freq reevin (1) - 3 freq nevin (1) - 1 freq kevin (1) - 46 freq pervin (2) - 1 freq deevil (2) - 17 freq peejin (2) - 1 freq begin (2) - 104 freq |
eevin (0) - 5 freq evin (1) - 64 freq ievin (1) - 1 freq deevin (2) - 4 freq vin (2) - 6 freq kevin (2) - 46 freq nevin (2) - 1 freq reevin (2) - 3 freq evein (2) - 3 freq evn (2) - 1 freq eyven (2) - 10 freq avin (2) - 2 freq evan (2) - 12 freq vein (2) - 5 freq eein (2) - 7 freq even (2) - 2669 freq eetin (2) - 3 freq pevin (2) - 1 freq seevin (2) - 27 freq eerin (2) - 2 freq hevin (2) - 20 freq eenin (2) - 5 freq levin (2) - 1 freq gevin (2) - 1 freq leevin (2) - 195 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 |
EEVIN |
| Time to execute Levenshtein function - 0.229995 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.508955 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.062876 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.038807 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.000924 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. |