Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
damndest (0) - 1 freq damnest (1) - 1 freq daundert (2) - 8 freq damndee (2) - 1 freq damnt (3) - 15 freq daander (3) - 1 freq daunert (3) - 14 freq damnit (3) - 5 freq auldest (3) - 46 freq dannert (3) - 3 freq dampnes (3) - 1 freq dandee (3) - 1 freq aaldest (3) - 8 freq dampness (3) - 4 freq damns (3) - 2 freq damies (3) - 1 freq wanrest (3) - 1 freq dances (3) - 43 freq dairkest (3) - 3 freq daeneesh (3) - 1 freq hardest (3) - 17 freq cauldest (3) - 5 freq earnest (3) - 13 freq aldest (3) - 1 freq faardest (3) - 1 freq |
damndest (0) - 1 freq damnest (2) - 1 freq daundert (4) - 8 freq damndee (4) - 1 freq damned (5) - 40 freq fondest (5) - 1 freq dandies (5) - 15 freq modest (5) - 8 freq damn't (5) - 5 freq roondest (5) - 2 freq demandit (5) - 45 freq maddest (5) - 3 freq graundest (5) - 1 freq dundert (5) - 1 freq kindest (5) - 4 freq amidst (5) - 7 freq immodest (5) - 1 freq grandest (5) - 4 freq diamonds (5) - 23 freq amnesty (5) - 4 freq damnpt (5) - 1 freq damnit (5) - 5 freq damns (5) - 2 freq damnt (5) - 15 freq demands (5) - 21 freq |
SoundEx code - D532 doo'n-oots - 1 freq dainties - 5 freq dunts - 23 freq dentist - 46 freq demotic - 5 freq deinties - 2 freq dantes - 1 freq dundas - 5 freq dundas's - 1 freq dundee's - 7 freq damndest - 1 freq dentists - 1 freq dante's - 22 freq dountakkin - 1 freq dintist - 3 freq dintists - 1 freq dintist' - 1 freq danadays - 10 freq dentist's - 3 freq doondies - 1 freq dainty's - 1 freq denties - 2 freq dints - 2 freq doonhauds - 6 freq diomedes - 10 freq diomedes's - 1 freq doomwatch - 1 freq dentistrie - 1 freq 'demotic' - 1 freq dandies - 15 freq donhutch - 1 freq dandglife - 5 freq dandg - 5 freq dentistry - 1 freq |
MetaPhone code - TMNTST damndest - 1 freq |
DAMNDEST |
Time to execute Levenshtein function - 0.320858 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.575114 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.028157 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.082557 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.001246 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. |