{'fraction_non_alphanumeric': 0.034236804564907276, 'fraction_numerical': 0.0014265335235378032, 'mean_word_length': 5.157894736842105, '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}}
Efficient and effective random testing using the Voronoi diagram

Adaptive random testing (ART) is a method for improving the fault-finding effectiveness of random testing. Fixed-size candidate set ART is the most studied variant of this approach. However, existing implementations of FSCS-ART have had substantial selection overhead, with n test cases requiring O(n/sup 2/) time to generate. We describe the use of a geometric data structure known as the Voronoi diagram to reduce this overhead to no worse than O(n/spl radic/n) and, with further optimization, O(nlogn). We demonstrate experimentally that practical improvements in selection overhead can be gained using this improved implementation.