| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ridgeways (0) - 1 freq sidieways (2) - 1 freq sideways (2) - 1 freq sidie-ways (3) - 1 freq sidieweys (3) - 10 freq ridgers (3) - 3 freq driveways (3) - 2 freq ridges (3) - 6 freq highways (3) - 3 freq sideweys (3) - 3 freq iyways (4) - 1 freq iways (4) - 17 freq fridays (4) - 11 freq riders (4) - 8 freq radgey (4) - 1 freq fidges (4) - 2 freq ideals (4) - 6 freq riteday (4) - 1 freq bridges (4) - 12 freq fridges (4) - 1 freq didyeaye (4) - 1 freq midges (4) - 26 freq rodgers (4) - 2 freq kidneys (4) - 6 freq ridge (4) - 18 freq |
ridgeways (0) - 1 freq ridgers (4) - 3 freq sidieways (4) - 1 freq ridges (4) - 6 freq sideways (4) - 1 freq sideweys (5) - 3 freq rodgers (5) - 2 freq radges (5) - 1 freq sidie-ways (5) - 1 freq sidieweys (5) - 10 freq highways (6) - 3 freq airways (6) - 3 freq ridge (6) - 18 freq rides (6) - 16 freq sidyweys (6) - 3 freq sidewyes (6) - 3 freq railways (6) - 7 freq sidwaes (6) - 1 freq redgrass (6) - 1 freq ridness (6) - 1 freq sideyweys (6) - 5 freq midgets (6) - 5 freq edgewise (6) - 1 freq radgey (6) - 1 freq midges (6) - 26 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 - RJWS ridgeways - 1 freq |
RIDGEWAYS |
| Time to execute Levenshtein function - 0.210162 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.402294 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.026995 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.039048 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.000832 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. |