| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| detectives (0) - 7 freq detective (1) - 23 freq descrives (3) - 14 freq detects (3) - 1 freq objectives (3) - 10 freq directive (3) - 4 freq detectit (3) - 5 freq elective (3) - 1 freq detectin (3) - 1 freq detected (3) - 1 freq executives (3) - 3 freq digestives (3) - 2 freq determines (3) - 1 freq deceptive (3) - 2 freq adjectives (3) - 17 freq selective (3) - 4 freq detentions (3) - 1 freq directien (4) - 1 freq densities (4) - 1 freq feechies (4) - 1 freq collectives (4) - 1 freq effective (4) - 36 freq defecting (4) - 2 freq detector (4) - 7 freq selections (4) - 1 freq |
detectives (0) - 7 freq detective (2) - 23 freq adjectives (4) - 17 freq detects (4) - 1 freq detentions (5) - 1 freq detected (5) - 1 freq executives (5) - 3 freq detectin (5) - 1 freq digestives (5) - 2 freq descrives (5) - 14 freq objectives (5) - 10 freq directive (5) - 4 freq detectit (5) - 5 freq deductions (6) - 1 freq ditties (6) - 1 freq adjective (6) - 13 freq descrieves (6) - 4 freq dutchies (6) - 1 freq depictions (6) - 2 freq detect (6) - 5 freq ladydetectives (6) - 1 freq directions (6) - 36 freq detectable (6) - 2 freq defects (6) - 1 freq deceptive (6) - 2 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 - TTKTFS detectives - 7 freq |
DETECTIVES |
| Time to execute Levenshtein function - 0.200857 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.349760 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.028217 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.041337 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.000956 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. |