Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
cablin (0) - 1 freq caalin (1) - 2 freq cabin (1) - 20 freq carlin (1) - 6 freq callin (1) - 30 freq dublin (2) - 29 freq cavin (2) - 1 freq caiklin (2) - 1 freq nailin (2) - 1 freq cauin (2) - 1 freq abuin (2) - 346 freq calvin (2) - 8 freq cartin (2) - 1 freq calmin (2) - 3 freq goblin (2) - 9 freq caukin (2) - 1 freq faalin (2) - 12 freq carpin (2) - 2 freq 'blin (2) - 1 freq wabbin (2) - 1 freq cyclin (2) - 4 freq cawin (2) - 62 freq mailin (2) - 3 freq catilin (2) - 1 freq caalan (2) - 2 freq |
cablin (0) - 1 freq carlin (2) - 6 freq callin (2) - 30 freq cabin (2) - 20 freq caalin (2) - 2 freq siblin (3) - 1 freq blin (3) - 116 freq cuilin (3) - 1 freq yabblin (3) - 2 freq amblin (3) - 3 freq callan (3) - 3 freq sablon (3) - 1 freq coaglin (3) - 1 freq curlin (3) - 17 freq bailin (3) - 3 freq raiblin (3) - 1 freq codlin (3) - 3 freq carline (3) - 33 freq cables (3) - 6 freq cable (3) - 12 freq caitlin (3) - 4 freq coolin (3) - 2 freq caallin (3) - 1 freq colin (3) - 63 freq ceilin (3) - 65 freq |
SoundEx code - C145 copland - 6 freq civilian - 2 freq civilians - 2 freq copeland - 1 freq chaplain - 1 freq couplins - 1 freq cablin - 1 freq cflanaghan - 3 freq cvplmbvpcs - 1 freq |
MetaPhone code - KBLN gabblin - 4 freq gable-en - 2 freq gobblin - 1 freq goblin - 9 freq cablin - 1 freq |
CABLIN |
Time to execute Levenshtein function - 0.203252 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.359805 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.028862 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.038750 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.000948 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. |