| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bookboost (0) - 1 freq bookbugs (3) - 1 freq cookbooks (3) - 2 freq look-oot (3) - 5 freq lookoot (3) - 1 freq cookbook (3) - 7 freq bookings (4) - 2 freq blakoot (4) - 1 freq cooboys (4) - 4 freq workbook (4) - 1 freq bookcase (4) - 2 freq books' (4) - 1 freq bookshop (4) - 2 freq booklet (4) - 5 freq bookbug (4) - 13 freq cookoo (4) - 1 freq backhoose (4) - 2 freq doocoot (4) - 1 freq ooooft (4) - 1 freq bonfrost (4) - 1 freq boost (4) - 21 freq books (4) - 245 freq jackboot (4) - 1 freq bookt (4) - 3 freq lookdoon (4) - 1 freq |
bookboost (0) - 1 freq bookbugs (5) - 1 freq bookt (6) - 3 freq bookit (6) - 3 freq bookies (6) - 25 freq bakst (6) - 1 freq boost (6) - 21 freq bookbairn (6) - 2 freq boobs (6) - 7 freq backaboot (6) - 2 freq book's (6) - 2 freq bookie's (6) - 12 freq bookbug (6) - 13 freq bookish (6) - 1 freq books (6) - 245 freq bookcase (6) - 2 freq cookbook (6) - 7 freq booklet (6) - 5 freq books' (6) - 1 freq lookoot (6) - 1 freq look-oot (6) - 5 freq cookbooks (6) - 2 freq bobcat (7) - 5 freq pokiest (7) - 1 freq boaks (7) - 3 freq |
SoundEx code - B212 b'spikken - 1 freq buckfast - 12 freq bus-pass - 2 freq bespak - 1 freq bishops - 8 freq baggv's - 2 freq bespectacled - 1 freq backpack - 5 freq bishop's - 2 freq bookface - 1 freq 'bookface' - 1 freq buckfast's - 1 freq 'buckfast - 1 freq biceps - 6 freq bakebook - 2 freq back-pouch - 1 freq backpacker - 3 freq backpacker's - 1 freq buik-shops - 2 freq bespeak - 1 freq bookbug - 13 freq bischoppis - 1 freq backpacking - 1 freq backpacks - 1 freq bespoke - 2 freq €œbish-bosh - 1 freq backpackin - 1 freq boke-poke - 1 freq bazzabck - 6 freq bbcevex - 1 freq byqyfzs - 1 freq bsgxifokjl - 1 freq bigbosies - 1 freq bbukvpxn - 1 freq 'bookbug' - 2 freq byzqpgt - 1 freq bczvshihvq - 1 freq bookbugs - 1 freq bjipsq - 1 freq bkbwq - 1 freq bookboost - 1 freq |
MetaPhone code - BKBST bookboost - 1 freq |
BOOKBOOST |
| Time to execute Levenshtein function - 0.232417 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.359114 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.027322 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.037724 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.000882 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. |