| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rhubarb (0) - 10 freq rhubard (1) - 1 freq rhuburb (1) - 4 freq rhubairb (1) - 2 freq roobarb (2) - 1 freq ruary (3) - 1 freq roubrub (3) - 2 freq shugar (3) - 1 freq rubb (3) - 1 freq qubare (3) - 1 freq huband (3) - 1 freq rhar (3) - 1 freq hubbard (3) - 13 freq rubato (3) - 1 freq suburb (3) - 4 freq uvulars (4) - 1 freq barx (4) - 1 freq reborn (4) - 7 freq barbs (4) - 1 freq blurb (4) - 1 freq robert (4) - 237 freq rigbane (4) - 7 freq whurs (4) - 1 freq robbers (4) - 7 freq riband (4) - 1 freq |
rhubarb (0) - 10 freq rhuburb (1) - 4 freq rhubairb (1) - 2 freq rhubard (2) - 1 freq roobarb (3) - 1 freq roubrub (4) - 2 freq suburb (5) - 4 freq rubb (5) - 1 freq rhar (5) - 1 freq robbery (6) - 8 freq rhymer (6) - 12 freq rehab (6) - 1 freq rahab (6) - 2 freq hubby (6) - 10 freq rhymers (6) - 2 freq rayburn (6) - 1 freq vhbr (6) - 1 freq hobnob (6) - 2 freq hubba (6) - 1 freq hobb (6) - 1 freq ahrb (6) - 1 freq rubbir (6) - 1 freq khyber (6) - 1 freq resorb (6) - 1 freq robb (6) - 46 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 - RHBRB rhubarb - 10 freq rhubairb - 2 freq rhuburb - 4 freq |
RHUBARB |
| Time to execute Levenshtein function - 0.286398 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.505953 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.060859 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.037932 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.000842 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. |