| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| binfire (0) - 1 freq bonfire (1) - 28 freq binkie (2) - 1 freq banefire (2) - 3 freq infirm (2) - 2 freq bifore (2) - 2 freq bindie (2) - 1 freq gunfire (2) - 3 freq bonefire (2) - 1 freq bonfires (2) - 8 freq windie (3) - 4 freq banffie (3) - 2 freq binkin (3) - 1 freq binnian (3) - 2 freq inite (3) - 6 freq confide (3) - 4 freq mintie (3) - 51 freq cintre (3) - 3 freq binort (3) - 1 freq ainlie (3) - 138 freq linford (3) - 1 freq benefice (3) - 1 freq infers (3) - 1 freq €œfire (3) - 2 freq bine (3) - 11 freq |
binfire (0) - 1 freq bonfire (1) - 28 freq bonefire (2) - 1 freq banefire (2) - 3 freq gunfire (3) - 3 freq bifore (3) - 2 freq bonfires (3) - 8 freq fanfare (4) - 6 freq befare (4) - 2 freq before (4) - 567 freq aboynefire (4) - 1 freq infer (4) - 1 freq binner (4) - 2 freq binary (4) - 4 freq pinafore (4) - 1 freq befaire (4) - 4 freq openfire (4) - 1 freq benfica (4) - 1 freq infur (4) - 1 freq gunfre (4) - 1 freq binder (4) - 23 freq infor (4) - 1 freq infirm (4) - 2 freq binkie (4) - 1 freq benefice (4) - 1 freq |
SoundEx code - B516 bombers - 7 freq bonfires - 8 freq bonfire - 28 freq banefire - 3 freq bumper - 4 freq bonnieburgh - 9 freq bonaparte - 2 freq bambrick - 1 freq bumper's - 1 freq 'bombardment - 1 freq bomber's - 1 freq bombardments - 1 freq bombardment - 1 freq bonefire - 1 freq bonaparty - 1 freq bomber - 3 freq bonfrost - 1 freq bombards - 1 freq bumbard - 1 freq bonnybrig - 1 freq bamber - 2 freq bonfire-bit - 1 freq bombardit - 1 freq binfire - 1 freq beanieforindy - 1 freq |
MetaPhone code - BNFR bonfire - 28 freq banefire - 3 freq bonefire - 1 freq binfire - 1 freq |
BINFIRE |
| Time to execute Levenshtein function - 0.202928 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.406796 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.027387 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.037066 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.000867 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. |