| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| boffins (0) - 3 freq boffin (1) - 2 freq coffins (1) - 6 freq daffins (2) - 1 freq coffin (2) - 67 freq coffins' (2) - 2 freq baffies (2) - 21 freq boppins (2) - 1 freq doffin (2) - 2 freq boomins (2) - 1 freq coffin's (2) - 1 freq baffin (2) - 1 freq buffin' (2) - 1 freq offin (2) - 20 freq soffin (2) - 1 freq puffins (2) - 5 freq 'boffin' (2) - 1 freq offies (2) - 1 freq boufin (2) - 3 freq bowfin' (2) - 1 freq offing (2) - 1 freq bowfin (2) - 28 freq bowffin (2) - 1 freq bouffin (2) - 1 freq skiffins (3) - 2 freq |
boffins (0) - 3 freq coffins (2) - 6 freq boffin (2) - 2 freq puffins (3) - 5 freq bouffin (3) - 1 freq buffin' (3) - 1 freq baffin (3) - 1 freq baffies (3) - 21 freq daffins (3) - 1 freq offing (4) - 1 freq bowfin (4) - 28 freq affens (4) - 8 freq buffs (4) - 4 freq baffles (4) - 1 freq sauffins (4) - 1 freq baffie's (4) - 5 freq offense (4) - 1 freq bowfin' (4) - 1 freq buffers (4) - 1 freq bowffin (4) - 1 freq boppins (4) - 1 freq doffin (4) - 2 freq coffin (4) - 67 freq boufin (4) - 3 freq boomins (4) - 1 freq |
SoundEx code - B152 behaving - 4 freq bevvying - 1 freq bio-weapons - 1 freq boffins - 3 freq beeping - 1 freq bubonic - 1 freq booboomcculloch - 1 freq biffemojis - 1 freq boppins - 1 freq |
MetaPhone code - BFNS boffins - 3 freq |
BOFFINS |
| Time to execute Levenshtein function - 0.235417 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.430284 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.035223 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.038437 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.001151 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. |