| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| boxer (0) - 28 freq boer (1) - 3 freq boxen (1) - 1 freq boxers (1) - 1 freq bower (1) - 10 freq boxed (1) - 7 freq boaxer (1) - 2 freq bouer (1) - 18 freq boxes (1) - 63 freq to'er (2) - 1 freq borr (2) - 1 freq cower (2) - 11 freq boke' (2) - 1 freq sooer (2) - 1 freq ber (2) - 4 freq brier (2) - 5 freq broker (2) - 1 freq bor (2) - 4 freq biler (2) - 8 freq boiler (2) - 4 freq bone (2) - 45 freq o'er (2) - 76 freq joker (2) - 7 freq aower (2) - 1 freq wooer (2) - 3 freq |
boxer (0) - 28 freq boaxer (1) - 2 freq boxes (2) - 63 freq boxed (2) - 7 freq bouer (2) - 18 freq bower (2) - 10 freq boxen (2) - 1 freq boer (2) - 3 freq boxers (2) - 1 freq boaxers (3) - 2 freq buyer (3) - 8 freq boxfu (3) - 1 freq boozer (3) - 36 freq breer (3) - 11 freq mixer (3) - 5 freq boxan (3) - 1 freq bucer (3) - 1 freq boar (3) - 20 freq bu'er (3) - 1 freq brer (3) - 2 freq beer (3) - 140 freq boex (3) - 1 freq beter (3) - 1 freq bore (3) - 42 freq boxies (3) - 4 freq |
SoundEx code - B260 bigger - 229 freq bugger - 141 freq boozer - 36 freq bucer - 1 freq bicker' - 1 freq beggar - 16 freq busier - 3 freq bakery - 16 freq boys're - 1 freq buzzer - 8 freq boxer - 28 freq biggar - 7 freq beaker - 6 freq buggeraa - 1 freq buggar - 1 freq bowser - 4 freq boaxer - 2 freq beezer - 11 freq bak-raa - 1 freq baker - 26 freq busker - 2 freq bucher - 1 freq bicker - 12 freq bïgger - 1 freq buggery - 10 freq bigger' - 1 freq beigger - 1 freq basker - 1 freq bizarre - 10 freq boksir - 1 freq bosker - 6 freq baager - 15 freq beshrew - 1 freq beeger - 6 freq bow-cheir - 3 freq bowsier - 1 freq bazaar' - 1 freq 'bugger - 2 freq buccar - 1 freq beggerey - 23 freq beggery - 1 freq baiker - 1 freq biker - 3 freq €œbugger - 1 freq bshara - 1 freq €œbizarre - 1 freq bfhskr - 1 freq bbcr - 1 freq byker - 1 freq bizzare - 1 freq |
MetaPhone code - BKSR boxer - 28 freq boaxer - 2 freq boksir - 1 freq bikesure - 1 freq |
BOXER |
| Time to execute Levenshtein function - 0.197731 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.356028 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.030058 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.040313 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.000881 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. |