| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reedware (0) - 1 freq reidware (1) - 1 freq neednae (3) - 21 freq rewire (3) - 2 freq ee-are (3) - 2 freq heedtae (3) - 1 freq meedae (3) - 2 freq rteclare (3) - 1 freq need'ae (3) - 3 freq reward (3) - 47 freq needae (3) - 1 freq reeds-e (3) - 1 freq weedae (3) - 10 freq trees-are (3) - 1 freq weelfare (3) - 2 freq lee-wark (3) - 1 freq edwart (3) - 5 freq beware (3) - 5 freq reeder (3) - 3 freq redcard (3) - 1 freq edward (3) - 33 freq threedbare (3) - 1 freq revedere (3) - 1 freq re-wire (3) - 1 freq betaware (3) - 1 freq |
reedware (0) - 1 freq reidware (1) - 1 freq re-wire (4) - 1 freq reeder (4) - 3 freq rewire (4) - 2 freq headwear (5) - 1 freq reider (5) - 5 freq redder (5) - 15 freq reederse (5) - 3 freq betaware (5) - 1 freq needfire (5) - 1 freq reekiewar (5) - 1 freq redars (5) - 1 freq reed-raa (5) - 1 freq raedir (5) - 1 freq roadway (5) - 1 freq roadwye (5) - 1 freq weedower (5) - 2 freq reidder (5) - 2 freq reddir (5) - 6 freq dewar (5) - 9 freq radar (5) - 11 freq reader (5) - 89 freq revedere (5) - 1 freq reward (5) - 47 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 - RTWR reedware - 1 freq reidware - 1 freq |
REEDWARE |
| Time to execute Levenshtein function - 0.253603 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.397132 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.028359 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.037194 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.000900 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. |