| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rubber (0) - 54 freq robber (1) - 3 freq rubbir (1) - 1 freq 'rubber (1) - 1 freq hubber (1) - 1 freq rubbed (1) - 43 freq rubbery (1) - 7 freq rubbers (1) - 1 freq rubbert (1) - 2 freq ribben (2) - 1 freq uber (2) - 2 freq rugger (2) - 2 freq umber (2) - 2 freq rubbled (2) - 1 freq rubbit (2) - 49 freq rudder (2) - 4 freq ruther (2) - 3 freq ribbed (2) - 2 freq blubber (2) - 9 freq dobber (2) - 4 freq number (2) - 174 freq ruder (2) - 2 freq gubbed (2) - 10 freq lumber (2) - 5 freq robbed (2) - 16 freq |
rubber (0) - 54 freq rubbery (1) - 7 freq rubbir (1) - 1 freq robber (1) - 3 freq rubbers (2) - 1 freq robbery (2) - 8 freq rubbert (2) - 2 freq hubber (2) - 1 freq 'rubber (2) - 1 freq rubbed (2) - 43 freq dobber (3) - 4 freq robbed (3) - 16 freq rubble (3) - 7 freq rubbin (3) - 50 freq ribbed (3) - 2 freq jabber (3) - 4 freq rubban (3) - 3 freq robbers (3) - 7 freq dibber (3) - 2 freq rubbit (3) - 49 freq rubb (3) - 1 freq ribben (3) - 1 freq dabber (3) - 3 freq ribban (4) - 1 freq rabbit (4) - 499 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 |
RUBBER |
| Time to execute Levenshtein function - 0.285090 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.451378 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.027663 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.036918 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.000869 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. |