| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kelman (0) - 6 freq ken-an (2) - 3 freq penman (2) - 1 freq leman (2) - 3 freq lellan (2) - 1 freq newman (2) - 20 freq yeman (2) - 1 freq teuman (2) - 1 freq kertan (2) - 1 freq german (2) - 156 freq calman (2) - 1 freq keekan (2) - 2 freq elmar (2) - 2 freq weeman (2) - 9 freq kelvin (2) - 8 freq keepan (2) - 12 freq ehman (2) - 1 freq klan (2) - 1 freq ellan (2) - 2 freq keiran (2) - 3 freq relyan (2) - 1 freq kevmac (2) - 9 freq kellyan (2) - 2 freq henman (2) - 1 freq kenan (2) - 3 freq |
kelman (0) - 6 freq kilmeny (3) - 8 freq oilman (3) - 1 freq klan (3) - 1 freq calman (3) - 1 freq killan (3) - 2 freq leman (3) - 3 freq kellyan (3) - 2 freq kelvin (3) - 8 freq railman (4) - 2 freq kalvin (4) - 1 freq filmin (4) - 2 freq kemnay (4) - 4 freq keelin (4) - 1 freq gleaman (4) - 1 freq lemen (4) - 1 freq louman (4) - 1 freq leamin (4) - 12 freq ferman (4) - 1 freq dolmen (4) - 1 freq looman (4) - 1 freq kiemon (4) - 1 freq yoleman (4) - 1 freq calmin (4) - 3 freq fleeman (4) - 9 freq |
SoundEx code - K455 kelman - 6 freq killymain - 1 freq kilimanjaro - 1 freq kleinen - 1 freq €˜kilmeny - 2 freq kilmeny - 8 freq €œkilmeny - 4 freq kilwinning - 1 freq kylieminogue - 1 freq |
MetaPhone code - KLMN gloamin - 76 freq column - 20 freq gleamin - 21 freq climbin - 18 freq climin - 6 freq claimin - 14 freq climmin - 16 freq clamin - 1 freq climbin' - 1 freq climmen - 1 freq glammin - 3 freq columbine - 2 freq kelman - 6 freq calamine - 1 freq killymain - 1 freq coalman - 1 freq glomin - 3 freq calmin - 3 freq climban - 2 freq clayman - 1 freq gloaman - 2 freq glæmin - 1 freq 'gloamin' - 1 freq glaumin - 1 freq gullie-men - 1 freq glimmin - 1 freq calman - 1 freq glimin - 1 freq collman - 1 freq gleaman - 1 freq €˜kilmeny - 2 freq kilmeny - 8 freq €œkilmeny - 4 freq “gloamin” - 1 freq glamin' - 1 freq |
KELMAN |
| Time to execute Levenshtein function - 0.178959 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.406374 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.028970 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.037400 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.000800 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. |