| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| baxter (0) - 16 freq banter (1) - 43 freq batter (1) - 74 freq bixter (1) - 1 freq maxter (1) - 5 freq baxters (1) - 4 freq barter (1) - 3 freq maxtur (2) - 1 freq balder (2) - 1 freq bitter (2) - 112 freq bator (2) - 1 freq faster (2) - 77 freq baitur (2) - 4 freq bather (2) - 59 freq baxter's (2) - 6 freq waater (2) - 34 freq baters (2) - 2 freq badger (2) - 6 freq dexter (2) - 4 freq farter (2) - 1 freq hatter (2) - 279 freq barker (2) - 1 freq baiker (2) - 1 freq lafter (2) - 1 freq baiters (2) - 2 freq |
baxter (0) - 16 freq bixter (1) - 1 freq barter (2) - 3 freq maxter (2) - 5 freq baxters (2) - 4 freq banter (2) - 43 freq batter (2) - 74 freq battery (3) - 25 freq dexter (3) - 4 freq biter (3) - 1 freq baitter (3) - 1 freq better (3) - 1704 freq oxter (3) - 45 freq beater (3) - 11 freq beter (3) - 1 freq bunter (3) - 8 freq buster (3) - 2 freq bator (3) - 1 freq bitter (3) - 112 freq mixter (3) - 31 freq maxtur (3) - 1 freq butter (3) - 134 freq baitur (3) - 4 freq battur (3) - 1 freq boxer (3) - 28 freq |
SoundEx code - B236 besturt - 1 freq bastarn - 16 freq bastart - 67 freq bastard - 102 freq basturt - 17 freq backdrop - 3 freq bastardin - 3 freq basturts - 4 freq bastert - 9 freq bastards - 33 freq 'bastard - 1 freq bastard' - 1 freq bastart's - 3 freq 'bastart - 1 freq bowster - 12 freq baxter - 16 freq booster - 3 freq back-treckit - 1 freq bastarts - 24 freq boisterous - 3 freq backstroke - 2 freq bigotry - 9 freq backstreets - 1 freq bastard's - 1 freq bestirs - 2 freq bus-drivers - 2 freq basturds - 1 freq basturd - 2 freq bacteria - 4 freq backdoor - 2 freq boys-a-dear - 1 freq bestrides - 1 freq 'bastart' - 1 freq 'backstairs - 1 freq buster - 2 freq back-door - 2 freq beukstores - 2 freq bestrewed - 1 freq baxters - 4 freq baxter's - 6 freq back-stair - 1 freq backthrawn - 1 freq box-trap - 2 freq bistro - 1 freq bowsters - 2 freq bowsterous - 2 freq bastirt - 1 freq bastirts - 1 freq backwater - 1 freq bousterous - 1 freq bouster - 1 freq backdoors - 1 freq busters - 1 freq bestiary - 1 freq bacterium - 1 freq backstreet - 1 freq €˜bastardised - 1 freq biscuit-ersed - 1 freq €˜bastart - 1 freq backdrap - 1 freq back-sitter - 1 freq backdraps - 2 freq €œbastart - 1 freq bastardisation - 1 freq bastern - 2 freq back-draw - 1 freq backtracked - 1 freq bowsterously - 1 freq bixter - 1 freq backwatter - 1 freq bbcthearchers - 1 freq boysadear - 1 freq bocktherobber - 1 freq bastardization - 1 freq bbcweather - 3 freq bbcwthrwatchers - 1 freq backdoorboris - 1 freq bastard” - 1 freq bacteriologist - 1 freq bbctravelscot - 1 freq bigder - 7 freq |
MetaPhone code - BKSTR baxter - 16 freq back-stair - 1 freq back-sitter - 1 freq bixter - 1 freq |
BAXTER |
| Time to execute Levenshtein function - 0.193683 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.348293 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.028046 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.037692 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.000926 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. |