Cryptography
The problem of distinguishing sense from nonsense is important in cryptography and other intelligence fields. For example, they need to distinguish signal from noise. Cryptanalysts have devised algorithms to determine whether a given text is in fact nonsense or not. These algorithms typically analyze the presence of repetitions and redundancy in a text; in meaningful texts, certain frequently used words—for example, the, is and and in a text in the English language—will recur. A random scattering of letters, punctuation marks and spaces will not exhibit these regularities. Zipf's law attempts to state this analysis mathematically. By contrast, cryptographers typically seek to make their cipher texts resemble random distributions, to avoid telltale repetitions and patterns which may give an opening for cryptanalysis.
It is harder for cryptographers to deal with the presence or absence of meaning in a text in which the level of redundancy and repetition is higher than found in natural languages (for example, in the mysterious text of the Voynich manuscript).
Read more about this topic: Nonsense