Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
clairly (0) - 2 freq cleirly (1) - 1 freq clairty (1) - 8 freq cairy (2) - 16 freq fairly (2) - 235 freq claire (2) - 10 freq airly (2) - 20 freq shairly (2) - 107 freq nairly (2) - 1 freq clairet (2) - 1 freq clearly (2) - 143 freq clargy (2) - 1 freq ssairly (2) - 1 freq clairin (2) - 1 freq clairer (2) - 1 freq cairry (2) - 212 freq rairly (2) - 1 freq sairly (2) - 28 freq clarty (2) - 56 freq glaidly (2) - 2 freq slairgy (2) - 1 freq 'fairly (2) - 2 freq clarky (2) - 2 freq clairt (2) - 5 freq clairts (2) - 1 freq |
clairly (0) - 2 freq cleirly (1) - 1 freq clearly (2) - 143 freq clairlie (2) - 4 freq clairty (2) - 8 freq clarty (3) - 56 freq clairer (3) - 1 freq claerlie (3) - 3 freq clairt (3) - 5 freq clarry (3) - 2 freq clairin (3) - 1 freq clair (3) - 56 freq clarky (3) - 2 freq clairet (3) - 1 freq claire (3) - 10 freq clargy (3) - 1 freq carla (4) - 5 freq cheerly (4) - 1 freq clerty (4) - 2 freq cleverly (4) - 3 freq clarity (4) - 13 freq clarke (4) - 7 freq carl (4) - 13 freq clorty (4) - 5 freq colair (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 |
CLAIRLY |
Time to execute Levenshtein function - 0.227438 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.427849 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.031866 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.043527 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.001123 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. |