| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| book-shaped (0) - 1 freq cube-shaped (4) - 1 freq bookshop (4) - 2 freq re-shaped (4) - 1 freq roon-shapit (4) - 1 freq tube-shaped (4) - 1 freq hert-shaped (4) - 1 freq book-shelves (4) - 3 freq pear-shaped (4) - 2 freq tree-shaped (4) - 1 freq bold-faced (5) - 1 freq blood-stained (5) - 1 freq pool-she (5) - 3 freq toolshed (5) - 1 freq boneshaker (5) - 1 freq queershaped (5) - 1 freq ship-shape (5) - 1 freq bomb-shards (5) - 1 freq oot-tapped (5) - 1 freq bookcase (5) - 2 freq coal-shade (5) - 1 freq pig-shape (5) - 1 freq rook-squawked (5) - 1 freq bookish (5) - 1 freq bookface (5) - 1 freq |
book-shaped (0) - 1 freq tube-shaped (6) - 1 freq buik-shops (6) - 2 freq tree-shaped (6) - 1 freq re-shaped (6) - 1 freq cube-shaped (6) - 1 freq bookshop (6) - 2 freq pear-shaped (6) - 2 freq queer-shaped (7) - 1 freq book-shelves (7) - 3 freq hert-shaped (7) - 1 freq roon-shapit (7) - 1 freq lilyshaped (8) - 1 freq heart-shaped (8) - 1 freq shaped (8) - 34 freq t-shape (8) - 1 freq bookshelf (8) - 8 freq bookish (8) - 1 freq beukshop (8) - 2 freq dug-shape (8) - 2 freq blak-haired (8) - 1 freq back-shoppie (8) - 1 freq funny-shaped (8) - 1 freq horse-shaeped (8) - 1 freq hairt-shaped (8) - 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 - BKXPT book-shaped - 1 freq |
BOOK-SHAPED |
| Time to execute Levenshtein function - 0.234489 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.547628 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.035492 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.046225 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.000935 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. |