| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| radgest (0) - 2 freq radges (1) - 1 freq baagest (2) - 7 freq largest (2) - 5 freq lodgest (2) - 1 freq gadges (2) - 1 freq badges (2) - 11 freq baddest (2) - 1 freq radged (2) - 1 freq wadges (2) - 1 freq rarest (2) - 4 freq radge (2) - 44 freq langest (2) - 20 freq maddest (2) - 3 freq ranges (2) - 2 freq radgey (2) - 1 freq ridges (2) - 6 freq wrangest (2) - 1 freq rages (2) - 9 freq gadget (2) - 2 freq saddest (2) - 5 freq safest (3) - 3 freq rest (3) - 696 freq jangelt (3) - 1 freq judges (3) - 19 freq |
radgest (0) - 2 freq radges (2) - 1 freq lodgest (3) - 1 freq ridges (3) - 6 freq radgey (4) - 1 freq ranges (4) - 2 freq maddest (4) - 3 freq saddest (4) - 5 freq digest (4) - 5 freq langest (4) - 20 freq rages (4) - 9 freq wrangest (4) - 1 freq gadget (4) - 2 freq gadges (4) - 1 freq radge (4) - 44 freq baagest (4) - 7 freq badges (4) - 11 freq largest (4) - 5 freq rarest (4) - 4 freq wadges (4) - 1 freq baddest (4) - 1 freq radged (4) - 1 freq bigest (5) - 1 freq gadgies (5) - 28 freq readies (5) - 3 freq |
SoundEx code - R322 ridges - 6 freq reid-checkit - 1 freq reid-cheeked - 3 freq ratches - 1 freq riddoch's - 1 freq radgest - 2 freq redesigned - 1 freq ridgeways - 1 freq retches - 1 freq roadsign - 1 freq roadsigns - 2 freq road-signs - 1 freq radges - 1 freq ritzys - 1 freq radge-check - 1 freq reduces - 1 freq rtxgqycobj - 1 freq radishes - 1 freq |
MetaPhone code - RJST radgest - 2 freq rejoiced - 3 freq |
RADGEST |
| Time to execute Levenshtein function - 0.568410 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.011289 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.094347 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.106924 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.001224 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. |