| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dumbledore (0) - 22 freq €˜dumbledore (2) - 1 freq wimbledon (4) - 2 freq tumbled (4) - 9 freq fumbled (4) - 5 freq tumblers (4) - 4 freq humbled (4) - 1 freq drumblade (4) - 1 freq dulesome (4) - 18 freq tumbler (4) - 4 freq dumpled (4) - 1 freq bumbled (4) - 1 freq rumbled (4) - 5 freq mumbled (4) - 6 freq jumbled (4) - 2 freq jumble-sale (5) - 1 freq erledome (5) - 1 freq mumbles (5) - 4 freq dumper (5) - 1 freq number (5) - 174 freq uelefare (5) - 1 freq dumped (5) - 26 freq humber (5) - 2 freq bumbaleerie (5) - 1 freq toblerone (5) - 1 freq |
dumbledore (0) - 22 freq €˜dumbledore (4) - 1 freq dumpled (6) - 1 freq rumbled (6) - 5 freq jumbled (6) - 2 freq tumbler (6) - 4 freq mumbled (6) - 6 freq bumbled (6) - 1 freq tumbled (6) - 9 freq fumbled (6) - 5 freq wimbledon (6) - 2 freq drumblade (6) - 1 freq humbled (6) - 1 freq doobler (7) - 1 freq gambler (7) - 4 freq dibbled (7) - 1 freq dimpled (7) - 1 freq ambled (7) - 1 freq gambled (7) - 1 freq doubler (7) - 6 freq doobled (7) - 4 freq dupleader (7) - 2 freq doubled (7) - 7 freq bumbaleerie (7) - 1 freq dabbled (7) - 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 - TMLTR dumbledore - 22 freq €˜dumbledore - 1 freq |
DUMBLEDORE |
| Time to execute Levenshtein function - 0.229646 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.398796 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.030900 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.039059 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.003961 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. |