| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dustspecks (0) - 1 freq suspecks (3) - 2 freq disrespeck (4) - 2 freq dusters (4) - 3 freq specks (4) - 6 freq suspeck (4) - 4 freq suspects (4) - 4 freq prospecks (4) - 2 freq respecks (4) - 11 freq aspecks (4) - 26 freq destrick (5) - 3 freq tussock (5) - 3 freq dusted (5) - 6 freq wusses (5) - 1 freq customers (5) - 23 freq fuspers (5) - 1 freq selecks (5) - 1 freq stocks (5) - 14 freq bussies (5) - 1 freq inspeck (5) - 2 freq topicks (5) - 1 freq dialecks (5) - 55 freq dusts (5) - 2 freq stricks (5) - 1 freq dumpers (5) - 1 freq |
dustspecks (0) - 1 freq suspecks (5) - 2 freq disrespeck (6) - 2 freq prospecks (7) - 2 freq aspecks (7) - 26 freq suspects (7) - 4 freq respecks (7) - 11 freq suspeck (7) - 4 freq specks (7) - 6 freq distinckt (8) - 1 freq dipsticks (8) - 1 freq suspeckin (8) - 1 freq castocks (8) - 1 freq disrespect (8) - 8 freq distances (8) - 10 freq districk (8) - 3 freq districts (8) - 5 freq sticks (8) - 143 freq spicks (8) - 6 freq suspeckit (8) - 3 freq stacks (8) - 7 freq stamacks (8) - 2 freq instincks (8) - 4 freq unsuspeckin (8) - 1 freq restricks (8) - 1 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 - TSTSPKS dustspecks - 1 freq |
DUSTSPECKS |
| Time to execute Levenshtein function - 0.267934 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.568747 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.031226 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.061887 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.001643 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. |