Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bastards (0) - 33 freq bastarts (1) - 24 freq bastard's (1) - 1 freq bastard (1) - 102 freq bastard' (1) - 1 freq basturds (1) - 1 freq bastart's (2) - 3 freq bastart (2) - 67 freq basturd (2) - 2 freq bastardin (2) - 3 freq 'bastard (2) - 1 freq bastirts (2) - 1 freq bakwards (2) - 2 freq bastarn (2) - 16 freq bastard” (2) - 1 freq eastwards (2) - 3 freq basturts (2) - 3 freq pastures (3) - 4 freq an'ards (3) - 1 freq baars (3) - 1 freq wasters (3) - 6 freq 'stands (3) - 1 freq bakward (3) - 2 freq stars (3) - 104 freq dotards (3) - 1 freq |
bastards (0) - 33 freq basturds (1) - 1 freq bastard' (2) - 1 freq bastard (2) - 102 freq bastarts (2) - 24 freq bastard's (2) - 1 freq bastirts (3) - 1 freq bastardin (3) - 3 freq basturts (3) - 3 freq basturd (3) - 2 freq busters (4) - 1 freq bestrides (4) - 1 freq bestirs (4) - 2 freq eastwards (4) - 3 freq bastart's (4) - 3 freq bastard” (4) - 1 freq bakwards (4) - 2 freq bastart (4) - 67 freq 'bastard (4) - 1 freq bastarn (4) - 16 freq star's (5) - 1 freq starts (5) - 156 freq batters (5) - 8 freq boards (5) - 23 freq bombards (5) - 1 freq |
SoundEx code - B236 besturt - 1 freq bastarn - 16 freq bastart - 67 freq bastard - 102 freq basturt - 16 freq backdrop - 1 freq bastardin - 3 freq basturts - 3 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 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 bigotry - 7 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 - BSTRTS basturts - 3 freq bastards - 33 freq bastart's - 3 freq bastarts - 24 freq bastard's - 1 freq basturds - 1 freq bestrides - 1 freq bastirts - 1 freq |
BASTARDS |
Time to execute Levenshtein function - 0.193692 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.338013 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.027855 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.037573 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.000890 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. |