{'fraction_non_alphanumeric': 0.013910355486862442, 'fraction_numerical': 0.0, 'mean_word_length': 4.890909090909091, '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}}
Optimal dynamic sample allocation among strata

A dynamic sampling plan among strata is a permutation of sampled items specifying which stratum is to receive the next item to be included in the sample. An optimal such plan has the property of achieving minimum variance for its cost whenever it is truncated. This article shows that optimal dynamic sampling plans exist under very general conditions, and gives a simple algorithm for constructing them. The well-known Neyman allocation is compared to the dynamic optimum, both statically and dynamically. The theorems rely on a version of the Neyman-Pearson Lemma adapted for use in search theory.