| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dredged (0) - 3 freq dredded (1) - 1 freq dredger (1) - 1 freq dredge (1) - 2 freq redded (2) - 2 freq hedged (2) - 2 freq fledged (2) - 3 freq pledged (2) - 5 freq grudged (2) - 1 freq dressed (2) - 118 freq dreeded (2) - 2 freq dodged (2) - 6 freq bridged (2) - 1 freq radged (2) - 1 freq dreggled (2) - 2 freq deedled (2) - 1 freq jeedged (2) - 3 freq dredd (2) - 6 freq trudged (2) - 6 freq dredgin (2) - 2 freq dremmed (2) - 1 freq dreaded (2) - 5 freq dreeped (2) - 6 freq dreesed (2) - 3 freq dragged (2) - 38 freq |
dredged (0) - 3 freq dredger (2) - 1 freq dredge (2) - 2 freq dredded (2) - 1 freq dredgin (3) - 2 freq dredd (3) - 6 freq trudged (3) - 6 freq draiged (3) - 2 freq dragged (3) - 38 freq dreided (3) - 4 freq drugged (3) - 4 freq dreaded (3) - 5 freq radged (3) - 1 freq bridged (3) - 1 freq grudged (3) - 1 freq dreeded (3) - 2 freq dodged (3) - 6 freq croudged (4) - 1 freq dreamed (4) - 14 freq dreed (4) - 13 freq adjudged (4) - 1 freq draigged (4) - 2 freq abridged (4) - 1 freq drudgery (4) - 3 freq dirded (4) - 1 freq |
SoundEx code - D632 dorts - 8 freq drouths - 1 freq dorothy's - 3 freq dredge - 2 freq dredger - 1 freq darts - 32 freq drudgery - 3 freq dwarts - 1 freq dredged - 3 freq dairths - 1 freq dordogne - 1 freq druids - 5 freq druidic - 1 freq dirty-kneed - 1 freq drewits - 2 freq dreids - 2 freq dreidsomelookin - 1 freq derts - 2 freq dredgin - 2 freq dratsis - 2 freq dratsi - 7 freq dreidsome - 1 freq drouth's - 1 freq drooths - 1 freq dorados - 1 freq dairts - 2 freq dirts - 1 freq dratsie - 1 freq dorothykoomson - 2 freq dÂ’artagnan - 1 freq draatsi - 2 freq |
MetaPhone code - TRJT tragedie - 3 freq tragedy - 19 freq target - 33 freq tairget - 10 freq trudged - 6 freq draigit - 2 freq draiged - 2 freq dredged - 3 freq tragedoi - 1 freq darged - 1 freq trigidie - 2 freq dargit - 2 freq €˜target - 1 freq trigidy - 1 freq |
DREDGED |
| Time to execute Levenshtein function - 0.256550 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.428620 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.028061 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.037675 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.000962 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. |