| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dcwatch (0) - 1 freq -watch (2) - 1 freq 'catch (2) - 2 freq sclatch (2) - 1 freq rewatch (2) - 1 freq €˜watch (2) - 1 freq catch (2) - 346 freq scratch (2) - 51 freq €œwatch (2) - 1 freq watch (2) - 670 freq swatch (2) - 94 freq nwatch (2) - 1 freq scoatch (2) - 1 freq 'watch (2) - 12 freq clatch (2) - 3 freq doomwatch (3) - 1 freq scutch (3) - 1 freq scritch (3) - 1 freq mclatchy (3) - 1 freq wauch (3) - 2 freq scratcht (3) - 1 freq €˜witch (3) - 1 freq scraitch (3) - 1 freq match (3) - 174 freq cotch (3) - 8 freq |
dcwatch (0) - 1 freq swatch (4) - 94 freq watch (4) - 670 freq scoatch (4) - 1 freq clatch (4) - 3 freq doomwatch (4) - 1 freq €œwatch (4) - 1 freq 'watch (4) - 12 freq nwatch (4) - 1 freq sclatch (4) - 1 freq 'catch (4) - 2 freq scratch (4) - 51 freq -watch (4) - 1 freq rewatch (4) - 1 freq €˜watch (4) - 1 freq catch (4) - 346 freq crotch (5) - 1 freq cootch (5) - 3 freq scratchy (5) - 47 freq waatch (5) - 66 freq crutch (5) - 4 freq datcha (5) - 1 freq twitch (5) - 12 freq switch (5) - 55 freq scotch (5) - 127 freq |
SoundEx code - D232 decades - 47 freq decides - 27 freq dights - 5 freq dichts - 7 freq ducts - 4 freq digits - 3 freq dissatisfaction - 2 freq discotheque - 2 freq dusts - 2 freq deictic - 1 freq digitise - 2 freq digitised - 1 freq dists - 1 freq day-set's - 1 freq digitisin - 1 freq dost's - 1 freq dissatisfied - 1 freq deciduous - 1 freq doocots - 2 freq duguids' - 1 freq duguid's - 5 freq desydes - 1 freq decaedes - 1 freq distaste - 1 freq dekaeds - 1 freq dustspecks - 1 freq dtktwqiivy - 1 freq dztticlfeo - 1 freq deekthejoiner - 8 freq dextcn - 1 freq dcwatch - 1 freq dixdq - 3 freq dzodesvjgv - 4 freq dsdeakkmk - 1 freq deazudxlz - 1 freq dwjjtwjmyc - 1 freq dcsdcouncil - 3 freq digitscotland - 1 freq dstgidv - 1 freq |
MetaPhone code - TKWX dcwatch - 1 freq |
DCWATCH |
| Time to execute Levenshtein function - 0.194164 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.348162 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.030754 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.037707 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.000794 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. |