| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dimpled (0) - 1 freq dimple (1) - 1 freq dimples (1) - 4 freq pimpled (1) - 1 freq dumpled (1) - 1 freq sampled (2) - 2 freq rampled (2) - 1 freq dirled (2) - 11 freq sirpled (2) - 1 freq diddled (2) - 2 freq dimmed (2) - 5 freq pimple (2) - 1 freq rimples (2) - 2 freq simples (2) - 10 freq wippled (2) - 2 freq jimped (2) - 6 freq dipped (2) - 23 freq simpler (2) - 4 freq dibbled (2) - 1 freq rumpled (2) - 2 freq rippled (2) - 1 freq dilled (2) - 3 freq simple (2) - 205 freq impaled (2) - 4 freq implied (2) - 2 freq |
dimpled (0) - 1 freq dumpled (1) - 1 freq pimpled (2) - 1 freq dimples (2) - 4 freq dimple (2) - 1 freq dumped (3) - 26 freq dappled (3) - 4 freq impaled (3) - 4 freq rampled (3) - 1 freq rumpled (3) - 2 freq implied (3) - 2 freq sampled (3) - 2 freq dampened (4) - 2 freq pimples (4) - 3 freq dumpised (4) - 4 freq dialled (4) - 2 freq dumpid (4) - 1 freq imployed (4) - 2 freq despiled (4) - 1 freq implode (4) - 1 freq dumplin (4) - 25 freq dumpleen (4) - 1 freq complied (4) - 1 freq displayed (4) - 7 freq limped (4) - 1 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 - TMPLT dimpled - 1 freq dumpled - 1 freq template - 6 freq |
DIMPLED |
| Time to execute Levenshtein function - 0.211941 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.379615 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.027672 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.037759 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.000987 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. |