| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bath-rabbim (0) - 1 freq gash-gabbit (4) - 1 freq thrabbin (4) - 4 freq bathruim (4) - 1 freq bath-time (5) - 1 freq bathroom (5) - 43 freq barabbas (5) - 4 freq bane-stabbin (5) - 1 freq wahabbism (5) - 1 freq laungrabbin (5) - 2 freq batherin (5) - 5 freq throbbin (5) - 2 freq bahrain (5) - 1 freq yabb-yabbin (5) - 1 freq ati'rubbir (5) - 1 freq 'rabbit (6) - 2 freq thraplin (6) - 2 freq barbie (6) - 3 freq botabit (6) - 1 freq bethanie (6) - 2 freq throbban (6) - 2 freq thrangin (6) - 5 freq rabbie (6) - 63 freq babbie (6) - 34 freq bawhair (6) - 1 freq |
bath-rabbim (0) - 1 freq bathruim (7) - 1 freq thrabbin (7) - 4 freq bathroom (8) - 43 freq bath-time (8) - 1 freq throbbin (8) - 2 freq gash-gabbit (8) - 1 freq yabb-yabbin (9) - 1 freq ati'rubbir (9) - 1 freq throbban (9) - 2 freq batherin (9) - 5 freq barabbas (9) - 4 freq thrabs (10) - 1 freq bath-sponge (10) - 1 freq botherin (10) - 13 freq botham (10) - 1 freq anthroboi (10) - 1 freq bathir (10) - 2 freq bathered (10) - 8 freq bathroom's (10) - 1 freq throbin (10) - 1 freq thrab (10) - 2 freq thirablo (10) - 1 freq throbbing (10) - 3 freq bathroom-o (10) - 1 freq |
SoundEx code - B361 butterfly - 7 freq butterflees - 14 freq butterflee - 7 freq butterflies - 10 freq bath-rabbim - 1 freq better-hauf's - 2 freq butter-ba - 1 freq better-happit - 1 freq beau-ootrful - 1 freq butterflie - 2 freq buttherflees - 1 freq butterfleas - 4 freq butterflyandpig - 1 freq |
MetaPhone code - B0RBM bath-rabbim - 1 freq |
BATH-RABBIM |
| Time to execute Levenshtein function - 0.196124 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.371098 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.028201 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.036935 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.000796 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. |