| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| charlotte (0) - 9 freq garotte (3) - 1 freq harlot (3) - 2 freq charlton (3) - 2 freq charle (3) - 1 freq chariots (3) - 1 freq charitie (3) - 2 freq charlatan (3) - 3 freq eggcharlotte (3) - 1 freq chatte (3) - 6 freq charlene (3) - 519 freq chariot (3) - 4 freq charlie (3) - 88 freq gavotte (4) - 1 freq charles's (4) - 1 freq chrome (4) - 8 freq chalets (4) - 1 freq carole (4) - 3 freq charon's (4) - 3 freq garrotted (4) - 1 freq chante (4) - 1 freq harlt (4) - 5 freq chalet (4) - 5 freq cigarette (4) - 21 freq christie (4) - 15 freq |
charlotte (0) - 9 freq charlatan (4) - 3 freq charlton (4) - 2 freq eggcharlotte (5) - 1 freq chatte (5) - 6 freq charlene (5) - 519 freq charlie (5) - 88 freq chariot (5) - 4 freq charitie (5) - 2 freq charle (5) - 1 freq harlot (5) - 2 freq chariots (5) - 1 freq cheritie (6) - 3 freq harlit (6) - 1 freq charltons (6) - 4 freq charlie's (6) - 9 freq chattie (6) - 1 freq chairiots (6) - 1 freq chirtit (6) - 1 freq charter (6) - 18 freq scarlett (6) - 1 freq courgette (6) - 1 freq cheriots (6) - 2 freq charlene' (6) - 1 freq chaurlie (6) - 1 freq |
SoundEx code - C643 cruelty - 14 freq curlt - 7 freq crawlt - 3 freq curled - 43 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 - XRLT charlotte - 9 freq |
CHARLOTTE |
| Time to execute Levenshtein function - 0.218818 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.383989 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.027098 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.036989 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.000807 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. |