Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
clpl (0) - 9 freq 'll (2) - 85 freq cp (2) - 4 freq clek (2) - 1 freq clype (2) - 46 freq lil (2) - 10 freq clep (2) - 1 freq clipe (2) - 9 freq ckp (2) - 1 freq caul (2) - 79 freq alps (2) - 2 freq cln (2) - 1 freq coil (2) - 1 freq clx (2) - 1 freq claa (2) - 14 freq cool (2) - 138 freq vll (2) - 1 freq cuil (2) - 9 freq cept (2) - 25 freq ill (2) - 411 freq clapp (2) - 1 freq cops (2) - 3 freq alll (2) - 1 freq cap (2) - 47 freq ulpa (2) - 1 freq |
clpl (0) - 9 freq calpol (2) - 1 freq clapp (3) - 1 freq claps (3) - 5 freq clup (3) - 1 freq clap (3) - 56 freq coll (3) - 7 freq cpyl (3) - 1 freq cull (3) - 7 freq clips (3) - 9 freq clip (3) - 36 freq clep (3) - 1 freq cell (3) - 38 freq clype (3) - 46 freq clipt (3) - 1 freq call (3) - 220 freq clipe (3) - 9 freq caps (4) - 12 freq curl (4) - 12 freq clew (4) - 3 freq clc (4) - 1 freq clue (4) - 87 freq dupl (4) - 1 freq pll (4) - 5 freq lal (4) - 1 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.157550 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.309454 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.027432 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.037503 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.000903 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. |