Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
dsp (0) - 1 freq msp (1) - 53 freq dip (1) - 22 freq dfp (1) - 9 freq dup (1) - 5 freq dsl (1) - 28 freq csp (1) - 2 freq dss (1) - 2 freq ssp (1) - 8 freq ds (1) - 9 freq dp (1) - 3 freq dwp (1) - 2 freq usp (1) - 1 freq dep (1) - 2 freq dsi (1) - 1 freq osp (1) - 2 freq dop (1) - 1 freq isp (1) - 3 freq dtp (1) - 1 freq dsa (1) - 1 freq dap (1) - 1 freq sp (1) - 8 freq esp (1) - 10 freq gsv (2) - 2 freq sz (2) - 5 freq |
dsp (0) - 1 freq dop (2) - 1 freq osp (2) - 2 freq dep (2) - 2 freq isp (2) - 3 freq dsi (2) - 1 freq dtp (2) - 1 freq esp (2) - 10 freq sp (2) - 8 freq dap (2) - 1 freq usp (2) - 1 freq dsa (2) - 1 freq dfp (2) - 9 freq dip (2) - 22 freq dwp (2) - 2 freq msp (2) - 53 freq dsl (2) - 28 freq dup (2) - 5 freq csp (2) - 2 freq dp (2) - 3 freq ds (2) - 9 freq ssp (2) - 8 freq dss (2) - 2 freq dose (3) - 45 freq desk (3) - 149 freq |
SoundEx code - D210 disobey - 5 freq dickiebow - 1 freq day-joab - 1 freq deceive - 7 freq dough-baw - 1 freq doughbaw - 1 freq dug-up - 1 freq digby - 3 freq disavou - 1 freq dookie-up - 1 freq dug-shape - 2 freq dqgeyv - 1 freq dzf - 1 freq doxievee - 1 freq deejaypb - 3 freq dqb - 1 freq djgfyh - 1 freq dtaqzbu - 1 freq dyjvb - 1 freq dsp - 1 freq dickybeau - 1 freq dogpoo - 1 freq dyqpo - 1 freq dczhhb - 2 freq dcibw - 1 freq decaf - 1 freq dxpa - 1 freq |
MetaPhone code - TSP dsp - 1 freq |
DSP |
Time to execute Levenshtein function - 0.291905 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.515953 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.062482 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.037914 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.001319 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. |