| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dzxctb (0) - 1 freq zxcb (2) - 1 freq zact (3) - 4 freq zctl (3) - 1 freq ducts (3) - 4 freq yxczb (3) - 1 freq zct (3) - 1 freq axutb (3) - 1 freq bdxtb (3) - 1 freq duct (3) - 4 freq xcb (3) - 1 freq zxst (3) - 1 freq mxjt (4) - 1 freq pact (4) - 10 freq dote (4) - 2 freq duchy (4) - 1 freq dot (4) - 47 freq mixt (4) - 8 freq dfc (4) - 2 freq excel (4) - 3 freq zhat (4) - 1 freq darcy (4) - 4 freq duvet (4) - 20 freq picts (4) - 42 freq dx (4) - 3 freq |
dzxctb (0) - 1 freq zxcb (4) - 1 freq bdxtb (6) - 1 freq xcb (6) - 1 freq zxst (6) - 1 freq axutb (6) - 1 freq duct (6) - 4 freq zctl (6) - 1 freq zct (6) - 1 freq zact (6) - 4 freq ducts (6) - 4 freq yxczb (6) - 1 freq dozent (7) - 6 freq uzqcfib (7) - 1 freq doocot (7) - 28 freq ijzcb (7) - 1 freq detect (7) - 5 freq detects (7) - 1 freq doactor (7) - 25 freq delict (7) - 1 freq defect (7) - 1 freq addict (7) - 1 freq edict (7) - 2 freq direct (7) - 55 freq excite (7) - 2 freq |
SoundEx code - D231 dustpan - 3 freq disadvantage - 8 freq dustbins - 1 freq dystopian - 4 freq disadvantaged - 1 freq disadvise - 1 freq dustbunny - 1 freq disadvantageous - 1 freq disadvantages - 1 freq dazedpuckbunny - 1 freq dzxctb - 1 freq dkqdvr - 1 freq |
MetaPhone code - TSKSKTB dzxctb - 1 freq |
DZXCTB |
| Time to execute Levenshtein function - 0.401350 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.788978 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.074016 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.047622 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.000891 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. |