| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| redolent (0) - 4 freq relent (2) - 5 freq redden (3) - 1 freq recent (3) - 71 freq revolt (3) - 3 freq prevelent (3) - 1 freq seilent (3) - 6 freq referent (3) - 3 freq reopen (3) - 1 freq violent (3) - 18 freq eediolect (3) - 1 freq recoont (3) - 3 freq reponents (3) - 1 freq reduce't (3) - 1 freq resent (3) - 3 freq resonant (3) - 1 freq rolment (3) - 1 freq prevalent (3) - 1 freq reprent (3) - 2 freq resilient (3) - 4 freq re-solet (3) - 1 freq repent (3) - 17 freq sediment (3) - 2 freq regent (3) - 6 freq remeent (3) - 2 freq |
redolent (0) - 4 freq relent (3) - 5 freq relient (4) - 1 freq resilient (4) - 4 freq reident (4) - 2 freq rodent (4) - 4 freq resolvit (5) - 2 freq repellent (5) - 1 freq dozent (5) - 6 freq recent (5) - 71 freq relents (5) - 3 freq regiment (5) - 21 freq redirect (5) - 1 freq insolent (5) - 1 freq seelent (5) - 25 freq reinvent (5) - 2 freq resident (5) - 16 freq redden (5) - 1 freq resiliant (5) - 1 freq reliant (5) - 3 freq seilent (5) - 6 freq reverent (5) - 3 freq red-het (5) - 1 freq ardent (5) - 2 freq reflect (5) - 29 freq |
SoundEx code - R345 rattlin - 51 freq riddlum - 1 freq riddlums - 2 freq retellin - 4 freq riddlings - 1 freq redolent - 4 freq rattlin' - 1 freq rettlin - 2 freq rattlan - 5 freq riddlin - 1 freq re-tellin - 1 freq reideileen - 6 freq |
MetaPhone code - RTLNT redolent - 4 freq |
REDOLENT |
| Time to execute Levenshtein function - 0.195951 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.450930 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.062571 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.041823 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.000763 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. |