| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eether (0) - 12 freq aether (1) - 1 freq lether (1) - 2 freq wether (1) - 2 freq eethir (1) - 10 freq either (1) - 458 freq weether (1) - 1 freq fether (1) - 23 freq ether (1) - 27 freq nether (1) - 26 freq rether (1) - 53 freq gether (1) - 42 freq tether (1) - 18 freq neether (1) - 7 freq esther (1) - 46 freq eethur (1) - 1 freq blether (2) - 174 freq metter (2) - 53 freq hetter (2) - 5 freq other (2) - 579 freq 'other (2) - 1 freq myther (2) - 2 freq luther (2) - 9 freq tegether (2) - 1 freq eesyer (2) - 1 freq |
eether (0) - 12 freq ether (1) - 27 freq eethur (1) - 1 freq either (1) - 458 freq aether (1) - 1 freq eethir (1) - 10 freq aither (2) - 141 freq ither (2) - 3074 freq other (2) - 579 freq uther (2) - 9 freq esther (2) - 46 freq ayther (2) - 3 freq ather (2) - 3 freq tether (2) - 18 freq fether (2) - 23 freq weether (2) - 1 freq wether (2) - 2 freq lether (2) - 2 freq nether (2) - 26 freq rether (2) - 53 freq neether (2) - 7 freq ther (2) - 111 freq gether (2) - 42 freq father (3) - 86 freq raether (3) - 1 freq |
SoundEx code - E360 either - 458 freq eethur - 1 freq etter - 2 freq ether - 27 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 - E0R either - 458 freq eethur - 1 freq ether - 27 freq either' - 1 freq eethir - 10 freq eether - 12 freq aether - 1 freq €˜either - 1 freq 'either' - 1 freq |
EETHER |
| Time to execute Levenshtein function - 0.208257 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.371463 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.027586 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.036963 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.000941 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. |