| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rither (0) - 6 freq lither (1) - 1 freq riter (1) - 1 freq tither (1) - 202 freq dither (1) - 2 freq mither (1) - 1378 freq fither (1) - 12 freq raither (1) - 273 freq aither (1) - 141 freq either (1) - 458 freq bither (1) - 12 freq zither (1) - 6 freq gither (1) - 69 freq rather (1) - 114 freq richer (1) - 15 freq nither (1) - 5 freq 'ither (1) - 7 freq hither (1) - 6 freq rether (1) - 53 freq wither (1) - 143 freq brither (1) - 345 freq ither (1) - 3074 freq ruther (1) - 3 freq cither (1) - 1 freq maither (2) - 1 freq |
rither (0) - 6 freq raither (1) - 273 freq ruther (1) - 3 freq rether (1) - 53 freq rather (1) - 114 freq hither (2) - 6 freq nither (2) - 5 freq 'ither (2) - 7 freq brither (2) - 345 freq reyther (2) - 1 freq raether (2) - 1 freq ither (2) - 3074 freq richer (2) - 15 freq wither (2) - 143 freq cither (2) - 1 freq dither (2) - 2 freq tither (2) - 202 freq gither (2) - 69 freq lither (2) - 1 freq mither (2) - 1378 freq riter (2) - 1 freq zither (2) - 6 freq bither (2) - 12 freq either (2) - 458 freq aither (2) - 141 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 - 11 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 |
RITHER |
| Time to execute Levenshtein function - 0.597655 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.494739 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.111192 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.184130 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.001056 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. |