| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| clasp (0) - 7 freq clasg (1) - 1 freq claspt (1) - 4 freq clase (1) - 8 freq claisp (1) - 1 freq clapp (1) - 1 freq clash (1) - 41 freq class (1) - 452 freq clesp (1) - 4 freq clap (1) - 56 freq clamp (1) - 3 freq wasp (2) - 5 freq glas- (2) - 1 freq chap (2) - 126 freq clack (2) - 9 freq las (2) - 8 freq las' (2) - 6 freq clos (2) - 14 freq clish (2) - 1 freq clappt (2) - 4 freq claw (2) - 27 freq hasp (2) - 2 freq clats (2) - 1 freq claiss (2) - 3 freq clasht (2) - 4 freq |
clasp (0) - 7 freq clesp (1) - 4 freq claisp (1) - 1 freq clap (2) - 56 freq clamp (2) - 3 freq class (2) - 452 freq clasg (2) - 1 freq clash (2) - 41 freq claspt (2) - 4 freq clase (2) - 8 freq clapp (2) - 1 freq clup (3) - 1 freq clep (3) - 1 freq clause (3) - 13 freq claspit (3) - 4 freq close (3) - 499 freq claus (3) - 17 freq cloase (3) - 2 freq clasin (3) - 1 freq clays (3) - 2 freq csp (3) - 2 freq clip (3) - 36 freq claspin (3) - 7 freq claes' (3) - 1 freq colas (3) - 1 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 |
CLASP |
| Time to execute Levenshtein function - 0.248577 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.380890 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.027334 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.037150 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.000971 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. |