| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| carleton (0) - 1 freq crueton (2) - 1 freq carton (2) - 7 freq calton (2) - 10 freq charlton (2) - 2 freq charleston (2) - 2 freq castleton (2) - 1 freq caxton (3) - 1 freq careworn (3) - 1 freq galston (3) - 2 freq arkleston (3) - 1 freq careyin (3) - 1 freq scarlett (3) - 1 freq carlos (3) - 3 freq cartons (3) - 1 freq carlton's (3) - 1 freq carson (3) - 1 freq cardoon (3) - 1 freq barton (3) - 3 freq crouton (3) - 2 freq carpeted (3) - 1 freq carnation (3) - 3 freq parton (3) - 4 freq carbon (3) - 7 freq myreton (3) - 1 freq |
carleton (0) - 1 freq charlton (3) - 2 freq calton (3) - 10 freq crueton (3) - 1 freq carton (3) - 7 freq cartoon (4) - 13 freq chilton (4) - 1 freq carlene (4) - 1 freq carnation (4) - 3 freq cornton (4) - 2 freq cretan (4) - 8 freq carlyeaston (4) - 1 freq cretin (4) - 3 freq carlin (4) - 6 freq crouton (4) - 2 freq cairton (4) - 3 freq charlatan (4) - 3 freq corleone (4) - 1 freq cartin (4) - 1 freq castleton (4) - 1 freq charleston (4) - 2 freq callerin (5) - 1 freq creation (5) - 25 freq cratin (5) - 1 freq carntyne (5) - 1 freq |
SoundEx code - C643 cruelty - 14 freq curlt - 7 freq crawlt - 3 freq curled - 44 freq crawled - 26 freq cheerleads - 1 freq crueltt - 1 freq crowlt - 1 freq craalt - 3 freq crawl't - 1 freq carlton's - 1 freq charlotte - 9 freq craaled - 8 freq curlit - 1 freq carolled - 1 freq curlie-dodie - 1 freq cheerleaders - 1 freq crowled - 2 freq charltons - 4 freq craw-leid - 1 freq corralled - 2 freq curl-doddie - 1 freq charlatan - 3 freq curly-heidit - 1 freq cruelties - 1 freq charlatans - 1 freq carltonkirby - 2 freq charlottegshore - 1 freq charlton - 2 freq carleton - 1 freq curlytalebooks - 11 freq correlation - 1 freq charltonleonies - 1 freq |
MetaPhone code - KRLTN carleton - 1 freq |
CARLETON |
| Time to execute Levenshtein function - 0.463144 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.637871 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.051388 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.054715 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.001182 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. |