| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| edder (0) - 21 freq odder (1) - 1 freq idder (1) - 286 freq udder (1) - 1 freq nedder (1) - 18 freq elder (1) - 58 freq ledder (1) - 23 freq eider (1) - 3 freq edter (1) - 1 freq adder (1) - 4 freq hedder (1) - 11 freq redder (1) - 15 freq wedder (1) - 3 freq tedder (1) - 2 freq edders (1) - 1 freq eader (1) - 1 freq eddir (1) - 10 freq fedder (1) - 36 freq adden (2) - 1 freq dcer (2) - 1 freq elders (2) - 21 freq wedded (2) - 4 freq added (2) - 173 freq lender (2) - 2 freq enfer (2) - 1 freq |
edder (0) - 21 freq eddir (1) - 10 freq adder (1) - 4 freq udder (1) - 1 freq idder (1) - 286 freq odder (1) - 1 freq tedder (2) - 2 freq edders (2) - 1 freq aidder (2) - 1 freq wedder (2) - 3 freq fedder (2) - 36 freq eader (2) - 1 freq iddir (2) - 11 freq nedder (2) - 18 freq redder (2) - 15 freq ledder (2) - 23 freq elder (2) - 58 freq hedder (2) - 11 freq eider (2) - 3 freq edter (2) - 1 freq eddi (3) - 1 freq deer (3) - 69 freq badder (3) - 5 freq dudder (3) - 1 freq der (3) - 302 freq |
SoundEx code - E360 either - 445 freq eethur - 1 freq etter - 2 freq ether - 26 freq either' - 1 freq eethir - 10 freq eater - 2 freq edder - 21 freq eether - 12 freq eddir - 10 freq eddir' - 1 freq eider - 3 freq eader - 1 freq edr - 1 freq €˜either - 1 freq edra - 5 freq €™etre - 1 freq edrw - 1 freq edter - 1 freq etr - 1 freq 'either' - 1 freq |
MetaPhone code - ETR etter - 2 freq eater - 2 freq aeter - 1 freq edder - 21 freq eddir - 10 freq eddir' - 1 freq eider - 3 freq eader - 1 freq edr - 1 freq edra - 5 freq €™etre - 1 freq edrw - 1 freq etr - 1 freq |
EDDER |
| Time to execute Levenshtein function - 0.201895 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.327230 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.028833 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.043096 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.000903 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. |