| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| clasped (0) - 7 freq clashed (1) - 4 freq classed (1) - 4 freq clased (1) - 2 freq clapped (1) - 28 freq clesped (1) - 5 freq clamped (1) - 7 freq camped (2) - 6 freq cleshed (2) - 1 freq grasped (2) - 3 freq clossed (2) - 2 freq climped (2) - 1 freq lamped (2) - 2 freq cashed (2) - 3 freq lashed (2) - 11 freq claspt (2) - 4 freq slapped (2) - 14 freq clase (2) - 7 freq plashed (2) - 1 freq chased (2) - 50 freq clappet (2) - 1 freq crapped (2) - 1 freq clipped (2) - 8 freq classes (2) - 46 freq claried (2) - 1 freq |
clasped (0) - 7 freq clesped (1) - 5 freq clashed (2) - 4 freq classed (2) - 4 freq clamped (2) - 7 freq clased (2) - 2 freq clapped (2) - 28 freq claspit (3) - 4 freq cloased (3) - 1 freq clessed (3) - 1 freq claspin (3) - 7 freq clyped (3) - 8 freq cliped (3) - 1 freq closed (3) - 126 freq lisped (3) - 1 freq claesed (3) - 2 freq claised (3) - 1 freq clasp (3) - 7 freq clipped (3) - 8 freq clossed (3) - 2 freq claspt (3) - 4 freq climped (3) - 1 freq cleshed (3) - 1 freq casted (4) - 2 freq clamed (4) - 2 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 - 7 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 - KLSPT clesped - 5 freq claspt - 4 freq clasped - 7 freq claspit - 4 freq clespit - 3 freq |
CLASPED |
| Time to execute Levenshtein function - 0.178011 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.359706 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.036053 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.040489 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.000877 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. |