| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| river-bank (0) - 1 freq riverbank (1) - 4 freq riverbanks (2) - 2 freq riverebbs (4) - 1 freq paet-bank (4) - 1 freq rig-bane (4) - 2 freq riverbed (4) - 1 freq olivebank (4) - 12 freq five-ack (4) - 1 freq wirdbank (4) - 1 freq reversan (4) - 1 freq paper-back (4) - 1 freq reverant (4) - 3 freq riggy-bane (4) - 2 freq silverback (4) - 2 freq iverywan (4) - 1 freq five-week (5) - 1 freq reversin (5) - 4 freq ower-lang (5) - 1 freq airmbans (5) - 1 freq iveryb'dy (5) - 4 freq siberian (5) - 3 freq tirbans (5) - 1 freq rivan (5) - 2 freq reverrons (5) - 1 freq |
river-bank (0) - 1 freq riverbank (2) - 4 freq riverbanks (4) - 2 freq reversan (7) - 1 freq reverant (7) - 3 freq wirdbank (7) - 1 freq riggy-bane (7) - 2 freq paper-back (7) - 1 freq riverebbs (7) - 1 freq paet-bank (7) - 1 freq rig-bane (7) - 2 freq olivebank (7) - 12 freq riverbed (7) - 1 freq iviry-ean (8) - 1 freq verbena (8) - 1 freq revertin (8) - 2 freq niver-ennin (8) - 1 freq raivern (8) - 1 freq ley-baunk (8) - 1 freq rig-banes (8) - 1 freq reverting (8) - 1 freq data-bank (8) - 1 freq wire-baned (8) - 1 freq reverent (8) - 4 freq reverend (8) - 40 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 |
RIVER-BANK |
| Time to execute Levenshtein function - 0.234142 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.369543 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.031720 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.037024 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.000876 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. |