| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| clesp (0) - 4 freq clep (1) - 1 freq clese (1) - 1 freq clasp (1) - 7 freq cless (1) - 131 freq clesh (1) - 1 freq claisp (2) - 1 freq cresh (2) - 3 freq cleppy (2) - 1 freq iles (2) - 3 freq slep (2) - 10 freq cleys (2) - 4 freq gresp (2) - 2 freq sleip (2) - 4 freq bless (2) - 44 freq lep (2) - 5 freq gless (2) - 395 freq clear (2) - 492 freq close (2) - 499 freq cleer (2) - 6 freq clene (2) - 3 freq claspt (2) - 4 freq clean (2) - 356 freq class (2) - 452 freq clos (2) - 14 freq |
clesp (0) - 4 freq clasp (1) - 7 freq claisp (2) - 1 freq cless (2) - 131 freq clesh (2) - 1 freq clese (2) - 1 freq clep (2) - 1 freq cusp (3) - 3 freq coles (3) - 4 freq clump (3) - 18 freq claes (3) - 582 freq clapp (3) - 1 freq clip (3) - 36 freq closs (3) - 61 freq clish (3) - 1 freq crisp (3) - 43 freq clyse (3) - 10 freq claes' (3) - 1 freq colspy (3) - 1 freq clap (3) - 56 freq clespit (3) - 3 freq clup (3) - 1 freq clues (3) - 7 freq lisp (3) - 2 freq clesped (3) - 5 freq |
SoundEx code - C421 clesp - 4 freq coal-cowp - 1 freq clesped - 5 freq claspt - 4 freq claspin - 7 freq clasp - 7 freq clock-bee - 1 freq clasped - 8 freq claisp - 1 freq claspit - 4 freq cloghapistol - 1 freq classified - 6 freq clicky've - 1 freq clespit - 3 freq closefamily - 1 freq chalkboard - 1 freq classification - 3 freq classifeed - 1 freq close-pent - 1 freq classifaction - 1 freq clossbye - 1 freq clashbag - 1 freq clacksweb - 1 freq claespoles - 1 freq clessified - 3 freq classifies - 1 freq classifyin - 1 freq clyse-poles - 1 freq clessification - 2 freq clessifyin - 1 freq colspy - 1 freq clessifiein - 1 freq clickbait - 2 freq chelsfergo - 2 freq chelseabronco - 4 freq |
MetaPhone code - KLSP clesp - 4 freq clasp - 7 freq claisp - 1 freq g'lespie - 1 freq colspy - 1 freq golspie - 1 freq |
CLESP |
| Time to execute Levenshtein function - 0.194198 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.335773 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.027294 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.037050 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.000911 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. |