| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dannerin (0) - 4 freq wannerin (1) - 9 freq dennerin (1) - 2 freq rannerin (1) - 1 freq daunnerin (1) - 2 freq daunerin (1) - 30 freq daanerin (1) - 1 freq dunnerin (1) - 8 freq danderin (1) - 6 freq dannert (2) - 3 freq wonnerin (2) - 9 freq annexin (2) - 1 freq dammerin (2) - 1 freq wanderin (2) - 35 freq daunderin (2) - 14 freq jaunnerin (2) - 1 freq dannered (2) - 1 freq junnerin (2) - 1 freq danner (2) - 13 freq binnerin (2) - 1 freq winnerin (2) - 23 freq waunerin (2) - 4 freq hinnerin (2) - 2 freq santerin (2) - 1 freq waunnerin (2) - 3 freq |
dannerin (0) - 4 freq daunnerin (1) - 2 freq dunnerin (1) - 8 freq dennerin (1) - 2 freq daanerin (2) - 1 freq danderin (2) - 6 freq wannerin (2) - 9 freq rannerin (2) - 1 freq daunerin (2) - 30 freq waunnerin (3) - 3 freq winnerin (3) - 23 freq binnerin (3) - 1 freq hinnerin (3) - 2 freq sinnerin (3) - 2 freq danner (3) - 13 freq unnerin (3) - 1 freq hennerin (3) - 1 freq wunnerin (3) - 82 freq dannered (3) - 1 freq daunderin (3) - 14 freq junnerin (3) - 1 freq jaunnerin (3) - 1 freq wonnerin (3) - 9 freq dannert (3) - 3 freq dunderin (3) - 4 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 |
DANNERIN |
| Time to execute Levenshtein function - 0.673712 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 - 1.012165 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.110657 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.180813 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.001021 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. |