| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rabbit-holl (0) - 3 freq rabbit-hol (1) - 4 freq rabbit-hole (1) - 9 freq rabbit-horn (2) - 1 freq rat-holl (3) - 1 freq rat-hole (4) - 3 freq rat-hol (4) - 1 freq rabbit-hole-an (4) - 1 freq rubbit-oot (4) - 1 freq rabbitaway (5) - 1 freq hydie-holl (5) - 1 freq rabbit' (5) - 5 freq ratton-hole (5) - 1 freq rabbit (5) - 499 freq atholl (5) - 1 freq crabbit-wye (5) - 1 freq wabbit-lke (5) - 1 freq rabbits (5) - 29 freq crabbit-like (5) - 3 freq raip-haul (5) - 1 freq hidie-holl (5) - 1 freq rabbit's (5) - 31 freq abbeyhill (5) - 1 freq wabbitly (5) - 2 freq crabbitly (5) - 12 freq |
rabbit-holl (0) - 3 freq rabbit-hole (2) - 9 freq rabbit-hol (2) - 4 freq rabbit-horn (4) - 1 freq rat-holl (5) - 1 freq rabbit-hole-an (6) - 1 freq rabbitheadal (7) - 1 freq rubbit-oot (7) - 1 freq rat-hole (7) - 3 freq rat-hol (7) - 1 freq hert-holl (8) - 5 freq wabbit-lke (8) - 1 freq wabbit-like (8) - 2 freq bolt-hole (8) - 1 freq crabbit-like (8) - 3 freq abbeyhill (8) - 1 freq boat-holes (9) - 1 freq cabbitch (9) - 3 freq earls-hall (9) - 1 freq earl-o-hell (9) - 1 freq crabbitly (9) - 12 freq robmarshall (9) - 6 freq rabbit's- (9) - 2 freq anti-poll (9) - 1 freq rabbitin (9) - 2 freq |
SoundEx code - R134 revitalisin - 4 freq rabbit-hole - 9 freq rapidly - 17 freq refettle - 1 freq rabbit-hole-an - 1 freq rabbit-hol - 4 freq rabbit-holl - 3 freq reptile - 1 freq rebuttal - 1 freq robdelaney - 1 freq |
MetaPhone code - RBTHL rabbit-hole - 9 freq rabbit-hol - 4 freq rabbit-holl - 3 freq |
RABBIT-HOLL |
| Time to execute Levenshtein function - 0.200152 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.359424 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.026687 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.036774 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.000850 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. |