| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| radishes (0) - 1 freq parishes (2) - 1 freq ramished (2) - 2 freq dishes (2) - 78 freq relishes (2) - 1 freq radiates (2) - 3 freq rashes (2) - 30 freq vanishes (2) - 1 freq raises (2) - 24 freq daises (3) - 1 freq advises (3) - 2 freq washes (3) - 11 freq ruises (3) - 1 freq raisins (3) - 10 freq raamished (3) - 2 freq taiches (3) - 1 freq fashes (3) - 5 freq parished (3) - 1 freq vanished (3) - 39 freq dishies (3) - 1 freq pishes (3) - 2 freq bashes (3) - 1 freq ravines (3) - 1 freq rashers (3) - 1 freq aises (3) - 1 freq |
radishes (0) - 1 freq rashes (3) - 30 freq dishes (3) - 78 freq relishes (3) - 1 freq rashis (4) - 1 freq dyshes (4) - 1 freq rashees (4) - 3 freq rehashes (4) - 1 freq dashes (4) - 1 freq rushes (4) - 20 freq ramished (4) - 2 freq parishes (4) - 1 freq dishies (4) - 1 freq radiates (4) - 3 freq vanishes (4) - 1 freq raises (4) - 24 freq rises (5) - 42 freq vainishes (5) - 5 freq waashes (5) - 4 freq racisms (5) - 1 freq marshes (5) - 1 freq weishes (5) - 3 freq crashes (5) - 7 freq raisse (5) - 1 freq raisons (5) - 20 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 - RTXS riddoch's - 1 freq radishes - 1 freq |
RADISHES |
| Time to execute Levenshtein function - 0.912380 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 - 2.180252 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.110130 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.282792 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.001138 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. |