| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| balbutt (0) - 8 freq garbutt (2) - 1 freq aa-but (3) - 1 freq rambust (3) - 1 freq albert (3) - 25 freq b-but (3) - 3 freq barbt (3) - 1 freq barnett (3) - 1 freq walnut (3) - 11 freq ballot (3) - 10 freq barrett (3) - 1 freq albus (3) - 4 freq abut (3) - 1 freq walnuts (3) - 6 freq bambuco (3) - 2 freq abott (3) - 2 freq basturt (3) - 17 freq 'albert (3) - 1 freq batt (3) - 1 freq bloust (3) - 1 freq kacnutt (3) - 1 freq ballest (3) - 3 freq blout (3) - 1 freq banquet (3) - 7 freq babbit (3) - 2 freq |
balbutt (0) - 8 freq blatt (4) - 2 freq garbutt (4) - 1 freq bluto (5) - 1 freq balboa (5) - 1 freq blurt (5) - 1 freq albeit (5) - 6 freq ballant (5) - 11 freq halbert (5) - 2 freq bassett (5) - 1 freq ballet (5) - 4 freq ballats (5) - 1 freq talbotu (5) - 1 freq talbot (5) - 4 freq halibut (5) - 5 freq calcutta (5) - 5 freq ballat (5) - 1 freq blottit (5) - 1 freq blastit (5) - 9 freq blabbit (5) - 1 freq blotto (5) - 1 freq bultit (5) - 1 freq blurtet (5) - 3 freq boltit (5) - 4 freq boltet (5) - 1 freq |
SoundEx code - B413 beloved - 25 freq believe't - 4 freq believed - 49 freq belovit - 5 freq believt - 1 freq bluffed - 1 freq bloviation - 1 freq bluebottle - 8 freq bluebottle's - 4 freq bluebottles - 3 freq believ't - 1 freq beluvit - 7 freq beluved - 1 freq bileeved - 1 freq bowl-fitted - 1 freq baeloved - 1 freq baelieved - 1 freq believit - 3 freq bull-bait - 2 freq bull-bate - 3 freq bull-bait's - 2 freq blabbit - 1 freq belly-button - 1 freq belevit - 1 freq beleved - 2 freq blue-bottle - 1 freq believet - 1 freq bloviate - 1 freq balbutt - 8 freq belouvit - 1 freq bull-beat - 2 freq belabedboots - 4 freq blipped - 1 freq |
MetaPhone code - BLBT bull-bait - 2 freq bull-bate - 3 freq blabbit - 1 freq balbutt - 8 freq bull-beat - 2 freq |
BALBUTT |
| Time to execute Levenshtein function - 0.299182 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.557097 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.028272 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.075860 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.001052 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. |