Using a large sample of English writing to determine the probability of the next letter following any given pair of letters, this post builds on the work of http://alandgraf.blogspot.ca/2013/01/text-decryption-using-mcmc.html?m=1  (also re-posted here http://www.r-bloggers.com/text-decryption-using-mcmc/ ) to solve cryptograms