Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
dunssis (0) - 1 freq danssis (1) - 1 freq danssin (2) - 2 freq dansis (2) - 3 freq uissis (2) - 1 freq punsis (2) - 1 freq justis (3) - 2 freq dunkin (3) - 2 freq dressit (3) - 3 freq sussie (3) - 1 freq danss (3) - 2 freq suksesis (3) - 1 freq hussie (3) - 1 freq dunneil (3) - 1 freq mussil (3) - 1 freq dancis (3) - 2 freq duress (3) - 4 freq hunkses (3) - 1 freq pressis (3) - 2 freq dunjin (3) - 1 freq dustin (3) - 12 freq houssis (3) - 3 freq dressins (3) - 1 freq guesses (3) - 6 freq dunes (3) - 6 freq |
dunssis (0) - 1 freq danssis (1) - 1 freq dansis (3) - 3 freq danssin (3) - 2 freq dresses (4) - 18 freq daunss (4) - 1 freq dosses (4) - 2 freq danss (4) - 2 freq uissis (4) - 1 freq desses (4) - 1 freq punsis (4) - 1 freq dounsets (4) - 1 freq dunlops (5) - 3 freq dunse (5) - 1 freq dionysius (5) - 1 freq sunsets (5) - 4 freq ferssis (5) - 3 freq dunak's (5) - 1 freq dunkies (5) - 1 freq dressin (5) - 23 freq denis (5) - 11 freq pusses (5) - 6 freq gressis (5) - 1 freq donsie (5) - 2 freq conshis (5) - 1 freq |
SoundEx code - D522 dances - 43 freq dunkey's - 6 freq dunkies - 1 freq doncaster - 4 freq douncast - 2 freq donkeys - 9 freq dunces - 5 freq dooncast - 5 freq damascus - 6 freq demagogues - 2 freq dingies - 1 freq doonsize - 1 freq danssis - 1 freq dance's - 2 freq dionysius - 1 freq dinkies - 1 freq dunssis - 1 freq dunches - 1 freq dinghies - 1 freq damages - 1 freq dionysus - 2 freq denishakilloh - 3 freq doncasters - 1 freq dannycaz - 2 freq domjack - 1 freq dances - 1 freq dunnachuckbruck - 2 freq dmjack - 1 freq dansis - 3 freq dancis - 2 freq |
MetaPhone code - TNSS dances - 43 freq dennis's - 1 freq dunces - 5 freq doonsize - 1 freq tenses - 7 freq danssis - 1 freq dance's - 2 freq dionysius - 1 freq dunssis - 1 freq dionysus - 2 freq deans's - 1 freq dances - 1 freq dansis - 3 freq dancis - 2 freq |
DUNSSIS |
Time to execute Levenshtein function - 0.357636 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.515537 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.033809 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.042475 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.000979 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. |