| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dempsey (0) - 5 freq dempster (2) - 11 freq dropsey (2) - 1 freq demise (2) - 12 freq deep-sey (2) - 1 freq dampner (3) - 1 freq empy (3) - 6 freq temples (3) - 10 freq devyse (3) - 2 freq denise (3) - 1 freq peasey (3) - 1 freq dumpty (3) - 6 freq ramsey (3) - 8 freq benosey (3) - 1 freq demmle (3) - 2 freq dense (3) - 12 freq wembley (3) - 1 freq dumphy (3) - 50 freq deips (3) - 1 freq demmet (3) - 1 freq demmel (3) - 1 freq dese (3) - 6 freq deludey (3) - 1 freq desel (3) - 4 freq bemused (3) - 8 freq |
dempsey (0) - 5 freq demise (3) - 12 freq dropsey (3) - 1 freq dumps (3) - 14 freq dumper (4) - 1 freq hempies (4) - 2 freq dempz (4) - 2 freq depose (4) - 1 freq demos (4) - 2 freq dampen (4) - 1 freq dumpised (4) - 4 freq damper (4) - 3 freq dumpie (4) - 1 freq deeps (4) - 7 freq dampnes (4) - 1 freq dems (4) - 6 freq dimple (4) - 1 freq despise (4) - 5 freq temps (4) - 1 freq demoss (4) - 1 freq dimples (4) - 4 freq dumpty (4) - 6 freq dumped (4) - 26 freq kemps (4) - 4 freq deep-sey (4) - 1 freq |
SoundEx code - D512 dumbs - 1 freq dumps - 14 freq dumbfuck - 1 freq dempster - 11 freq dunvegan - 2 freq dumpised - 4 freq dumpised-wye - 1 freq dumbstruck - 2 freq doun-fessit - 1 freq din-faced - 1 freq dumb's - 1 freq dempsey - 5 freq dumbies - 1 freq doonpish - 2 freq dumpish - 1 freq dddwymbcv - 1 freq dempz - 2 freq daneybash - 1 freq demobjob - 1 freq dunipace - 1 freq dhnfk - 1 freq |
MetaPhone code - TMPS dumps - 14 freq timepiece - 3 freq dempsey - 5 freq tempus - 1 freq temps - 1 freq €˜tempus - 1 freq tumips - 1 freq dempz - 2 freq |
DEMPSEY |
| Time to execute Levenshtein function - 0.204936 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.351924 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.027634 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.037350 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.000886 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. |