A Markov chain is trained to count how often bigrams, a combination of two letters pairs, occur in natural text. Based on the probability that certain letters appear next to each other in natural text, an algorithm evaluates whether text can be classified as either gibberish or not. For example, a sentence like 'The dog ate its cake' is considered natural, but text like 'asdfg' is not.
is_gibberish
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.