| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| charlotte (0) - 9 freq charlene (3) - 519 freq eggcharlotte (3) - 1 freq chariots (3) - 1 freq charlatan (3) - 3 freq charlie (3) - 95 freq charle (3) - 1 freq garotte (3) - 1 freq chatte (3) - 6 freq chariot (3) - 4 freq charlton (3) - 2 freq harlot (3) - 2 freq charitie (3) - 2 freq cheriot (4) - 2 freq shallots (4) - 1 freq charon (4) - 9 freq marlowe (4) - 1 freq palette (4) - 4 freq cartie (4) - 1 freq charact (4) - 1 freq character (4) - 90 freq cherlie (4) - 133 freq chaurlie (4) - 1 freq chortle (4) - 1 freq harlt (4) - 5 freq |
charlotte (0) - 9 freq charlatan (4) - 3 freq charlton (4) - 2 freq harlot (5) - 2 freq charitie (5) - 2 freq chatte (5) - 6 freq chariot (5) - 4 freq eggcharlotte (5) - 1 freq chariots (5) - 1 freq charlene (5) - 519 freq charlie (5) - 95 freq charle (5) - 1 freq charleston (6) - 2 freq chairlie (6) - 273 freq chargit (6) - 2 freq crueltt (6) - 1 freq chartene (6) - 1 freq cheritie (6) - 3 freq charlie's (6) - 10 freq christe (6) - 1 freq chairiot (6) - 2 freq charlene' (6) - 1 freq charlatans (6) - 1 freq charltons (6) - 4 freq chalets (6) - 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 - XRLT charlotte - 9 freq |
CHARLOTTE |
| Time to execute Levenshtein function - 0.195199 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.350658 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.027161 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.039017 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.000913 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. |