| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| carolro (0) - 17 freq carolst (2) - 1 freq carlgo (2) - 1 freq carlo (2) - 16 freq carolm (2) - 2 freq carol (2) - 62 freq carols (2) - 3 freq carolle (2) - 2 freq caroll (2) - 2 freq barolo (2) - 1 freq carole (2) - 3 freq carrolls (3) - 1 freq carles (3) - 6 freq carolina (3) - 8 freq manolo (3) - 1 freq calor (3) - 2 freq harold (3) - 13 freq carso (3) - 1 freq carnbo (3) - 1 freq carr (3) - 3 freq carl's (3) - 1 freq caron (3) - 1 freq carolled (3) - 1 freq carron (3) - 4 freq camillo (3) - 1 freq |
carolro (0) - 17 freq carols (3) - 3 freq carolle (3) - 2 freq carole (3) - 3 freq carol (3) - 62 freq caroll (3) - 2 freq carolm (3) - 2 freq carlo (3) - 16 freq carlgo (3) - 1 freq carter (4) - 3 freq caroline (4) - 26 freq carnroe (4) - 2 freq crolla (4) - 1 freq cavalry (4) - 18 freq carlie (4) - 2 freq career (4) - 66 freq carry (4) - 45 freq carlos (4) - 3 freq carolyne (4) - 1 freq carle (4) - 8 freq carlin (4) - 6 freq carver (4) - 14 freq carer (4) - 10 freq carla (4) - 5 freq carlaw (4) - 12 freq |
SoundEx code - C646 curlers - 6 freq creeler - 2 freq curly-haired - 1 freq curliewurlies - 1 freq curlurs - 1 freq curly-wurly - 1 freq corollary - 2 freq carolleralph - 2 freq carolro - 17 freq crawler - 1 freq |
MetaPhone code - KRLR creeler - 2 freq growler - 2 freq corollary - 2 freq carolro - 17 freq crawler - 1 freq |
CAROLRO |
| Time to execute Levenshtein function - 0.207280 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.406597 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.031290 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.038743 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.000964 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. |