Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bejewel (0) - 1 freq jewel (2) - 19 freq 'enewed (3) - 1 freq sewel (3) - 1 freq jewels (3) - 20 freq brewer (3) - 1 freq eesel (3) - 1 freq befell (3) - 2 freq bedeen (3) - 1 freq peewee (3) - 1 freq beremeal (3) - 1 freq deesel (3) - 8 freq behere (3) - 2 freq beese (3) - 5 freq jowel (3) - 3 freq meesel (3) - 2 freq 'jewels (3) - 1 freq bensel (3) - 1 freq beleve (3) - 6 freq beemer (3) - 2 freq brewed (3) - 6 freq bebeve (3) - 1 freq jezebel (3) - 2 freq beleted (3) - 1 freq beween (3) - 1 freq |
bejewel (0) - 1 freq jewel (3) - 19 freq bowel (4) - 16 freq jowel (4) - 3 freq renewal (5) - 4 freq beween (5) - 1 freq bjawk (5) - 1 freq brewed (5) - 6 freq bowl (5) - 73 freq beremael (5) - 1 freq boxieweel (5) - 1 freq bowil (5) - 1 freq bawl (5) - 4 freq bee'll (5) - 2 freq bensel (5) - 1 freq weeel (5) - 3 freq jeel (5) - 7 freq beltel (5) - 4 freq brawl (5) - 1 freq beremeal (5) - 1 freq sewel (5) - 1 freq jewels (5) - 20 freq brewer (5) - 1 freq befell (5) - 2 freq 'jewels (5) - 1 freq |
SoundEx code - B240 bachle - 1 freq bauchle - 26 freq bogle - 45 freq boays'll - 1 freq bogle' - 1 freq bussell - 1 freq beguile - 6 freq boys'll - 1 freq buckle - 12 freq boag-owl - 1 freq bos'll - 1 freq bugle - 2 freq busily - 6 freq bigly - 2 freq back-alley - 1 freq bauchlie - 1 freq bushel - 5 freq buzzle - 1 freq bachly - 1 freq boysoul - 1 freq bag'll - 1 freq beagle - 2 freq basil - 2 freq boggle - 1 freq bugil - 1 freq bauchly - 1 freq bejewel - 1 freq bauchil - 3 freq bsl - 22 freq bogil - 4 freq boogaloo - 1 freq boswell - 3 freq booglie - 1 freq boxieweel - 1 freq baigle - 1 freq boag-hole - 1 freq begley - 3 freq buswell - 1 freq bbckile - 1 freq bpklw - 1 freq 'bsl - 1 freq bosilla - 1 freq beccsley - 1 freq 'bauchle' - 1 freq |
MetaPhone code - BJWL bejewel - 1 freq |
BEJEWEL |
Time to execute Levenshtein function - 0.316063 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.397540 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.030397 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.038269 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.000913 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. |