{'fraction_non_alphanumeric': 0.028169014084507043, 'fraction_numerical': 0.004024144869215292, 'mean_word_length': 5.180124223602484, '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}}
Limits on global rules in Optimality Theory with Candidate Chains*

In Optimality Theory with Candidate Chains (OT-CC; McCarthy 2007), candidates are multi-step derivations, and precedence constraints, which regulate the order of derivational steps, can inspect entire candidate derivations. This means that OT-CC opens the door to certain kinds of ‘global rules’ – that is, effects in which the application or non-application of a process is decided with crucial reference to derivational history. This paper investigates what limits may exist on OT-CC's global rule powers, focusing on two forms of opacity which are possible under a theory where all rules apply simultaneously, but not under sequential rule application: mutual counterfeeding and mutual counterbleeding. It is shown that the original version of OT-CC allows none, but that each of them could be made possible with relatively simple revisions to the original theory. Possible examples of these forms of opacity are discussed.