Spam Detection N Gram Model on word and character level similar to Language Identification by applying Bayes Rule argmaxc∈{ spam, ham }(P(c∣m))argmaxc∈{ spam, ham }(P(m∣c)P(c))\underset{c \in\{\text { spam, ham }\}}{\operatorname{argmax}}(P(\boldsymbol{c} \mid \boldsymbol{m})) \underset{\boldsymbol{c} \in\{\text { spam, ham }\}}{\operatorname{argmax}}(P(\boldsymbol{m} \mid \boldsymbol{c}) P(\boldsymbol{c}))c∈{ spam, ham }argmax(P(c∣m))c∈{ spam, ham }argmax(P(m∣c)P(c))