| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rabbitin (0) - 2 freq rubbitin (1) - 1 freq rabbit's (2) - 31 freq rabbits (2) - 29 freq rabbit (2) - 499 freq rabbit' (2) - 5 freq aitin (3) - 21 freq raelitie (3) - 2 freq raiblin (3) - 1 freq 'rabbit's (3) - 3 freq raitir (3) - 1 freq reunitin (3) - 1 freq rubbin (3) - 50 freq ramblin (3) - 4 freq rabbit's- (3) - 2 freq robbin (3) - 6 freq rabbie (3) - 65 freq orbitin (3) - 1 freq robbit (3) - 2 freq crabbitly (3) - 12 freq wabbin (3) - 1 freq bitin (3) - 27 freq nabblin (3) - 1 freq gabblin (3) - 4 freq nabbin (3) - 2 freq |
rabbitin (0) - 2 freq rubbitin (1) - 1 freq rabbit (3) - 499 freq rabbit' (3) - 5 freq rabbits (3) - 29 freq rubbin (4) - 50 freq robbit (4) - 2 freq rubbits (4) - 14 freq robbin (4) - 6 freq erabbit (4) - 1 freq orbitin (4) - 1 freq rubbit (4) - 49 freq rabbit's (4) - 31 freq ribbin (4) - 2 freq abettin (5) - 2 freq wabbitly (5) - 2 freq babbin (5) - 4 freq radiatin (5) - 3 freq rabhit (5) - 1 freq wabblin (5) - 5 freq dabbit (5) - 6 freq gabbit (5) - 3 freq dabbin (5) - 8 freq ribben (5) - 1 freq nabbit (5) - 2 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 |
RABBITIN |
| Time to execute Levenshtein function - 0.209332 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.334194 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.027012 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.037239 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.000903 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. |