| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| claerlie (0) - 3 freq clairlie (1) - 4 freq aerlie (2) - 10 freq charlie (2) - 95 freq clairtie (2) - 2 freq lanerlie (2) - 2 freq chairlie (2) - 273 freq chaurlie (2) - 1 freq cherlie (2) - 133 freq clartie (2) - 4 freq carlie (2) - 2 freq cullerlie (2) - 1 freq gleglie (3) - 3 freq slaalie (3) - 1 freq fairlie (3) - 19 freq clere (3) - 3 freq clelia (3) - 5 freq slawlie (3) - 10 freq unnerlie (3) - 1 freq ainerlie (3) - 2 freq claethe (3) - 1 freq bladrie (3) - 1 freq lanelie (3) - 1 freq cairie (3) - 4 freq quaetlie (3) - 2 freq |
claerlie (0) - 3 freq clairlie (1) - 4 freq carlie (3) - 2 freq clartie (3) - 4 freq calerlee (3) - 1 freq clairly (3) - 2 freq cherlie (3) - 133 freq cullerlie (3) - 1 freq charlie (3) - 95 freq chaurlie (3) - 1 freq clairtie (3) - 2 freq chairlie (3) - 273 freq claried (4) - 1 freq clarke (4) - 7 freq clairin (4) - 1 freq claire (4) - 10 freq cleirly (4) - 1 freq clarifie (4) - 1 freq calflie (4) - 1 freq clearly (4) - 143 freq claure (4) - 4 freq clare (4) - 12 freq carle (4) - 8 freq charle (4) - 1 freq clerke (4) - 1 freq |
SoundEx code - C464 clearly - 143 freq colourless - 2 freq cullerlie - 1 freq clairlie - 4 freq culural - 1 freq claerlie - 3 freq clairly - 2 freq cleirly - 1 freq calerlee - 1 freq cllrlesleybkwk - 1 freq claireallan - 1 freq |
MetaPhone code - KLRL clearly - 143 freq cullerlie - 1 freq clairlie - 4 freq culural - 1 freq claerlie - 3 freq clairly - 2 freq cleirly - 1 freq calerlee - 1 freq |
CLAERLIE |
| Time to execute Levenshtein function - 0.207689 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.347436 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.027670 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.039721 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.000910 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. |