| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| clpl (0) - 9 freq clue (2) - 85 freq ull (2) - 24 freq clak (2) - 2 freq clat (2) - 6 freq jll (2) - 1 freq caps (2) - 12 freq fll (2) - 1 freq dll (2) - 4 freq cllr (2) - 3 freq curl (2) - 11 freq cler (2) - 1 freq cpg (2) - 20 freq cled (2) - 34 freq lgl (2) - 1 freq pll (2) - 4 freq clag (2) - 4 freq lil (2) - 10 freq epl (2) - 9 freq czp (2) - 1 freq lp (2) - 8 freq clapp (2) - 1 freq cops (2) - 3 freq cleg (2) - 12 freq cape (2) - 11 freq |
clpl (0) - 9 freq calpol (2) - 1 freq clap (3) - 53 freq cell (3) - 34 freq clip (3) - 36 freq clep (3) - 1 freq coll (3) - 7 freq clips (3) - 9 freq clype (3) - 46 freq call (3) - 216 freq clup (3) - 1 freq cull (3) - 7 freq clipt (3) - 1 freq clipe (3) - 9 freq clapp (3) - 1 freq cpyl (3) - 1 freq claps (3) - 4 freq coupla (4) - 12 freq oll (4) - 1 freq lol (4) - 1606 freq cept (4) - 25 freq clelia (4) - 5 freq alph (4) - 1 freq coul (4) - 56 freq chapel (4) - 30 freq |
SoundEx code - C414 chilblains - 6 freq caulfield - 1 freq caaliflooer - 1 freq caauliflooer - 1 freq clpl - 9 freq coal-black - 1 freq cauliflooer - 2 freq caulifloor - 8 freq cleveland - 1 freq calflie - 1 freq coll-black - 1 freq cauliflouer - 1 freq calpol - 1 freq colbaltsouljournal - 1 freq |
MetaPhone code - KLPL gallipoli - 1 freq clpl - 9 freq calpol - 1 freq |
CLPL |
| Time to execute Levenshtein function - 0.171693 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.358487 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.031885 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.040200 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.000896 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. |