| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dodged (0) - 6 freq hodged (1) - 3 freq dogged (1) - 3 freq dodger (1) - 5 freq dodges (1) - 1 freq lodged (1) - 6 freq dodge (1) - 12 freq nudged (2) - 5 freq hodge (2) - 3 freq dowed (2) - 1 freq ronged (2) - 1 freq dugged (2) - 1 freq oaged (2) - 1 freq doffed (2) - 3 freq budged (2) - 1 freq dogger (2) - 1 freq radged (2) - 1 freq togged (2) - 1 freq dodo'd (2) - 1 freq dosed (2) - 2 freq dredged (2) - 3 freq doped (2) - 2 freq doited (2) - 2 freq widged (2) - 1 freq domed (2) - 2 freq |
dodged (0) - 6 freq lodged (2) - 6 freq dodge (2) - 12 freq dodges (2) - 1 freq dodger (2) - 5 freq hodged (2) - 3 freq dogged (2) - 3 freq hedged (3) - 2 freq wadged (3) - 1 freq mudged (3) - 1 freq cadged (3) - 1 freq fidged (3) - 7 freq darged (3) - 1 freq nidged (3) - 1 freq dodgan (3) - 1 freq judged (3) - 16 freq dinged (3) - 18 freq ludged (3) - 7 freq wedged (3) - 3 freq dodgy (3) - 39 freq dadded (3) - 1 freq edged (3) - 9 freq dunged (3) - 1 freq dodgin (3) - 4 freq doadge (3) - 1 freq |
SoundEx code - D323 dew-decked - 1 freq detective - 23 freq detectives - 7 freq dedication - 8 freq dodged - 6 freq detector - 7 freq deith-strakes - 1 freq dedicatin - 2 freq dedicate - 8 freq dedicatit - 21 freq detect - 5 freq dedicated - 20 freq detectable - 2 freq deducted - 1 freq detected - 1 freq detached - 7 freq detested - 1 freq detestit - 1 freq ditched - 1 freq deductan - 1 freq dedicat - 3 freq deduced - 1 freq deidwecht - 1 freq detectit - 5 freq dedications - 1 freq detoxed - 1 freq detectin - 1 freq dedicatioun - 1 freq deductions - 1 freq detects - 1 freq dhadakata - 3 freq de-tecktit - 1 freq dedicatory - 1 freq dodgydavie - 1 freq detest - 2 freq |
MetaPhone code - TJT dodged - 6 freq |
DODGED |
| Time to execute Levenshtein function - 0.213025 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.359747 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.027782 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.037014 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.000859 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. |