| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| detective (0) - 23 freq detectives (1) - 7 freq detectin (2) - 1 freq directive (2) - 4 freq selective (2) - 4 freq deceptive (2) - 2 freq detectit (2) - 5 freq elective (2) - 1 freq defecting (3) - 2 freq respective (3) - 5 freq destructive (3) - 1 freq effective (3) - 36 freq detects (3) - 1 freq reactive (3) - 5 freq defensive (3) - 10 freq protective (3) - 8 freq deceive (3) - 7 freq dejection (3) - 2 freq reductive (3) - 1 freq tentive (3) - 1 freq detestit (3) - 1 freq executive (3) - 107 freq reflective (3) - 3 freq descrive (3) - 25 freq receptive (3) - 4 freq |
detective (0) - 23 freq detectives (2) - 7 freq directive (3) - 4 freq detectin (3) - 1 freq detectit (3) - 5 freq detected (4) - 1 freq detect (4) - 5 freq detects (4) - 1 freq detector (4) - 7 freq elective (4) - 1 freq selective (4) - 4 freq deceptive (4) - 2 freq adjective (4) - 13 freq invective (5) - 1 freq detention (5) - 10 freq addictive (5) - 1 freq objective (5) - 15 freq detectable (5) - 2 freq descrive (5) - 25 freq attentive (5) - 1 freq dejectit (5) - 1 freq digestive (5) - 4 freq reductive (5) - 1 freq protective (5) - 8 freq reactive (5) - 5 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 - TTKTF detective - 23 freq |
DETECTIVE |
| Time to execute Levenshtein function - 0.212661 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.381273 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.029088 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.038774 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.000986 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. |