| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rubbitin (0) - 1 freq rabbitin (1) - 2 freq rubbits' (2) - 1 freq ruitin (2) - 2 freq rubbit's (2) - 2 freq rubbin (2) - 50 freq rubbits (2) - 14 freq rubbit (2) - 49 freq rubicon (3) - 3 freq buffitin (3) - 1 freq ruisin (3) - 2 freq hubberin (3) - 1 freq rabbit' (3) - 5 freq rumblin (3) - 12 freq baitin (3) - 1 freq rabbit's (3) - 31 freq recitin (3) - 7 freq rabbit (3) - 499 freq ruitit (3) - 7 freq rubbish (3) - 69 freq ribbin (3) - 2 freq reunitin (3) - 1 freq ruifin (3) - 2 freq crubbit (3) - 7 freq ruistin (3) - 1 freq |
rubbitin (0) - 1 freq rabbitin (1) - 2 freq rubbits (3) - 14 freq rubbit (3) - 49 freq rubbin (3) - 50 freq rabbit (4) - 499 freq orbitin (4) - 1 freq ribbin (4) - 2 freq robbin (4) - 6 freq robbit (4) - 2 freq rabbits (4) - 29 freq rabbit' (4) - 5 freq ruitin (4) - 2 freq rubbits' (4) - 1 freq rubbit's (4) - 2 freq rubban (4) - 3 freq ribbon (5) - 21 freq bubblin (5) - 29 freq ruttin (5) - 1 freq orbitan (5) - 2 freq rubbir (5) - 1 freq bitin (5) - 27 freq dubbin (5) - 1 freq rubbing (5) - 3 freq erabbit (5) - 1 freq |
SoundEx code - R135 repeatin - 24 freq riftin - 6 freq repeatin' - 1 freq repeatan - 3 freq rubbitin - 1 freq rabbitin - 2 freq repeating - 2 freq |
MetaPhone code - RBTN rubbitin - 1 freq rabbitin - 2 freq |
RUBBITIN |
| Time to execute Levenshtein function - 0.214889 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.399486 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.029463 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.038875 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.000877 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. |