| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| detectin (0) - 1 freq detectit (1) - 5 freq selectin (2) - 1 freq detective (2) - 23 freq directin (2) - 4 freq detect (2) - 5 freq detects (2) - 1 freq detention (2) - 10 freq defecting (2) - 2 freq dejectit (2) - 1 freq dejection (2) - 2 freq deflectin (2) - 1 freq desertin (2) - 2 freq detector (2) - 7 freq rejectin (2) - 4 freq erectin (2) - 1 freq detected (2) - 1 freq detachin (2) - 1 freq pertectin (2) - 2 freq electin (2) - 2 freq detestit (2) - 1 freq retweetin (3) - 2 freq deaein (3) - 1 freq dementit (3) - 22 freq ejectit (3) - 1 freq |
detectin (0) - 1 freq detectit (2) - 5 freq detachin (3) - 1 freq dejection (3) - 2 freq detention (3) - 10 freq detector (3) - 7 freq detected (3) - 1 freq detects (3) - 1 freq detective (3) - 23 freq directin (3) - 4 freq detect (3) - 5 freq directien (4) - 1 freq deductan (4) - 1 freq depiction (4) - 3 freq dedicatin (4) - 2 freq dottin (4) - 1 freq dyrectien (4) - 1 freq detestit (4) - 1 freq duettin (4) - 1 freq direction (4) - 123 freq electin (4) - 2 freq deflectin (4) - 1 freq dejectit (4) - 1 freq defecting (4) - 2 freq selectin (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 - TTKTN dedicatin - 2 freq deductan - 1 freq detectin - 1 freq |
DETECTIN |
| Time to execute Levenshtein function - 0.313691 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.685080 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.086344 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.048598 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.000898 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. |