| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| boozers (0) - 4 freq boozer (1) - 36 freq boozer's (1) - 1 freq boomers (1) - 1 freq boolers (1) - 1 freq bombers (2) - 7 freq dooters (2) - 2 freq hookers (2) - 2 freq boxers (2) - 1 freq booncers (2) - 2 freq boones (2) - 1 freq boomer (2) - 1 freq hooters (2) - 3 freq boolders (2) - 8 freq zoomers (2) - 2 freq brooders (2) - 1 freq bonkers (2) - 5 freq too'ers (2) - 1 freq boskers (2) - 2 freq hooers (2) - 2 freq dooners (2) - 2 freq boers (2) - 1 freq tooers (2) - 6 freq ooers (2) - 11 freq rozzers (2) - 1 freq |
boozers (0) - 4 freq boomers (2) - 1 freq boolers (2) - 1 freq boozer (2) - 36 freq boozer's (2) - 1 freq boaxers (3) - 2 freq boyzees (3) - 1 freq blazers (3) - 1 freq bowers (3) - 1 freq boers (3) - 1 freq boxers (3) - 1 freq bilers (4) - 1 freq beers (4) - 13 freq bearers (4) - 5 freq beaters (4) - 2 freq buzzes (4) - 6 freq bleers (4) - 1 freq bylers (4) - 2 freq bakers (4) - 24 freq wowzers (4) - 1 freq baters (4) - 2 freq coosers (4) - 1 freq sookers (4) - 2 freq brokers (4) - 2 freq oozes (4) - 3 freq |
SoundEx code - B262 buggers - 31 freq boxers - 1 freq baker's - 14 freq bikers - 2 freq beggar's - 3 freq bugger's - 6 freq boozers - 4 freq bakers - 24 freq bakers' - 3 freq bayker's - 1 freq beggars - 8 freq buggers' - 1 freq bowser's - 1 freq bucher's - 1 freq biggers - 9 freq boakregarde - 39 freq boakregardes - 1 freq begyar's - 1 freq buskers - 2 freq bicker's - 2 freq bazaars - 1 freq beggerey's - 1 freq backers - 2 freq biggars - 2 freq beakers - 1 freq bog-gress - 1 freq baegers - 1 freq boozer's - 1 freq beggers - 1 freq boaxers - 2 freq boucherhayes - 1 freq bbcchrismclaug - 2 freq bbcrsafternoons - 13 freq bbcsarahsmith - 1 freq boskers - 2 freq bbcarchive - 2 freq bakery's - 1 freq bjrx - 1 freq bjcruickshank - 8 freq bbckirstenc - 2 freq bfgyrgru - 1 freq bikerguy - 1 freq |
MetaPhone code - BSRS boozers - 4 freq bowser's - 1 freq bazaars - 1 freq boozer's - 1 freq |
BOOZERS |
| Time to execute Levenshtein function - 0.200532 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.510812 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.057750 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.043301 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.000870 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. |