| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dodgydavie (0) - 1 freq doddie (4) - 4 freq dodgy (5) - 39 freq ogilvie (5) - 13 freq dodgan (5) - 1 freq dougie (5) - 125 freq duddie (5) - 1 freq didyeaye (5) - 1 freq donsdaiiy (5) - 6 freq doughie (5) - 1 freq forgave (5) - 1 freq roddie (5) - 18 freq diddie (5) - 2 freq dodgebaa (5) - 1 freq dodderin (5) - 1 freq boddie (5) - 2 freq coldavi (5) - 3 freq dodie (5) - 18 freq doddle (5) - 4 freq findavie (5) - 1 freq dodged (5) - 6 freq davygavin (5) - 33 freq dodge (5) - 12 freq €œdavie (5) - 3 freq doogie (5) - 1 freq |
dodgydavie (0) - 1 freq dodged (6) - 6 freq doddie (6) - 4 freq doddies (7) - 2 freq dodgebaa (7) - 1 freq daddie (7) - 3 freq dodge (7) - 12 freq dugdale (7) - 7 freq doddle (7) - 4 freq diddie (7) - 2 freq dodgy (7) - 39 freq dodgan (7) - 1 freq duddie (7) - 1 freq dodgin (7) - 4 freq dodgson (8) - 9 freq dovizdane (8) - 1 freq dodo'd (8) - 1 freq hodged (8) - 3 freq dodgin' (8) - 1 freq orgreave (8) - 2 freq dogged (8) - 3 freq dodging (8) - 2 freq duddies (8) - 2 freq doadge (8) - 1 freq daddies (8) - 4 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 - TJTF dodgydavie - 1 freq |
DODGYDAVIE |
| Time to execute Levenshtein function - 0.219411 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.416479 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.030090 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.040539 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.001050 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. |