| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ivan (0) - 6 freq hivan (1) - 7 freq iva (1) - 1 freq evan (1) - 12 freq givan (1) - 4 freq rivan (1) - 2 freq divan (1) - 1 freq itan (1) - 1 freq van (1) - 161 freq iran (1) - 2 freq livan (1) - 6 freq ian (1) - 202 freq islan (2) - 13 freq euan (2) - 3 freq 'ian (2) - 3 freq “an (2) - 1 freq iyin (2) - 1 freq dvon (2) - 1 freq nean (2) - 1 freq tvnn (2) - 1 freq iaw (2) - 1 freq nva (2) - 2 freq awan (2) - 1 freq €”an (2) - 2 freq 'man (2) - 9 freq |
ivan (0) - 6 freq van (1) - 161 freq evan (1) - 12 freq vain (2) - 30 freq avin (2) - 2 freq even (2) - 2669 freq ievin (2) - 1 freq oven (2) - 51 freq von (2) - 1 freq vin (2) - 6 freq aiven (2) - 66 freq evin (2) - 64 freq vn (2) - 2 freq avon (2) - 3 freq evn (2) - 1 freq givan (2) - 4 freq livan (2) - 6 freq ian (2) - 202 freq hivan (2) - 7 freq iva (2) - 1 freq iran (2) - 2 freq divan (2) - 1 freq itan (2) - 1 freq rivan (2) - 2 freq iv'aa (3) - 1 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 |
IVAN |
| Time to execute Levenshtein function - 0.194169 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.361942 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.034495 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.036985 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.000841 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. |