| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dunnerin (0) - 8 freq dunderin (1) - 4 freq wunnerin (1) - 82 freq junnerin (1) - 1 freq dennerin (1) - 2 freq unnerin (1) - 1 freq dannerin (1) - 4 freq daunnerin (1) - 2 freq wannerin (2) - 9 freq dunner (2) - 6 freq waunnerin (2) - 3 freq daunerin (2) - 30 freq wunderin (2) - 7 freq unnervin (2) - 1 freq binnerin (2) - 1 freq hunkerin (2) - 10 freq winnerin (2) - 23 freq wunnerin' (2) - 1 freq sunderin (2) - 1 freq dunderan (2) - 1 freq hennerin (2) - 1 freq dunnered (2) - 1 freq dunderie (2) - 1 freq plunnerin (2) - 1 freq rannerin (2) - 1 freq |
dunnerin (0) - 8 freq daunnerin (1) - 2 freq dennerin (1) - 2 freq dannerin (1) - 4 freq wunnerin (2) - 82 freq dunderin (2) - 4 freq unnerin (2) - 1 freq junnerin (2) - 1 freq daanerin (3) - 1 freq rannerin (3) - 1 freq daunderin (3) - 14 freq wonnerin (3) - 9 freq dunnered (3) - 1 freq dunderan (3) - 1 freq hinnerin (3) - 2 freq dunnert (3) - 1 freq jaunnerin (3) - 1 freq sinnerin (3) - 2 freq danderin (3) - 6 freq hennerin (3) - 1 freq daunerin (3) - 30 freq binnerin (3) - 1 freq winnerin (3) - 23 freq waunnerin (3) - 3 freq wannerin (3) - 9 freq |
SoundEx code - D565 daunerin - 30 freq dannerin - 4 freq dammerin - 1 freq dunnerin - 8 freq daunnerin - 2 freq dennerin - 2 freq damoarn - 5 freq daanerin - 1 freq damorn - 6 freq damorns - 1 freq |
MetaPhone code - TNRN daunerin - 30 freq dannerin - 4 freq dunnerin - 8 freq daunnerin - 2 freq dennerin - 2 freq daanerin - 1 freq tynron - 1 freq taniawren - 1 freq |
DUNNERIN |
| Time to execute Levenshtein function - 0.381294 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.970388 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.028136 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.095838 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.000966 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. |