| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dew-decked (0) - 1 freq dew-dipped (3) - 1 freq bedecked (3) - 3 freq re-checked (4) - 1 freq decked (4) - 8 freq deduced (4) - 1 freq detected (4) - 1 freq wrecked (4) - 12 freq deducted (4) - 1 freq weecked (4) - 1 freq dejected (4) - 2 freq deflected (4) - 2 freq duddered (5) - 2 freq new-naemed (5) - 1 freq denounced (5) - 2 freq fecked (5) - 16 freq beseeched (5) - 1 freq new-opened (5) - 1 freq redeemed (5) - 5 freq flecked (5) - 2 freq wide-eed (5) - 2 freq meandered (5) - 3 freq decadence (5) - 2 freq dedicated (5) - 20 freq decoded (5) - 1 freq |
dew-decked (0) - 1 freq dew-dipped (5) - 1 freq bedecked (6) - 3 freq deducted (7) - 1 freq wrecked (7) - 12 freq weecked (7) - 1 freq deduced (7) - 1 freq decked (7) - 8 freq webacked (8) - 1 freq doacked (8) - 1 freq baw-faced (8) - 1 freq ducked (8) - 4 freq dwadled (8) - 1 freq swan-necked (8) - 1 freq wracked (8) - 5 freq din-faced (8) - 1 freq whacked (8) - 5 freq bow-hoched (8) - 1 freq wicked (8) - 25 freq swicked (8) - 1 freq dedicated (8) - 20 freq dejected (8) - 2 freq deflected (8) - 2 freq docked (8) - 2 freq paw-marked (8) - 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 - TTKT dew-decked - 1 freq dedicate - 8 freq detect - 5 freq dedicat - 3 freq |
DEW-DECKED |
| Time to execute Levenshtein function - 0.199926 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.395642 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.037059 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.039201 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.000899 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. |