| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dumplins (0) - 8 freq dumpling (1) - 3 freq dumplin (1) - 25 freq dumplin' (1) - 1 freq dumplings (1) - 1 freq drumlins (2) - 5 freq pumpkins (2) - 2 freq mumblins (2) - 1 freq dummmplins (2) - 2 freq dumpin (2) - 5 freq dumping (2) - 1 freq rumplin (2) - 1 freq uplins (2) - 1 freq bumpin (3) - 9 freq mumping (3) - 1 freq dumpled (3) - 1 freq butlins (3) - 1 freq numptics (3) - 1 freq dumpish (3) - 1 freq humping (3) - 1 freq rumbling (3) - 1 freq dummmplin (3) - 2 freq dunlin (3) - 2 freq pumping (3) - 2 freq derlins (3) - 1 freq |
dumplins (0) - 8 freq dumplin' (2) - 1 freq dumplings (2) - 1 freq dumpling (2) - 3 freq dumplin (2) - 25 freq rumplin (4) - 1 freq uplins (4) - 1 freq dimples (4) - 4 freq dumping (4) - 1 freq dumpleen (4) - 1 freq complains (4) - 6 freq pumpkins (4) - 2 freq drumlins (4) - 5 freq dumpin (4) - 5 freq mumblins (4) - 1 freq dummmplins (4) - 2 freq daurklins (5) - 3 freq dumpers (5) - 1 freq dumpfen (5) - 1 freq emmlins (5) - 1 freq dealins (5) - 5 freq darlins (5) - 4 freq deepins (5) - 1 freq saplins (5) - 2 freq implies (5) - 9 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 - TMPLNS dumplins - 8 freq dummmplins - 2 freq |
DUMPLINS |
| Time to execute Levenshtein function - 0.288626 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.560718 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.027006 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.074165 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.000862 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. |