| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| boxers (0) - 1 freq boxes (1) - 64 freq boxer (1) - 28 freq boaxers (1) - 2 freq boers (1) - 1 freq bowers (1) - 1 freq covers (2) - 51 freq beers (2) - 13 freq overs (2) - 2 freq bombers (2) - 7 freq bowes (2) - 1 freq bilers (2) - 1 freq bolero (2) - 2 freq goners (2) - 1 freq bakers (2) - 24 freq rogers (2) - 6 freq pouers (2) - 34 freq bodes (2) - 4 freq boness (2) - 3 freq box's (2) - 15 freq owers (2) - 2 freq rowers (2) - 3 freq voters (2) - 63 freq balers (2) - 1 freq blowers (2) - 1 freq |
boxers (0) - 1 freq boaxers (1) - 2 freq boers (2) - 1 freq bowers (2) - 1 freq boxer (2) - 28 freq boxes (2) - 64 freq baxters (3) - 4 freq biters (3) - 2 freq baters (3) - 2 freq bylers (3) - 2 freq balers (3) - 1 freq boxie's (3) - 1 freq breers (3) - 6 freq boaxer (3) - 2 freq boolers (3) - 1 freq bores (3) - 5 freq boxies (3) - 4 freq mixers (3) - 1 freq boars (3) - 3 freq bleers (3) - 1 freq boaxes (3) - 5 freq boozers (3) - 4 freq bikers (3) - 2 freq bilers (3) - 1 freq boreas (3) - 2 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 - BKSRS boxers - 1 freq boaxers - 2 freq |
BOXERS |
| Time to execute Levenshtein function - 0.212738 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.481758 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.060493 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.037481 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.000938 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. |