A markov chain text generator. This generator works by making relations between words that are in adjacement positions.
It tries to look for what word should come up after the currently generated word based on a chance distribution. The dificulty section is
how close the rewriting will be. The higher the dificulty the more coherent and close the output text will be to the input. It is
recomended to use the higher difficulties on long texts so the probability pool will be bigger.