| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dredge (0) - 2 freq dredged (1) - 3 freq dredger (1) - 1 freq 'radge (2) - 2 freq drewie (2) - 1 freq hedge (2) - 41 freq grudge (2) - 11 freq dredgin (2) - 2 freq bridge (2) - 76 freq dree (2) - 54 freq rede (2) - 14 freq jeedge (2) - 8 freq dreame (2) - 6 freq rudge (2) - 1 freq gledge (2) - 1 freq dodge (2) - 12 freq dredded (2) - 1 freq dreive (2) - 4 freq sledge (2) - 6 freq heedge (2) - 1 freq fledge (2) - 1 freq freedge (2) - 1 freq radge (2) - 44 freq wedge (2) - 8 freq dredd (2) - 6 freq |
dredge (0) - 2 freq dredger (2) - 1 freq dredged (2) - 3 freq radge (3) - 44 freq freedge (3) - 1 freq dreg (3) - 4 freq dredd (3) - 6 freq redgy (3) - 1 freq trodge (3) - 1 freq dredfu (3) - 1 freq trudge (3) - 5 freq dodge (3) - 12 freq fridge (3) - 59 freq doadge (3) - 1 freq ridge (3) - 19 freq grudge (3) - 11 freq dredgin (3) - 2 freq bridge (3) - 76 freq rudge (3) - 1 freq 'radge (3) - 2 freq drag (4) - 45 freq dried (4) - 74 freq dreadit (4) - 1 freq dreadfu (4) - 7 freq dreidfu (4) - 20 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 dartagnan - 1 freq draatsi - 2 freq |
MetaPhone code - TRJ trudge - 5 freq dredge - 2 freq dirge - 5 freq targe - 5 freq torge - 1 freq trodge - 1 freq tairge - 2 freq trj - 1 freq |
DREDGE |
| Time to execute Levenshtein function - 0.477782 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.585899 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.028864 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.041050 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.000902 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. |