| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| carlyle (0) - 17 freq carolyne (2) - 1 freq calle (2) - 2 freq carlie (2) - 2 freq carle (2) - 8 freq carlisle (2) - 4 freq carole (2) - 3 freq carolle (2) - 2 freq carluke (2) - 2 freq carline (2) - 33 freq argyle (2) - 5 freq carlene (2) - 1 freq caller (3) - 80 freq harlie (3) - 6 freq charle (3) - 1 freq clye (3) - 2 freq charhle (3) - 1 freq vailye (3) - 6 freq call (3) - 220 freq mcarle (3) - 2 freq cantle (3) - 2 freq cariy (3) - 1 freq galle (3) - 1 freq clyte (3) - 1 freq carál (3) - 1 freq |
carlyle (0) - 17 freq carolle (2) - 2 freq carline (3) - 33 freq carlene (3) - 1 freq carole (3) - 3 freq caroll (3) - 2 freq carluke (3) - 2 freq carlisle (3) - 4 freq calle (3) - 2 freq carlie (3) - 2 freq carolyne (3) - 1 freq carle (3) - 8 freq crolla (4) - 1 freq corelli (4) - 2 freq caroline (4) - 26 freq caall (4) - 2 freq carles (4) - 6 freq carroll (4) - 6 freq coracle (4) - 1 freq curly (4) - 53 freq carolm (4) - 2 freq carl (4) - 13 freq carlos (4) - 3 freq cargull (4) - 1 freq carols (4) - 3 freq |
SoundEx code - C644 carlyle - 17 freq charlie'll - 2 freq carlylyall - 1 freq |
MetaPhone code - KRLL carlyle - 17 freq |
CARLYLE |
| Time to execute Levenshtein function - 0.228135 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.377681 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.027906 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.041193 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.000897 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. |