| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| riverbed (0) - 1 freq kivered (2) - 1 freq reverted (2) - 1 freq reversed (2) - 4 freq diverted (2) - 1 freq rivened (2) - 1 freq revered (2) - 3 freq riverse (2) - 1 freq ivered (2) - 4 freq riveted (2) - 1 freq ripened (3) - 2 freq rivers (3) - 30 freq referred (3) - 18 freq reverend (3) - 40 freq rivvined (3) - 1 freq hovered (3) - 11 freq revealed (3) - 13 freq kivvered (3) - 2 freq rose-bed (3) - 1 freq rileeved (3) - 1 freq diverse (3) - 24 freq pierced (3) - 11 freq aiverie (3) - 3 freq reverses (3) - 1 freq aiverel (3) - 1 freq |
riverbed (0) - 1 freq reversed (3) - 4 freq reverted (3) - 1 freq revered (3) - 3 freq kivered (4) - 1 freq riverside (4) - 4 freq riveted (4) - 1 freq reverend (4) - 40 freq ivered (4) - 4 freq rivened (4) - 1 freq diverted (4) - 1 freq riverse (4) - 1 freq havered (5) - 7 freq traversed (5) - 2 freq raivelled (5) - 7 freq river's (5) - 7 freq fevered (5) - 1 freq revere (5) - 1 freq riverbank (5) - 4 freq reverse (5) - 21 freq levered (5) - 3 freq iverb'dy (5) - 3 freq davered (5) - 1 freq gravelbed (5) - 1 freq iverdey (5) - 1 freq |
SoundEx code - R161 rhubarb - 10 freq reprobate - 1 freq roobarb - 1 freq reverberates - 1 freq rif-raff - 1 freq rubber-buttoned - 1 freq reprieve - 5 freq reverberated - 2 freq riverbanks - 2 freq riverbank - 4 freq repairable - 1 freq reperable - 1 freq riverbed - 1 freq rhubairb - 2 freq roubrub - 2 freq rhuburb - 4 freq refurbished - 2 freq refurbishment - 4 freq riffraff - 1 freq repruved - 1 freq repreive - 1 freq reverberatin - 1 freq reprobates - 2 freq refurbisht - 1 freq riverebbs - 1 freq riff-raff - 1 freq river-bank - 1 freq rubberpusswillbeoot - 1 freq |
MetaPhone code - RFRBT riverbed - 1 freq |
RIVERBED |
| Time to execute Levenshtein function - 0.468652 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 - 1.003028 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.028321 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.079944 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.000956 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. |