| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ridges (0) - 6 freq ridge (1) - 18 freq midges (1) - 26 freq fidges (1) - 2 freq ridgers (1) - 3 freq radges (1) - 1 freq rides (1) - 16 freq fridges (1) - 1 freq bridges (1) - 12 freq sidles (2) - 2 freq hides (2) - 14 freq radgey (2) - 1 freq aidge (2) - 5 freq bridies (2) - 1 freq bridget (2) - 2 freq dirges (2) - 1 freq midge (2) - 10 freq ride (2) - 69 freq rifles (2) - 13 freq grudges (2) - 2 freq judges (2) - 19 freq ringed (2) - 7 freq widge (2) - 1 freq ludges (2) - 2 freq bridles (2) - 1 freq |
ridges (0) - 6 freq radges (1) - 1 freq fridges (2) - 1 freq bridges (2) - 12 freq rides (2) - 16 freq ridgers (2) - 3 freq ridge (2) - 18 freq midges (2) - 26 freq fidges (2) - 2 freq ledges (3) - 3 freq radged (3) - 1 freq rings (3) - 103 freq gadges (3) - 1 freq nudges (3) - 4 freq badges (3) - 11 freq dodges (3) - 2 freq rages (3) - 7 freq midgies (3) - 20 freq fudges (3) - 1 freq wadges (3) - 1 freq rodger (3) - 4 freq rudge (3) - 1 freq aedges (3) - 3 freq rodgers (3) - 2 freq hedges (3) - 38 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 - RJS ridges - 6 freq rejoice - 10 freq rages - 7 freq rejyyce - 1 freq rejyce - 1 freq rogie's - 1 freq radges - 1 freq rojas - 1 freq wrgez - 1 freq |
RIDGES |
| Time to execute Levenshtein function - 0.401481 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.883880 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.094733 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.112094 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.001045 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. |