| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rubbery (0) - 7 freq rubbert (1) - 2 freq robbery (1) - 8 freq rubber (1) - 54 freq rubbers (1) - 1 freq hubbert (2) - 1 freq rubbed (2) - 43 freq rubbir (2) - 1 freq robbers (2) - 7 freq cubberd (2) - 1 freq nibbery (2) - 1 freq robber (2) - 3 freq nebbery (2) - 1 freq hubber (2) - 1 freq 'rubber (2) - 1 freq dubbed (3) - 3 freq drudgery (3) - 3 freq rubbing (3) - 3 freq sugery (3) - 1 freq hubbard (3) - 13 freq mulberry (3) - 4 freq buttery (3) - 24 freq ruby (3) - 8 freq uber (3) - 2 freq runners (3) - 9 freq |
rubbery (0) - 7 freq rubber (1) - 54 freq robbery (1) - 8 freq rubbir (2) - 1 freq robber (2) - 3 freq rubbert (2) - 2 freq rubbers (2) - 1 freq 'rubber (3) - 1 freq nebbery (3) - 1 freq nibbery (3) - 1 freq hubber (3) - 1 freq robbers (3) - 7 freq rubbed (3) - 43 freq robbed (4) - 16 freq robby (4) - 5 freq rubbin (4) - 50 freq dobber (4) - 4 freq rubban (4) - 3 freq jabber (4) - 4 freq rubb (4) - 1 freq ribbed (4) - 2 freq ribben (4) - 1 freq rubble (4) - 7 freq rubbage (4) - 4 freq dabber (4) - 3 freq |
SoundEx code - R160 river - 270 freq reappear - 6 freq rubber - 54 freq riper - 4 freq reverie - 2 freq referee - 15 freq 'rubber - 1 freq repair - 15 freq rapier - 2 freq rover - 12 freq reiver - 22 freq refer - 37 freq revoir - 5 freq raver - 4 freq rapper - 4 freq raverie - 1 freq ripper - 10 freq reaper - 20 freq riever - 2 freq robbery - 8 freq reviewer - 2 freq rubbery - 7 freq rïver - 5 freq robber - 3 freq ryver - 1 freq reveiry - 1 freq reapir - 1 freq reever - 2 freq re-fere - 1 freq rubbir - 1 freq rpr - 2 freq revere - 1 freq re-appear - 1 freq riviera - 1 freq robfray - 1 freq |
MetaPhone code - RBR rubber - 54 freq 'rubber - 1 freq robbery - 8 freq rubbery - 7 freq robber - 3 freq rubbir - 1 freq |
RUBBERY |
| Time to execute Levenshtein function - 0.193629 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.364356 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.029126 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.037125 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.000930 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. |