| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dustpan (0) - 3 freq lustan (2) - 1 freq dustin (2) - 12 freq bustan (2) - 1 freq fustian (2) - 1 freq dunstan (2) - 1 freq rustlan (2) - 1 freq dusters (3) - 3 freq oustin (3) - 1 freq puskan (3) - 1 freq castan (3) - 1 freq musta (3) - 53 freq wastan (3) - 1 freq custrin (3) - 1 freq mustna (3) - 1 freq dust (3) - 89 freq busta (3) - 6 freq rustlin (3) - 10 freq puttan (3) - 3 freq gustav (3) - 2 freq pushan (3) - 3 freq hurtan (3) - 1 freq gupan (3) - 1 freq €œstaan (3) - 1 freq duran (3) - 3 freq |
dustpan (0) - 3 freq dystopian (3) - 4 freq dustin (3) - 12 freq distain (4) - 1 freq dunstan (4) - 1 freq rustlan (4) - 1 freq fustian (4) - 1 freq lustan (4) - 1 freq bustan (4) - 1 freq dosan (5) - 1 freq dunstane (5) - 1 freq gustin (5) - 1 freq dusts (5) - 2 freq lustin (5) - 1 freq stan (5) - 150 freq dusting (5) - 1 freq dortan (5) - 1 freq dupin (5) - 1 freq mustnae (5) - 1 freq gaspan (5) - 1 freq drippan (5) - 5 freq duntin (5) - 24 freq testan (5) - 1 freq raspan (5) - 1 freq susteen (5) - 1 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 - TSTPN dustpan - 3 freq dystopian - 4 freq |
DUSTPAN |
| Time to execute Levenshtein function - 0.225583 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.590491 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.058153 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.037059 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.000926 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. |