| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rether (0) - 53 freq aether (1) - 1 freq eether (1) - 12 freq ruther (1) - 3 freq rither (1) - 6 freq gether (1) - 42 freq ether (1) - 26 freq lether (1) - 2 freq tether (1) - 18 freq wether (1) - 2 freq fether (1) - 23 freq raether (1) - 1 freq nether (1) - 26 freq rather (1) - 114 freq reyther (1) - 1 freq neither (2) - 166 freq leither (2) - 5 freq uther (2) - 9 freq 'ither (2) - 7 freq wetter (2) - 4 freq fither (2) - 12 freq weether (2) - 1 freq reider (2) - 5 freq reaper (2) - 16 freq lethers (2) - 1 freq |
rether (0) - 53 freq raether (1) - 1 freq reyther (1) - 1 freq rither (1) - 6 freq rather (1) - 114 freq ruther (1) - 3 freq eether (2) - 12 freq gether (2) - 42 freq aether (2) - 1 freq raither (2) - 273 freq nether (2) - 26 freq tether (2) - 18 freq lether (2) - 2 freq fether (2) - 23 freq wether (2) - 2 freq ether (2) - 26 freq tther (3) - 6 freq rasther (3) - 1 freq cither (3) - 1 freq lither (3) - 1 freq mother (3) - 97 freq wrather (3) - 1 freq either (3) - 445 freq wather (3) - 75 freq owther (3) - 5 freq |
SoundEx code - R360 raither - 273 freq reader - 89 freq retour - 32 freq rotary - 3 freq rather - 114 freq rudder - 4 freq reider - 5 freq radar - 11 freq retire - 10 freq rattray - 2 freq reeder - 3 freq rider - 10 freq rattra - 4 freq reyther - 1 freq rether - 53 freq redder - 15 freq rae-deer - 1 freq ridder - 2 freq reed-raa - 1 freq redrew - 1 freq rither - 6 freq riter - 1 freq 'retro' - 1 freq reedware - 1 freq rhethorie - 1 freq retro - 8 freq reddir - 6 freq router - 1 freq reidware - 1 freq raether - 1 freq redraw - 2 freq reidder - 2 freq roodery - 1 freq raider - 1 freq ruder - 2 freq ruther - 3 freq ratier - 1 freq retir - 1 freq raitir - 1 freq ryder - 1 freq raedir - 1 freq |
MetaPhone code - R0R raither - 273 freq rather - 114 freq reyther - 1 freq rether - 53 freq rither - 6 freq raether - 1 freq ruther - 3 freq wrather - 1 freq |
RETHER |
| Time to execute Levenshtein function - 0.241747 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.373723 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.029028 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.041964 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.000820 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. |