| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| riverbank (0) - 4 freq river-bank (1) - 1 freq riverbanks (1) - 2 freq riverbed (3) - 1 freq reversan (3) - 1 freq silverback (3) - 2 freq olivebank (3) - 12 freq reverant (3) - 3 freq verdant (4) - 7 freq haversack (4) - 1 freq waveran (4) - 1 freq river (4) - 270 freq paperback (4) - 25 freq rivening (4) - 1 freq reversal (4) - 1 freq rig-bane (4) - 2 freq hoveran (4) - 1 freq verbena (4) - 1 freq coveran (4) - 2 freq reversin (4) - 4 freq wirdbank (4) - 1 freq biteback (4) - 1 freq kiverin (4) - 2 freq iverb'dy (4) - 3 freq siberian (4) - 3 freq |
riverbank (0) - 4 freq riverbanks (2) - 2 freq river-bank (2) - 1 freq reverant (5) - 3 freq olivebank (5) - 12 freq riverbed (5) - 1 freq reversan (5) - 1 freq riverebbs (6) - 1 freq verbena (6) - 1 freq raivern (6) - 1 freq reverend (6) - 40 freq revertin (6) - 2 freq reverent (6) - 4 freq reverting (6) - 1 freq reversin (6) - 4 freq reverrons (6) - 1 freq silverback (6) - 2 freq iverywan (7) - 1 freq ewbank (7) - 1 freq verbal (7) - 29 freq reverence (7) - 10 freq ribban (7) - 1 freq riverse (7) - 1 freq everyfink (7) - 7 freq riviera (7) - 1 freq |
SoundEx code - R161 rhubarb - 10 freq reprobate - 1 freq roobarb - 1 freq reverberates - 2 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 - RFRBNK riverbank - 4 freq river-bank - 1 freq |
RIVERBANK |
| Time to execute Levenshtein function - 0.226074 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.392991 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.027939 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.039623 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.000895 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. |