| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bonefire (0) - 1 freq banefire (1) - 3 freq bonfire (1) - 28 freq binfire (2) - 1 freq benefice (2) - 1 freq aboynefire (2) - 1 freq bonfires (2) - 8 freq bonxie (3) - 8 freq backfire (3) - 1 freq bondie (3) - 3 freq bonilie (3) - 1 freq banffie (3) - 2 freq conspire (3) - 2 freq benefit (3) - 73 freq befare (3) - 2 freq benefited (3) - 2 freq openfire (3) - 1 freq befaire (3) - 4 freq nefife (3) - 1 freq beefie (3) - 1 freq bontine (3) - 2 freq before (3) - 567 freq donegore (3) - 3 freq surefire (3) - 1 freq confirm (3) - 17 freq |
bonefire (0) - 1 freq bonfire (1) - 28 freq banefire (1) - 3 freq aboynefire (2) - 1 freq binfire (2) - 1 freq benefice (3) - 1 freq bonfires (3) - 8 freq openfire (4) - 1 freq befaire (4) - 4 freq gunfire (4) - 3 freq benefit (4) - 73 freq before (4) - 567 freq befare (4) - 2 freq banffie (4) - 2 freq bifore (5) - 2 freq bandeira (5) - 1 freq gunfre (5) - 1 freq bowfer (5) - 2 freq confer (5) - 1 freq bynear (5) - 2 freq banefed (5) - 2 freq banoffee (5) - 1 freq pinafore (5) - 1 freq oonfair (5) - 1 freq benefits (5) - 55 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 |
BONEFIRE |
| Time to execute Levenshtein function - 0.309160 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.476891 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.027678 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.042484 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.000890 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. |