I am studying the article at the following link,
Which applies Monte Carlo analysis to a decryption problem. The math is admittedly over my head at this point but I believe I understand the basics.
The goal is to compute a 'plausibility' (scalar) value, I think, that represents how close a decoded message is to making sense in English. The benchmark is defined by a 2-dimensional matrix that represents the frequency that characters occur together in a string of english language.
Is there a method using the dot-product of two matrices that produces a measurement of similarity between those two matrices on a scale of 0 - 1?
(The relevant function is on the first page of the pdf I linked).