| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ether (0) - 26 freq gether (1) - 42 freq nether (1) - 26 freq esther (1) - 46 freq ther (1) - 111 freq ather (1) - 3 freq ither (1) - 3062 freq 'ther (1) - 1 freq uther (1) - 9 freq eether (1) - 12 freq etter (1) - 2 freq aether (1) - 1 freq fether (1) - 23 freq lether (1) - 2 freq tther (1) - 6 freq rether (1) - 53 freq wether (1) - 2 freq tether (1) - 18 freq either (1) - 445 freq other (1) - 530 freq ethos (2) - 2 freq efer (2) - 1 freq cither (2) - 1 freq 'then (2) - 38 freq lecher (2) - 1 freq |
ether (0) - 26 freq other (1) - 530 freq uther (1) - 9 freq eether (1) - 12 freq ither (1) - 3062 freq ther (1) - 111 freq either (1) - 445 freq aether (1) - 1 freq ather (1) - 3 freq eethir (2) - 10 freq thier (2) - 3 freq thor (2) - 20 freq aither (2) - 140 freq thar (2) - 102 freq ithir (2) - 34 freq there (2) - 6720 freq thur (2) - 376 freq uthir (2) - 1 freq uthur (2) - 1 freq their (2) - 5043 freq thir (2) - 1508 freq othir (2) - 1 freq eethur (2) - 1 freq thyr (2) - 6 freq ayther (2) - 3 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 - E0R either - 445 freq eethur - 1 freq ether - 26 freq either' - 1 freq eethir - 10 freq eether - 12 freq aether - 1 freq €˜either - 1 freq 'either' - 1 freq |
ETHER |
| Time to execute Levenshtein function - 0.250451 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.504417 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.027261 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.087748 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.000943 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. |