How to verify most appropriate cleartext? So basically I was implementing a decryption tool (just for fun) and the first encryption logic I decided to implement was Caesar Cipher. So if I  have the input as cvggbmp and I have to find what the cleartext is, I would pass this through the decrypt function 26 times. I get 26 outputs. Is there some way I match each of these outputs against a words.txt for like legible word density and then display the output with the most number of legible words ? Or is there a better optimized way to do this ?
A simple approach is to do char gram frequencies.
There are readily downloadable dictionaries of char-gram frequencies.
You can lookup each set of consecutive characters of the requested length and multiply the probabilities.
For numerical reasons you don't actually multiply probabilities but sum the logarithms. You probably want to use some minimal frequency to prevent multiplying be zero.