| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dempster (0) - 11 freq semester (2) - 2 freq deester (2) - 2 freq dempsey (2) - 5 freq tempter (2) - 1 freq enster (3) - 2 freq 'easter (3) - 1 freq gester (3) - 2 freq detested (3) - 1 freq diaster (3) - 1 freq deter (3) - 4 freq demise (3) - 12 freq muster (3) - 7 freq master (3) - 19 freq demesne (3) - 1 freq easter (3) - 41 freq despite (3) - 97 freq dampener (3) - 1 freq mister (3) - 83 freq sempler (3) - 2 freq heelster (3) - 2 freq damper (3) - 3 freq deesters (3) - 1 freq despyte (3) - 1 freq deminted (3) - 1 freq |
dempster (0) - 11 freq semester (4) - 2 freq duimster (4) - 2 freq imposter (4) - 1 freq tempter (4) - 1 freq dempsey (4) - 5 freq deester (4) - 2 freq adminster (5) - 1 freq hipster (5) - 2 freq pester (5) - 2 freq impostor (5) - 1 freq tipster (5) - 1 freq peester (5) - 3 freq mester (5) - 12 freq 'mester (5) - 2 freq deesaster (5) - 1 freq dampner (5) - 1 freq dumper (5) - 1 freq computer (5) - 108 freq hamster (5) - 5 freq disaster (5) - 44 freq deemsters (5) - 1 freq meyster (5) - 2 freq duster (5) - 12 freq tapster (5) - 6 freq |
SoundEx code - D512 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 - TMPSTR dempster - 11 freq |
DEMPSTER |
| Time to execute Levenshtein function - 0.194548 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.374781 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.027596 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.036976 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.000869 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. |