| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bxfb (0) - 1 freq bxb (1) - 1 freq bxp (2) - 1 freq xeb (2) - 1 freq bfu (2) - 1 freq bpub (2) - 1 freq b'nb (2) - 2 freq bbfa (2) - 1 freq bdfm (2) - 17 freq gfb (2) - 1 freq bfbs (2) - 1 freq yfb (2) - 1 freq bx (2) - 4 freq kxf (2) - 1 freq buft (2) - 1 freq aifb (2) - 1 freq bob (2) - 214 freq byrb (2) - 1 freq xb (2) - 3 freq bxy (2) - 1 freq boob (2) - 5 freq bukb (2) - 1 freq blob (2) - 4 freq bfk (2) - 1 freq byf (2) - 1 freq |
bxfb (0) - 1 freq bxb (2) - 1 freq boxfu (3) - 1 freq buff (4) - 15 freq bf (4) - 6 freq nxb (4) - 1 freq baf (4) - 1 freq bxs (4) - 2 freq bfn (4) - 1 freq xf (4) - 6 freq beeb (4) - 1 freq xfu (4) - 1 freq bsb (4) - 1 freq xnfb (4) - 1 freq xfbv (4) - 2 freq beb (4) - 1 freq bufw (4) - 1 freq bxqy (4) - 1 freq bdxtb (4) - 1 freq byfe (4) - 1 freq nfb (4) - 1 freq lxb (4) - 1 freq befa (4) - 2 freq bb (4) - 9 freq zxcb (4) - 1 freq |
SoundEx code - B210 bicep - 2 freq backup - 1 freq byzeeby - 3 freq beeeeeeeeceeeep - 1 freq basebaw - 4 freq bishop - 15 freq basebaa - 1 freq bookshop - 2 freq bashfu - 1 freq back-pey - 1 freq boxfu - 1 freq bags-up - 1 freq bee-skep - 2 freq base-baa - 1 freq beukshop - 2 freq buikshop - 1 freq boxfoo - 1 freq back-shoppie - 1 freq bak-fa - 1 freq beaucoup - 2 freq bvcskkebe - 1 freq bskkfv - 1 freq bxfb - 1 freq bukb - 1 freq bvjxb - 1 freq byohxbyi - 1 freq bsb - 1 freq bqkv - 1 freq bxp - 1 freq bkxb - 1 freq bagpie - 1 freq bugaboo - 1 freq bhxhv - 1 freq big-buy - 1 freq bxb - 1 freq bvkufffaoo - 1 freq bcp - 1 freq busby - 1 freq bjv - 1 freq |
MetaPhone code - BKSFB bxfb - 1 freq |
BXFB |
| Time to execute Levenshtein function - 0.365675 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.545316 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.063635 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.077937 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.000861 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. |