| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dennerin (0) - 2 freq dannerin (1) - 4 freq dunnerin (1) - 8 freq hennerin (1) - 1 freq dunderin (2) - 4 freq binnerin (2) - 1 freq wonnerin (2) - 9 freq tenderin (2) - 2 freq denner (2) - 273 freq wannerin (2) - 9 freq hinnerin (2) - 2 freq daanerin (2) - 1 freq daunnerin (2) - 2 freq denner's (2) - 1 freq daunerin (2) - 30 freq wunnerin (2) - 82 freq winnerin (2) - 23 freq rannerin (2) - 1 freq renderin (2) - 5 freq junnerin (2) - 1 freq unnerin (2) - 1 freq enterin (2) - 20 freq danderin (2) - 6 freq denners (2) - 11 freq sinnerin (2) - 2 freq |
dennerin (0) - 2 freq dunnerin (1) - 8 freq dannerin (1) - 4 freq daunnerin (2) - 2 freq hennerin (2) - 1 freq rannerin (3) - 1 freq winnerin (3) - 23 freq junnerin (3) - 1 freq denners (3) - 11 freq sinnerin (3) - 2 freq wunnerin (3) - 82 freq danderin (3) - 6 freq unnerin (3) - 1 freq daunerin (3) - 30 freq wannerin (3) - 9 freq denner (3) - 273 freq wonnerin (3) - 9 freq binnerin (3) - 1 freq dunderin (3) - 4 freq hinnerin (3) - 2 freq daanerin (3) - 1 freq dennir (4) - 29 freq donner (4) - 2 freq daenner (4) - 1 freq danner (4) - 13 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 |
DENNERIN |
| Time to execute Levenshtein function - 0.199590 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.379527 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.027307 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.036788 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.000785 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. |