{'fraction_non_alphanumeric': 0.013856812933025405, 'fraction_numerical': 0.0, 'mean_word_length': 5.382352941176471, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Simplified theory of Boolean functions

A new way of studying a boolean function using its parity spectrum is introduced. This new approach simplifies the classical concept of boolean difference, and serves to unify and extend many important results in series expansion, logic design and fault detection. Fundamental properties of the parity spectrum are established. They are instrumental in further development of the applications.