| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| detect (0) - 5 freq deteck (1) - 1 freq detest (1) - 2 freq defect (1) - 1 freq detects (1) - 1 freq decent (2) - 112 freq detectit (2) - 5 freq deflect (2) - 2 freq select (2) - 8 freq elect (2) - 9 freq desert (2) - 59 freq detract (2) - 2 freq defeat (2) - 30 freq direct (2) - 53 freq deter (2) - 4 freq deece (2) - 1 freq erect (2) - 3 freq exect (2) - 1 freq setert (2) - 1 freq deech (2) - 4 freq reject (2) - 11 freq etec (2) - 1 freq eefect (2) - 1 freq eject (2) - 1 freq delict (2) - 1 freq |
detect (0) - 5 freq defect (2) - 1 freq detects (2) - 1 freq detest (2) - 2 freq deteck (2) - 1 freq deceit (3) - 5 freq direct (3) - 53 freq detectin (3) - 1 freq detract (3) - 2 freq delict (3) - 1 freq detector (3) - 7 freq detectit (3) - 5 freq dutch (4) - 53 freq daetit (4) - 1 freq duct (4) - 4 freq intact (4) - 14 freq ditit (4) - 1 freq edict (4) - 2 freq detective (4) - 23 freq delicat (4) - 5 freq decait (4) - 2 freq dytit (4) - 2 freq deepcut (4) - 1 freq dovecot (4) - 4 freq detroit (4) - 21 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 - 19 freq detested - 1 freq detestit - 1 freq ditched - 1 freq deductan - 1 freq detached - 6 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 detectable - 1 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 |
DETECT |
| Time to execute Levenshtein function - 0.184568 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.338387 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.028127 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.038770 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.000879 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. |