| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bespattered (0) - 1 freq spattered (2) - 3 freq scattered (3) - 25 freq spaltered (3) - 1 freq shattered (3) - 24 freq blattered (3) - 6 freq pattered (3) - 1 freq smattered (3) - 3 freq sputtered (3) - 1 freq bettered (3) - 4 freq splattered (3) - 15 freq battered (3) - 37 freq deescattered (3) - 1 freq besotted (4) - 3 freq pestered (4) - 1 freq cattered (4) - 2 freq battened (4) - 2 freq nattered (4) - 1 freq skittered (4) - 10 freq leathered (4) - 4 freq shaittered (4) - 2 freq festered (4) - 3 freq buttered (4) - 19 freq heathered (4) - 1 freq bathered (4) - 8 freq |
bespattered (0) - 1 freq spattered (3) - 3 freq sputtered (4) - 1 freq bettered (5) - 4 freq deescattered (5) - 1 freq smattered (5) - 3 freq battered (5) - 37 freq splattered (5) - 15 freq pattered (5) - 1 freq scattered (5) - 25 freq shattered (5) - 24 freq spaltered (5) - 1 freq blattered (5) - 6 freq spluttered (6) - 5 freq pottered (6) - 1 freq stuttered (6) - 1 freq shatterd (6) - 1 freq sottered (6) - 1 freq squattered (6) - 1 freq paittered (6) - 1 freq slittered (6) - 3 freq shuttered (6) - 2 freq stottered (6) - 3 freq buttered (6) - 19 freq scaittered (6) - 2 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 - BSPTRT bespattered - 1 freq |
BESPATTERED |
| Time to execute Levenshtein function - 0.226875 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.381174 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.027512 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.037545 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.000854 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. |