| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eyvind (0) - 2 freq byvind (1) - 1 freq ervine (2) - 1 freq eyein (2) - 3 freq Øyvind (2) - 19 freq ylind (2) - 1 freq eyin (2) - 1 freq eyland (2) - 2 freq eyven (2) - 10 freq ryvin (2) - 1 freq eind (2) - 1 freq eynd (2) - 1 freq eevin (2) - 5 freq evin (2) - 64 freq eyeing (2) - 1 freq wyvin (2) - 15 freq envied (2) - 3 freq dying (3) - 15 freq eerin (3) - 2 freq eisin (3) - 1 freq devine (3) - 3 freq elfin (3) - 5 freq evict (3) - 2 freq edwin (3) - 29 freq lyin (3) - 332 freq |
eyvind (0) - 2 freq byvind (2) - 1 freq eyven (3) - 10 freq eind (3) - 1 freq eevin (3) - 5 freq evin (3) - 64 freq eynd (3) - 1 freq eyland (3) - 2 freq vynd (3) - 4 freq vand (3) - 2 freq ylind (3) - 1 freq evened (3) - 1 freq kind (4) - 691 freq beyond (4) - 102 freq fuind (4) - 1 freq avin (4) - 2 freq wiind (4) - 1 freq cind (4) - 2 freq hynd (4) - 1 freq sind (4) - 1 freq synd (4) - 4 freq gind (4) - 1 freq devined (4) - 1 freq wind (4) - 482 freq veined (4) - 2 freq |
SoundEx code - E153 event - 103 freq eventide - 2 freq eventually - 159 freq events - 85 freq evendoun - 11 freq evendounness - 1 freq eventimes - 1 freq ebbmaet - 1 freq eyvind - 2 freq eapand - 1 freq eventfa - 1 freq evintually - 4 freq eh've-met - 1 freq eventuallie - 2 freq evendoon - 5 freq eventual - 4 freq eventfu - 2 freq evander's - 1 freq evened - 1 freq event'll - 1 freq eventful - 2 freq evindounlie - 1 freq evindoun - 1 freq eventuate - 1 freq €œeventually - 1 freq efpnta - 1 freq evandonoghue - 1 freq eventscotnews - 1 freq eventbrite - 1 freq eventbriteuk - 2 freq |
MetaPhone code - EFNT event - 103 freq eyvind - 2 freq evened - 1 freq eoghand - 1 freq |
EYVIND |
| Time to execute Levenshtein function - 0.225980 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.362759 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.036481 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.037462 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.000941 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. |