| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kevin (0) - 46 freq gevin (1) - 1 freq kevil (1) - 1 freq kelvin (1) - 8 freq kevin' (1) - 1 freq keyin (1) - 1 freq kervin (1) - 4 freq kein (1) - 1 freq nevin (1) - 1 freq levin (1) - 1 freq pevin (1) - 1 freq ievin (1) - 1 freq hevin (1) - 20 freq evin (1) - 64 freq eevin (1) - 5 freq kenin (1) - 2 freq kempin (2) - 5 freq kevinmc (2) - 1 freq savin (2) - 38 freq divin (2) - 13 freq aekin (2) - 1 freq leven (2) - 17 freq keip (2) - 4 freq keik (2) - 13 freq peein (2) - 2 freq |
kevin (0) - 46 freq pevin (2) - 1 freq levin (2) - 1 freq ievin (2) - 1 freq evin (2) - 64 freq eevin (2) - 5 freq nevin (2) - 1 freq hevin (2) - 20 freq kenin (2) - 2 freq kevil (2) - 1 freq kein (2) - 1 freq kelvin (2) - 8 freq gevin (2) - 1 freq kevin' (2) - 1 freq kervin (2) - 4 freq keyin (2) - 1 freq reevin (3) - 3 freq keepin (3) - 218 freq klein (3) - 5 freq keelin (3) - 1 freq lavin (3) - 2 freq govin (3) - 9 freq mivin (3) - 1 freq havin (3) - 73 freq evn (3) - 1 freq |
SoundEx code - K150 keepin - 218 freq keppin - 10 freq keipin - 2 freq keepin' - 8 freq keepen - 1 freq keep'n - 1 freq kevin - 46 freq kippin - 1 freq keepan - 12 freq kpn - 1 freq kevin' - 1 freq kobweeyin - 1 freq |
MetaPhone code - KFN govin - 9 freq cavin - 1 freq caffeine - 12 freq guffin - 1 freq coffin - 67 freq coafin - 1 freq gavin - 42 freq coaffin - 5 freq coughin - 14 freq coven - 4 freq cauvin - 1 freq coffen - 2 freq kevin - 46 freq govan - 10 freq quaffin - 2 freq gvaain - 1 freq gaffin - 5 freq goavin - 1 freq cofhn - 3 freq coffeen - 1 freq coaffin- - 1 freq gowfin - 2 freq gvaan - 1 freq gaughan - 8 freq cavan - 1 freq guffan - 1 freq caven - 1 freq govn - 2 freq kevin' - 1 freq |
KEVIN |
| Time to execute Levenshtein function - 0.211796 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.374857 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.028198 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.037893 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.000933 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. |