| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evein (0) - 3 freq svein (1) - 1 freq eein (1) - 6 freq vein (1) - 5 freq evenin (1) - 133 freq even (1) - 2579 freq evin (1) - 64 freq eveit (1) - 3 freq eyein (1) - 3 freq ewin (2) - 1 freq veins (2) - 44 freq dcein (2) - 1 freq edwin (2) - 29 freq giein (2) - 436 freq eoin (2) - 9 freq vyin (2) - 1 freq hevin (2) - 20 freq spein (2) - 2 freq leein (2) - 29 freq errin (2) - 1 freq hiein (2) - 1 freq eskin (2) - 2 freq exemin (2) - 1 freq menein (2) - 2 freq veil (2) - 25 freq |
evein (0) - 3 freq even (1) - 2579 freq evin (1) - 64 freq vein (1) - 5 freq oven (2) - 51 freq evn (2) - 1 freq ievin (2) - 1 freq eevin (2) - 5 freq eyven (2) - 8 freq vin (2) - 6 freq avin (2) - 2 freq veiny (2) - 2 freq vain (2) - 29 freq vyin (2) - 1 freq yovein (2) - 1 freq evan (2) - 12 freq evenin (2) - 133 freq svein (2) - 1 freq eein (2) - 6 freq eveit (2) - 3 freq eyein (2) - 3 freq ee'n (3) - 1 freq deein (3) - 291 freq eamin (3) - 1 freq sven (3) - 2 freq |
SoundEx code - E150 even - 2579 freq eyven - 8 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 - 2579 freq eyven - 8 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.206437 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.398921 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.028359 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.039677 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.001010 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. |