Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
clearly (0) - 140 freq cleanly (1) - 4 freq cleary (1) - 1 freq cleirly (1) - 1 freq clearan (2) - 2 freq bleary (2) - 7 freq clear's (2) - 1 freq clerty (2) - 2 freq pearly (2) - 5 freq clarry (2) - 2 freq cleart (2) - 9 freq clairly (2) - 2 freq clarty (2) - 56 freq early (2) - 358 freq cleared (2) - 56 freq clarky (2) - 2 freq clergy (2) - 2 freq cheaply (2) - 2 freq clargy (2) - 1 freq clearit (2) - 2 freq yearly (2) - 10 freq dearly (2) - 13 freq cleverly (2) - 3 freq clearin (2) - 27 freq clears (2) - 19 freq |
clearly (0) - 140 freq cleirly (1) - 1 freq cleanly (2) - 4 freq clairly (2) - 2 freq cleary (2) - 1 freq clearit (3) - 2 freq cleverly (3) - 3 freq clergy (3) - 2 freq clargy (3) - 1 freq clearer (3) - 26 freq clear (3) - 486 freq clarky (3) - 2 freq cheerly (3) - 1 freq clearin (3) - 27 freq clears (3) - 19 freq cleared (3) - 56 freq clarry (3) - 2 freq clerty (3) - 2 freq cleart (3) - 9 freq clearan (3) - 2 freq clarty (3) - 56 freq charley (4) - 1 freq clearoot (4) - 1 freq clert (4) - 1 freq carlo (4) - 16 freq |
SoundEx code - C464 clearly - 140 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 - 140 freq cullerlie - 1 freq clairlie - 4 freq culural - 1 freq claerlie - 3 freq clairly - 2 freq cleirly - 1 freq calerlee - 1 freq |
CLEARLY clear - 486 freq clearly - 140 freq clears - 19 freq clearing - 3 freq |
Time to execute Levenshtein function - 0.175093 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.441645 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.028526 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.071105 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.000886 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. |