Constraint conjunction in weighted probabilistic grammar

Abstract

This paper examines a key difference between constraint conjunction and constraint weight additivity, arguing that the two do not have the same empirical coverage. In particular, constraint conjunction in weighted probabilistic grammar allows for superadditive constraint interaction, where the effect of violating two constraints goes beyond the additive combination of the two constraints’ weights alone. A case study from parasitic tone harmony in Dioula d'Odienné demonstrates superadditive local and long-distance segmental feature similarities that increase the likelihood of tone harmony. Superadditivity in Dioula d'Odienné is formally captured in Maximum Entropy Harmonic Grammar by weighted constraint conjunction. Counter to previous approaches that supplant constraint conjunction with weight additivity in Harmonic Grammar, information-theoretic model comparison reveals that weighted constraint conjunction improves the grammar's explanatory power when modelling quantitative natural language patterns.