{'fraction_non_alphanumeric': 0.03159441587068332, 'fraction_numerical': 0.0, 'mean_word_length': 5.454976303317536, '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}}
Comparative markedness and identity effects in reduplication

Abstract In “Comparative Markedness” (henceforth CM), McCarthy (this volume) proposes that the markedness family of constraints should be divided into parallel sets of constraints distinguishing ‘old’ and ‘new’ violations. Whether a markedness violation is ‘old’ or ‘new’ is determined by comparing the candidate under evaluation with a ‘fully faithful candidate’ (FFC), defined in reference to a relation of correspondence. (In the case of input-output, or IO correspondence, the FFC is the candidate that is fully faithful to all properties of the input governed by IO faithfulness constraints, and that optimally satisfies markedness constraints that compel no faithfulness violations.) An ‘old’ markedness violation is shared by the candidate under evaluation and the FFC, and thus, is inherited from the input. A ‘new’ markedness violation is not shared with the FFC, and therefore results from a faithfulness violation at the same locus. CM proposes a significant revision of OT doctrine, as the model increases the access of markedness constraints to inputs albeit indirectly, through the FFC. In this first pass through CM, McCarthy shows that a number of knotty problems that have until now resisted straightforward solutions in optimality theory can be analysed employing the new approach.