Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bookshelf (0) - 8 freq bookshop (3) - 2 freq top-shelf (3) - 1 freq bombshell (3) - 3 freq beukshelfs (3) - 3 freq bookshelves (3) - 1 freq oorseels (4) - 2 freq book-shelves (4) - 3 freq books (4) - 243 freq borthel (4) - 1 freq oorsel (4) - 10 freq bookie's (4) - 12 freq coonselt (4) - 1 freq bookish (4) - 1 freq coorsely (4) - 1 freq boswell (4) - 3 freq bookie (4) - 25 freq toolshed (4) - 1 freq loosely (4) - 4 freq bookseller (4) - 2 freq bushels (4) - 1 freq yourself (4) - 42 freq hooshed (4) - 1 freq oneself (4) - 1 freq shelf (4) - 77 freq |
bookshelf (0) - 8 freq beukshelfs (4) - 3 freq bookshop (5) - 2 freq bookshelves (5) - 1 freq buikskelfs (6) - 1 freq bookseller (6) - 2 freq bookish (6) - 1 freq bushel (6) - 5 freq bushels (6) - 1 freq shelf (6) - 77 freq bombshell (6) - 3 freq top-shelf (6) - 1 freq beukshop (7) - 2 freq books' (7) - 1 freq bulksheid (7) - 1 freq breeshle (7) - 3 freq brothel (7) - 2 freq buckshee (7) - 3 freq behalf (7) - 18 freq booklet (7) - 5 freq oneself (7) - 1 freq bookies (7) - 25 freq brouselt (7) - 1 freq buikshop (7) - 1 freq boswell (7) - 3 freq |
SoundEx code - B241 book-shelves - 3 freq beukshelfs - 3 freq backslappin - 1 freq buik-shelves - 1 freq bookshelf - 8 freq bookshelves - 1 freq buikskelfs - 1 freq bookshelfahint - 1 freq bclbzny - 1 freq bbcholbycity - 1 freq bbcalba - 2 freq bbclbicker - 1 freq |
MetaPhone code - BKXLF bookshelf - 8 freq |
BOOKSHELF book - 504 freq buik - 399 freq beuk - 108 freq books - 243 freq booked - 31 freq bookie - 25 freq bookies - 25 freq bookbug - 13 freq bookshelf - 8 freq booking - 5 freq bookie's - 12 freq booklet - 5 freq bookin - 5 freq bookit - 3 freq bookshop - 2 freq bookings - 2 freq book's - 2 freq bookbug - 13 freq bookcase - 2 freq buiks - 161 freq buik's - 9 freq buikie - 10 freq buik-lear - 2 freq buik-shops - 2 freq beuks - 54 freq beukie - 7 freq beukstores - 2 freq beukit - 3 freq |
Time to execute Levenshtein function - 0.297174 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.393755 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.035417 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.044698 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.001033 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. |