| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ievin (0) - 1 freq dievin (1) - 1 freq nevin (1) - 1 freq sievin (1) - 1 freq hevin (1) - 20 freq eevin (1) - 5 freq kevin (1) - 45 freq evin (1) - 64 freq gevin (1) - 1 freq levin (1) - 1 freq pevin (1) - 1 freq hivin (2) - 26 freq laevin (2) - 12 freq getin (2) - 1 freq eetin (2) - 3 freq deavin (2) - 8 freq issin (2) - 1 freq aetin (2) - 27 freq ryvin (2) - 1 freq devlin (2) - 1 freq givin (2) - 8 freq eyin (2) - 1 freq gie-in (2) - 2 freq devil (2) - 33 freq cavin (2) - 1 freq |
ievin (0) - 1 freq evin (1) - 64 freq eevin (1) - 5 freq evein (2) - 3 freq vein (2) - 5 freq evn (2) - 1 freq avin (2) - 2 freq vin (2) - 6 freq even (2) - 2579 freq ivan (2) - 6 freq evan (2) - 12 freq hevin (2) - 20 freq sievin (2) - 1 freq nevin (2) - 1 freq gevin (2) - 1 freq kevin (2) - 45 freq levin (2) - 1 freq dievin (2) - 1 freq pevin (2) - 1 freq heevin (3) - 9 freq viewin (3) - 3 freq iin (3) - 2 freq wein (3) - 2 freq lovin (3) - 51 freq seyin (3) - 21 freq |
SoundEx code - I150 iphone - 7 freq if'n - 1 freq iffen - 4 freq ivanhoe - 1 freq ivinoo - 1 freq ipon - 16 freq ivan - 6 freq ievin - 1 freq i'pain - 1 freq i'phone - 6 freq i'bin - 2 freq i'bun - 6 freq ivnou - 1 freq ibone - 1 freq ipma - 1 freq iybbbnue - 1 freq ipn - 1 freq |
MetaPhone code - IFN iphone - 7 freq if'n - 1 freq iffen - 4 freq ivinoo - 1 freq ivan - 6 freq ievin - 1 freq i'phone - 6 freq ivnou - 1 freq |
IEVIN |
| Time to execute Levenshtein function - 0.239865 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.484643 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.033155 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.042544 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.000891 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. |