| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kervin (0) - 4 freq kervit (1) - 9 freq kelvin (1) - 8 freq kervins (1) - 6 freq kerven (1) - 1 freq pervin (1) - 1 freq kevin (1) - 46 freq servin (1) - 36 freq carvin (2) - 6 freq perrin (2) - 2 freq berkin (2) - 1 freq gerkin (2) - 1 freq serrin (2) - 5 freq kertie (2) - 2 freq derivin (2) - 1 freq werkin (2) - 2 freq keepin (2) - 218 freq reivin (2) - 13 freq gerdin (2) - 2 freq serving (2) - 5 freq berlin (2) - 14 freq fertin (2) - 1 freq herin (2) - 2 freq keppin (2) - 10 freq 'servin (2) - 1 freq |
kervin (0) - 4 freq kerven (1) - 1 freq servin (2) - 36 freq kervit (2) - 9 freq pervin (2) - 1 freq kevin (2) - 46 freq kervins (2) - 6 freq kelvin (2) - 8 freq mervyn (3) - 2 freq kirnin (3) - 5 freq kerrion (3) - 1 freq kerve (3) - 5 freq kerved (3) - 4 freq eurvin (3) - 1 freq sarvin (3) - 22 freq marvin (3) - 8 freq kalvin (3) - 1 freq skirvin (3) - 1 freq kern (3) - 3 freq kertan (3) - 1 freq survin (3) - 1 freq trvin (3) - 1 freq reevin (3) - 3 freq morvin (3) - 2 freq ervine (3) - 1 freq |
SoundEx code - K615 kerven - 1 freq kervins - 6 freq kervin - 4 freq karabiner - 1 freq |
MetaPhone code - KRFN curvin - 5 freq gryphon - 335 freq caravan - 72 freq cravin - 5 freq écrivain - 1 freq kerven - 1 freq grievin - 14 freq graivn - 1 freq cairrvon - 1 freq caravaan - 16 freq carovaan - 1 freq gairravoone - 1 freq carvin - 6 freq kervin - 4 freq carven - 1 freq cairvin - 5 freq graven - 1 freq curvan - 1 freq greivin - 1 freq carryvan - 1 freq carvin' - 1 freq griffon - 1 freq |
KERVIN |
| Time to execute Levenshtein function - 0.182436 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.369552 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.027414 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.040208 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.000884 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. |