Markov Chain Fun

Markov Chain Fun uses markov chains to restructure text into something that’s reminiscent but wholly different than the input by breaking the input up into chunks, analyzing it, and trying to reconstruct it by guessing what comes after what based on probability. The result is writing that makes sense if taken in 3 or 4 word chunks, but entirely bizarre as a whole. It’s similar to the Dissociated press and Mark V Shaney.

Input Text:

Chain Length: Longer chains (five or more) result in output closer to the input at the risk of being too repetitive, whereas shorter chains tend to get pretty crazy and create a lot of nonsense words
Generate Length: