| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| diddums (0) - 1 freq dirdums (1) - 2 freq diadems (2) - 1 freq riddlums (2) - 2 freq diddies (2) - 2 freq diddys (2) - 1 freq dirdum (2) - 20 freq biddens (3) - 1 freq idioms (3) - 7 freq nickums (3) - 1 freq diddy (3) - 5 freq eidioms (3) - 2 freq diddly (3) - 1 freq kidds (3) - 2 freq doddles (3) - 2 freq buddum (3) - 3 freq daddies (3) - 3 freq riddies (3) - 1 freq di-does (3) - 1 freq riddles (3) - 9 freq feddoms (3) - 1 freq idyims (3) - 2 freq addams (3) - 1 freq widdins (3) - 1 freq viddies (3) - 1 freq |
diddums (0) - 1 freq dirdums (2) - 2 freq diddys (3) - 1 freq diddies (3) - 2 freq diadems (3) - 1 freq dodd's (4) - 1 freq faddoms (4) - 4 freq feddoms (4) - 1 freq dodds (4) - 4 freq addams (4) - 1 freq duddies (4) - 2 freq buddoms (4) - 1 freq daddies (4) - 3 freq doddies (4) - 2 freq dadds (4) - 1 freq daddy's (4) - 13 freq doddles (4) - 2 freq dirdum (4) - 20 freq riddlums (4) - 2 freq biddins (5) - 12 freq idioms (5) - 7 freq biddens (5) - 1 freq piddles (5) - 4 freq droddum (5) - 1 freq biddy's (5) - 2 freq |
SoundEx code - D352 diadems - 1 freq diddums - 1 freq deayton's - 1 freq dating - 8 freq datin's - 2 freq duddinston - 2 freq duddingston - 3 freq datings - 1 freq datenight - 2 freq dudenessofdude - 1 freq deedonceilidh - 1 freq didnawashmyhandallnight - 1 freq |
MetaPhone code - TTMS diadems - 1 freq diddums - 1 freq totems - 3 freq |
DIDDUMS |
| Time to execute Levenshtein function - 0.335815 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.520100 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.033527 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.045350 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.000930 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. |