{'fraction_non_alphanumeric': 0.019120458891013385, 'fraction_numerical': 0.0, 'mean_word_length': 5.894736842105263, '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}}
Limits of logarithmic combinatorial structures

Under very mild conditions, we prove that the limiting behavior of the component counts in a decomposable logarithmic combinatorial structure conforms to a single, unified pattern, which includes functional central limit theorems, Erdos-Turan laws, Poisson-Dirichlet limits for the large components and Poisson approximation in total variation for the total number of components. Our approach is entirely probabilistic, and the conditions can readily be verified in practice.