{'fraction_non_alphanumeric': 0.012515644555694618, 'fraction_numerical': 0.0012515644555694619, 'mean_word_length': 4.970149253731344, '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}}
Erc Sets and Antimatroids 1

Grammars in Optimality Theory can be characterized by sets of Ercs (Elementary Ranking Conditions). Antimatroids are structures that arose initially in the study of lattices. In this paper we prove that antimatroids and consistent Erc sets have the same formal structures. We do so by defining two functions MChain and RCerc, MChain being a function from consistent sets of Ercs to antimatroids and RCerc a function from antimatroids to Erc sets. We then show that these functions are inverses of each other and that both maintain the structural properties of Erc sets and antimatroids. This establishes that antimatroids and consistent Erc sets have the same formal structure, allowing linguists to import from the sizable work done on antimatroids any and all results.