{'fraction_non_alphanumeric': 0.0065252854812398045, 'fraction_numerical': 0.0032626427406199023, 'mean_word_length': 5.531914893617022, '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}}
A heuristic for multiple weight set generation

The number of weighted random patterns depends on the number of deterministic test patterns with a low sampling probability. The weight set that is extracted from the deterministic pattern set with high sampling probability reduces the number of test patterns. In this paper we present a new deterministic pattern selection algorithm which generates high performance weight sets by removing deterministic patterns with low sampling frequencies. Simulation results using ISCAS 85 benchmark circuits prove the effectiveness of the new weight set generation algorithm.