| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dedicate (0) - 8 freq dedicat (1) - 3 freq dedicated (1) - 20 freq delicate (1) - 21 freq dedicatin (2) - 2 freq educate (2) - 15 freq indicate (2) - 9 freq predicate (2) - 11 freq dedicatit (2) - 21 freq meditate (2) - 6 freq abdicate (2) - 1 freq delicat (2) - 5 freq dedication (3) - 8 freq indicates (3) - 13 freq desolate (3) - 3 freq meditates (3) - 2 freq indicated (3) - 4 freq delicately (3) - 4 freq mediates (3) - 1 freq replicate (3) - 2 freq bedmate (3) - 2 freq designate (3) - 3 freq deducted (3) - 1 freq dilicat (3) - 1 freq desecrate (3) - 1 freq |
dedicate (0) - 8 freq dedicat (1) - 3 freq delicate (2) - 21 freq dedicated (2) - 20 freq delicat (3) - 5 freq abdicate (3) - 1 freq dedicatit (3) - 21 freq dedicatin (3) - 2 freq educate (3) - 15 freq indicate (3) - 9 freq dilicat (4) - 1 freq edict (4) - 2 freq eradicate (4) - 3 freq delict (4) - 1 freq uneddicate (4) - 1 freq addict (4) - 1 freq deficit (4) - 10 freq dedicatory (4) - 1 freq deducted (4) - 1 freq meditate (4) - 6 freq predicate (4) - 11 freq dedication (4) - 8 freq medical (5) - 67 freq delegate (5) - 3 freq redcoat (5) - 2 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 |
DEDICATE |
| Time to execute Levenshtein function - 0.194551 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.349044 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.027539 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.041306 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.000894 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. |