| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| detected (0) - 1 freq dejected (1) - 2 freq detested (1) - 1 freq deserted (2) - 5 freq ejected (2) - 2 freq detect (2) - 5 freq 'elected (2) - 1 freq defeated (2) - 7 freq detached (2) - 7 freq detector (2) - 7 freq refected (2) - 1 freq demented (2) - 8 freq detectit (2) - 5 freq erected (2) - 3 freq deterred (2) - 3 freq detectin (2) - 1 freq rejected (2) - 7 freq detects (2) - 1 freq elected (2) - 10 freq directed (2) - 13 freq deflected (2) - 2 freq deleted (2) - 4 freq depicted (2) - 1 freq deducted (2) - 1 freq selected (2) - 8 freq |
detected (0) - 1 freq detested (2) - 1 freq dejected (2) - 2 freq deducted (3) - 1 freq detectit (3) - 5 freq detectin (3) - 1 freq detects (3) - 1 freq detector (3) - 7 freq depicted (3) - 1 freq detached (3) - 7 freq directed (3) - 13 freq detect (3) - 5 freq deflected (4) - 2 freq detective (4) - 23 freq dotted (4) - 11 freq deleted (4) - 4 freq dedicated (4) - 20 freq ditched (4) - 1 freq selected (4) - 8 freq 'elected (4) - 1 freq elected (4) - 10 freq ejected (4) - 2 freq deserted (4) - 5 freq refected (4) - 1 freq defeated (4) - 7 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 - TTKTT dedicatit - 21 freq dedicated - 20 freq deducted - 1 freq detected - 1 freq detectit - 5 freq de-tecktit - 1 freq |
DETECTED |
| Time to execute Levenshtein function - 0.292202 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.605675 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.079310 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.102316 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.001179 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. |