| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| baffin (0) - 1 freq bafflin (1) - 1 freq faffin (1) - 1 freq affin (1) - 2 freq daffin (1) - 18 freq waffin (1) - 18 freq laffin (1) - 7 freq barfin (1) - 1 freq gaffin (1) - 5 freq baffie (1) - 62 freq boffin (1) - 2 freq haffi (2) - 3 freq baain (2) - 2 freq baldin (2) - 1 freq bowfin (2) - 28 freq bangin (2) - 41 freq baein (2) - 20 freq muffin (2) - 16 freq bayin (2) - 2 freq bachin (2) - 2 freq staffin (2) - 3 freq baitin (2) - 1 freq coffin (2) - 67 freq oaffir (2) - 5 freq bawiin (2) - 1 freq |
baffin (0) - 1 freq boffin (1) - 2 freq gaffin (2) - 5 freq baffie (2) - 62 freq faffin (2) - 1 freq bouffin (2) - 1 freq barfin (2) - 1 freq bafflin (2) - 1 freq laffin (2) - 7 freq daffin (2) - 18 freq affin (2) - 2 freq waffin (2) - 18 freq bowffin (3) - 1 freq buffin' (3) - 1 freq offin (3) - 20 freq fuffin (3) - 2 freq baffy (3) - 3 freq baffel (3) - 1 freq saffen (3) - 1 freq siffin (3) - 1 freq bluffin (3) - 1 freq effin (3) - 14 freq puffin (3) - 43 freq boufin (3) - 3 freq affen (3) - 118 freq |
SoundEx code - B150 bowfin - 28 freq boabbin - 1 freq babbin - 4 freq bevvyin - 5 freq bobbin - 22 freq buffoon - 1 freq bowfin' - 1 freq bevyin - 1 freq bobban - 2 freq behavin - 4 freq bewvyin - 1 freq 'bowfin - 1 freq buffin' - 1 freq 'boffin' - 1 freq bevvin - 1 freq bovine - 2 freq byaavin - 1 freq byaaven - 1 freq baffin - 1 freq beivin - 1 freq bebbin - 1 freq bouffin - 1 freq boffin - 2 freq bowffin - 1 freq boppin - 1 freq boufin - 3 freq beepin - 3 freq bobin - 1 freq baboon - 1 freq befawin - 1 freq boabin - 1 freq bob-on - 1 freq |
MetaPhone code - BFN bowfin - 28 freq buffoon - 1 freq bowfin' - 1 freq 'bowfin - 1 freq buffin' - 1 freq 'boffin' - 1 freq bevvin - 1 freq bovine - 2 freq baffin - 1 freq beivin - 1 freq bouffin - 1 freq boffin - 2 freq bowffin - 1 freq boufin - 3 freq bfn - 1 freq |
BAFFIN |
| Time to execute Levenshtein function - 0.184815 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.324150 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.027453 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.039262 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.004847 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. |