| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bxypt (0) - 1 freq byt (2) - 4 freq biylt (2) - 3 freq egypt (2) - 27 freq keypt (2) - 1 freq bxp (2) - 1 freq qxypr (2) - 1 freq buy't (2) - 3 freq fiypt (2) - 1 freq crypt (2) - 2 freq blype (2) - 1 freq beylt (2) - 2 freq bylt (2) - 7 freq bxy (2) - 1 freq bbsit (3) - 1 freq begot (3) - 1 freq blyd (3) - 1 freq blaet (3) - 3 freq bap (3) - 16 freq gyet (3) - 1 freq byc (3) - 1 freq jimpt (3) - 1 freq boy (3) - 530 freq poppt (3) - 3 freq bxxgj (3) - 1 freq |
bxypt (0) - 1 freq bxp (3) - 1 freq boxt (4) - 1 freq bxy (4) - 1 freq bylt (4) - 7 freq bappit (4) - 1 freq bexit (4) - 1 freq abrupt (4) - 2 freq bampot (4) - 30 freq beylt (4) - 2 freq bumpit (4) - 4 freq boxset (4) - 2 freq byt (4) - 4 freq qxypr (4) - 1 freq blype (4) - 1 freq keypt (4) - 1 freq biylt (4) - 3 freq buy't (4) - 3 freq crypt (4) - 2 freq fiypt (4) - 1 freq egypt (4) - 27 freq dampt (5) - 3 freq boyata (5) - 1 freq bolt (5) - 43 freq nippt (5) - 5 freq |
SoundEx code - B213 bespattered - 1 freq box-bed - 2 freq backshift - 1 freq busybody - 1 freq book-shaped - 1 freq busy-buddies - 1 freq back-shift - 1 freq backaboot - 2 freq back-bowed - 1 freq backbeat - 1 freq backabootness - 1 freq boxbed - 2 freq basewbtcks - 1 freq baqqpfdq - 1 freq biggfaethebigg - 2 freq bhxkkvidpu - 1 freq bqfdmkdtgi - 1 freq bxypt - 1 freq |
MetaPhone code - BKSPT bxypt - 1 freq |
BXYPT |
| Time to execute Levenshtein function - 0.212859 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.380781 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.029572 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.038305 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.001017 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. |