| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dumplin (0) - 25 freq rumplin (1) - 1 freq dumpling (1) - 3 freq dumpin (1) - 5 freq dumplins (1) - 8 freq dumplin' (1) - 1 freq driplin (2) - 1 freq tumblin (2) - 5 freq dumping (2) - 1 freq mumblin (2) - 2 freq humblin (2) - 1 freq dublin (2) - 29 freq dumpled (2) - 1 freq bumflin (2) - 1 freq duellin (2) - 2 freq dummmplin (2) - 2 freq wimplin (2) - 6 freq bumpin (2) - 9 freq saumplin (2) - 2 freq dumpleen (2) - 1 freq humphin (2) - 18 freq samplin (2) - 2 freq rumblin (2) - 12 freq mumphin (2) - 1 freq dumpie (2) - 1 freq |
dumplin (0) - 25 freq dumpleen (2) - 1 freq dumplins (2) - 8 freq dumplin' (2) - 1 freq rumplin (2) - 1 freq dumpling (2) - 3 freq dumpin (2) - 5 freq wimplin (3) - 6 freq rimplin (3) - 1 freq dumpled (3) - 1 freq dumpfen (3) - 1 freq samplin (3) - 2 freq saumplin (3) - 2 freq driplin (3) - 1 freq mummlin (4) - 7 freq jumpin (4) - 61 freq lumpin (4) - 1 freq pumpkin (4) - 6 freq rummlin (4) - 24 freq dunlin (4) - 2 freq jummlin (4) - 1 freq dupin (4) - 1 freq dullin (4) - 2 freq complyin (4) - 1 freq dumbin (4) - 2 freq |
SoundEx code - D514 dimpled - 1 freq dumbbells - 1 freq dumplin - 25 freq dunblane - 4 freq dimple - 1 freq dumbledore - 22 freq dimbleby - 3 freq dumplins - 8 freq downfield - 1 freq dimples - 4 freq dummy-fluters - 1 freq dumpleen - 1 freq dumpled - 1 freq doonfall-' - 1 freq dumpling - 3 freq damnföl - 1 freq €˜dumbledore - 1 freq dummmplin - 2 freq dummmplins - 2 freq dumplings - 1 freq danbell - 2 freq downfall - 1 freq dumplin' - 1 freq dunblaneranger - 2 freq |
MetaPhone code - TMPLN dumplin - 25 freq dumpleen - 1 freq dummmplin - 2 freq dumplin' - 1 freq |
DUMPLIN |
| Time to execute Levenshtein function - 0.321521 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.610589 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.065540 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.039488 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.000901 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. |