| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rubbits (0) - 14 freq rubbit (1) - 49 freq rubbit's (1) - 2 freq rubbits' (1) - 1 freq rabbits (1) - 29 freq rubbir (2) - 1 freq gubbins (2) - 3 freq rubbin (2) - 50 freq crubbit (2) - 7 freq rabbit (2) - 499 freq rabbit's (2) - 31 freq rubbing (2) - 3 freq cubits (2) - 2 freq rubbish (2) - 69 freq ruits (2) - 43 freq rubbers (2) - 1 freq rabbit' (2) - 5 freq robbit (2) - 2 freq wubbits' (2) - 1 freq rubbitin (2) - 1 freq rubies (2) - 4 freq submits (2) - 1 freq rubbled (3) - 1 freq nubbie (3) - 1 freq ribbin (3) - 2 freq |
rubbits (0) - 14 freq rabbits (1) - 29 freq rubbit's (2) - 2 freq rubbit (2) - 49 freq rubbits' (2) - 1 freq rubbers (3) - 1 freq rabbit' (3) - 5 freq rubbitin (3) - 1 freq robbit (3) - 2 freq rabbit's (3) - 31 freq rabbit (3) - 499 freq erabbit (4) - 1 freq robbie's (4) - 5 freq robby's (4) - 1 freq roberts (4) - 1 freq rabbitin (4) - 2 freq robbers (4) - 7 freq orbits (4) - 1 freq rabbie's (4) - 5 freq robots (4) - 4 freq ribbons (4) - 33 freq robbys (4) - 1 freq rubies (4) - 4 freq rubbing (4) - 3 freq ribbans (4) - 1 freq |
SoundEx code - R132 rabbits - 29 freq rubbits - 14 freq rabbit's - 31 freq rafts - 3 freq rabbit-caught-in-a-set-aeheidlights - 1 freq repeatic - 1 freq rabbit's- - 2 freq repeats - 11 freq rifts - 6 freq rubbits' - 1 freq robots - 4 freq 'rabbit's - 3 freq robotic - 3 freq rapet's - 1 freq rubbit's - 2 freq robotik - 1 freq raifts - 1 freq rivets - 1 freq rapids - 1 freq rabdickson - 1 freq rbtkgsfa - 1 freq rpdzfctnuw - 1 freq |
MetaPhone code - RBTS rabbits - 29 freq rubbits - 14 freq rabbit's - 31 freq rabbit's- - 2 freq rubbits' - 1 freq robots - 4 freq 'rabbit's - 3 freq rubbit's - 2 freq |
RUBBITS |
| Time to execute Levenshtein function - 0.218247 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.388698 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.027363 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.037027 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.000873 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. |