{'fraction_non_alphanumeric': 0.021476510067114093, 'fraction_numerical': 0.0013422818791946308, 'mean_word_length': 5.48695652173913, '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}}
Designing simulation experiments to completely rank alternatives

Many of the problems of selecting the t-best of k populations with respect to a given parameter have been successfully solved for some time. Important applications, including applications to the design and analysis of simulation experiments, have been demonstrated and the tables required for implementation of solutions are easily available (e.g. in Gibbons, Olkin and Sobel (5)).
 Solutions to the companion problem of completely ranking k populations have been scarce due to their mathematical complexity. This paper discusses examples of complete ranking problems, some recent advances made towards their solution, and cites sources of tables needed for their implementation.