{'fraction_non_alphanumeric': 0.039397450753186555, 'fraction_numerical': 0.0011587485515643105, 'mean_word_length': 5.306569343065694, '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}}
Contributions to the Classification for Testability : Four Universal and One Existential Quantifier

In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a small, random sample of the structure. We focus on the classification of first-order sentences based on their quantifier prefixes and vocabulary into testable and untestable classes. This classification was begun by Alon et al. [1] who showed that graph properties expressible with quantifier patterns ∃∗∀∗ are testable but that there is an untestable graph property expressible with a quantifier pattern ∀∗∃∗. We simplify their untestable example and therefore show that there is an untestable graph property expressible with each of the following quantifier patterns: ∀∃, ∀∃∀, ∀∃∀ and ∀∃∀.