| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| boxbed (0) - 2 freq box-bed (1) - 2 freq bobbed (1) - 1 freq bombed (1) - 7 freq boxed (1) - 7 freq bodied (2) - 2 freq brobbed (2) - 1 freq bored (2) - 48 freq bossed (2) - 6 freq bolted (2) - 19 freq gobbed (2) - 3 freq barbed (2) - 4 freq boxie (2) - 21 freq mobbed (2) - 6 freq jobbed (2) - 1 freq boxset (2) - 2 freq boxer (2) - 28 freq bowed (2) - 37 freq booled (2) - 2 freq bowled (2) - 1 freq sobbed (2) - 7 freq boued (2) - 22 freq bopped (2) - 1 freq bribed (2) - 3 freq boxies (2) - 4 freq |
boxbed (0) - 2 freq bombed (2) - 7 freq boxed (2) - 7 freq box-bed (2) - 2 freq bobbed (2) - 1 freq bribed (3) - 3 freq babbed (3) - 1 freq barbed (3) - 4 freq boomed (4) - 8 freq bombe (4) - 1 freq boaked (4) - 3 freq robbed (4) - 16 freq bouled (4) - 1 freq combed (4) - 3 freq lobbed (4) - 6 freq bothed (4) - 1 freq boxen (4) - 1 freq bowfed (4) - 1 freq bomber (4) - 3 freq booed (4) - 40 freq hotbed (4) - 2 freq boned (4) - 2 freq bairbed (4) - 1 freq bxb (4) - 1 freq bonxied (4) - 1 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 - BKSBT box-bed - 2 freq boxbed - 2 freq |
BOXBED |
| Time to execute Levenshtein function - 0.243342 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.422553 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.027698 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.038307 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. |