{'fraction_non_alphanumeric': 0.025623268698060944, 'fraction_numerical': 0.0, 'mean_word_length': 4.734126984126984, '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}}
An Intrinsically Universal Family of Signal Machines

Signal machines form an abstract and perfect model of collision computing as well as particle/signal/soliton dynamics in cellular automata based on dimensionless signals on a line. Each signal move at constant speed (according to its nature). When signals meet they get replaced by other signals. A signal machine defines the kind of signals available, their speeds and the rules for replacement. 
Given any finite set of speeds S, we prove that there exists a signal machine able to simulate any signal machine whose speeds belong to S. Each signal is simulated by a large macro-signal (ray of parallel signals inside a support zone). Each macro-signal has a main signal located exactly where the simulated signal would be and encodes its id and the rules of the simulated machine. 
The simulation of a collision (macro-collision) consists of two phases. In the first phase, macro-signals are shrunk-to get some delay-then involved macro-signals are identified and it is ensured that no other macro-signal is too close. If not, the process is aborted and the relative distance between shrunk macro-signals was enlarge so that the correct macro-collision will eventually be initiated. Otherwise, the second phase starts: the appropriate rule is found and new macro-signals are generated accordingly. 
Varying the set of speeds generates an intrinsically universal family of signal machines.