| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| detest (0) - 2 freq detect (1) - 5 freq deceit (2) - 5 freq ferest (2) - 1 freq beest (2) - 11 freq feyest (2) - 1 freq eest (2) - 24 freq reest (2) - 11 freq deter (2) - 4 freq deteck (2) - 1 freq test (2) - 146 freq dearest (2) - 19 freq derkest (2) - 2 freq weest (2) - 1 freq dotes (2) - 1 freq newest (2) - 15 freq detects (2) - 1 freq dees (2) - 41 freq setert (2) - 1 freq daftest (2) - 4 freq gretest (2) - 2 freq dedes (2) - 1 freq dee't (2) - 36 freq neest (2) - 88 freq deet (2) - 24 freq |
detest (0) - 2 freq detect (2) - 5 freq daftest (3) - 4 freq neatest (3) - 1 freq desist (3) - 1 freq fitest (3) - 1 freq gytest (3) - 1 freq digest (3) - 5 freq attest (3) - 2 freq driest (3) - 7 freq detested (3) - 1 freq latest (3) - 72 freq weetest (3) - 1 freq dotes (3) - 1 freq dytes (3) - 1 freq laetest (3) - 4 freq dentist (3) - 46 freq deepest (3) - 18 freq detestit (3) - 1 freq dates (3) - 36 freq dearest (3) - 19 freq test (3) - 146 freq jatest (3) - 1 freq daetit (4) - 1 freq steyest (4) - 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 - TTST tottiest - 6 freq deduced - 1 freq totiest - 1 freq detest - 2 freq |
DETEST |
| Time to execute Levenshtein function - 0.305956 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.463510 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.029292 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.039314 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.000880 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. |