| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bazzabck (0) - 6 freq wuzzack (3) - 1 freq balzac (3) - 1 freq barack (3) - 2 freq barracks (4) - 9 freq anzacs (4) - 1 freq gazzah (4) - 3 freq attack (4) - 79 freq baank (4) - 1 freq bizzare (4) - 1 freq gazza (4) - 3 freq bizzard (4) - 1 freq salabbk (4) - 1 freq atrack (4) - 1 freq baaackk (4) - 1 freq baobabs (4) - 15 freq baobab (4) - 5 freq bizzan (4) - 1 freq bazaar' (4) - 1 freq mazza (4) - 1 freq bannacks (4) - 2 freq balance (4) - 53 freq bambrick (4) - 1 freq aback (4) - 41 freq bazaars (4) - 1 freq |
bazzabck (0) - 6 freq wuzzack (5) - 1 freq barack (6) - 2 freq balzac (6) - 1 freq buzzards (7) - 5 freq a-back (7) - 1 freq payback (7) - 1 freq barbarik (7) - 2 freq bannock (7) - 18 freq buzzard (7) - 3 freq blaick (7) - 2 freq bloack (7) - 4 freq backpack (7) - 5 freq bynack (7) - 1 freq snozack (7) - 3 freq back (7) - 6266 freq biteback (7) - 1 freq bamstick (7) - 4 freq fazziboy (7) - 4 freq brack (7) - 14 freq aback (7) - 41 freq binnack (7) - 2 freq black (7) - 758 freq bizzard (7) - 1 freq bizzare (7) - 1 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 - BSBK bazzabck - 6 freq |
BAZZABCK |
| Time to execute Levenshtein function - 0.298745 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.524723 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.063944 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.038176 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.000940 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. |