| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| retches (0) - 1 freq fetches (1) - 4 freq retched (1) - 1 freq ratches (1) - 1 freq reaches (1) - 24 freq wretches (1) - 1 freq trenches (2) - 11 freq ketched (2) - 1 freq breaches (2) - 3 freq fetched (2) - 8 freq reachet (2) - 1 freq watches (2) - 29 freq ditches (2) - 8 freq creches (2) - 1 freq leitches (2) - 1 freq reechet (2) - 2 freq rothes (2) - 1 freq witches (2) - 35 freq retchin (2) - 2 freq teaches (2) - 3 freq merches (2) - 3 freq brenches (2) - 10 freq sketches (2) - 4 freq pitches (2) - 15 freq rether (2) - 53 freq |
retches (0) - 1 freq ratches (1) - 1 freq fetches (2) - 4 freq reaches (2) - 24 freq wretches (2) - 1 freq retched (2) - 1 freq patches (3) - 22 freq riches (3) - 23 freq vratches (3) - 5 freq brotches (3) - 2 freq hitches (3) - 2 freq matches (3) - 41 freq retch (3) - 1 freq bitches (3) - 6 freq latches (3) - 2 freq hutches (3) - 1 freq notches (3) - 1 freq crutches (3) - 3 freq erches (3) - 1 freq pitches (3) - 15 freq crotches (3) - 1 freq hatches (3) - 4 freq eitches (3) - 1 freq catches (3) - 34 freq witches (3) - 35 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 - RXS riches - 23 freq reaches - 24 freq rochs - 1 freq rushes - 20 freq rashes - 30 freq ratches - 1 freq rashees - 3 freq retches - 1 freq wretches - 1 freq rashis - 1 freq |
RETCHES |
| Time to execute Levenshtein function - 0.439393 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.774420 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.075715 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.044632 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.000893 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. |