Evaluating Precedence-Based Phonology: Logical structure of reduplication and linearization
Hossep Dolatian, Eric Raimy
September 2020 

Historically, reduplication is a challenging phenomenon which has been modeled with diverse mathematical and theoretical frameworks. In this chapter, we focus on total reduplication. We examine the computational expressivity of total reduplication in terms of Monadic-Second Order logic. We then contrast this with an explicit theory of reduplication, Precedence-Based Phonology (Raimy 2000). We show that this theory of reduplication is not MSO-definable, making it computationally more complex or expressive than reduplication itself. We extrapolate the reasons for this divergence as due to counting.

Format:	[ pdf ]
Reference:	lingbuzz/005600 (please use that when you cite this article)
Published in:	To appear in an edited volume
keywords:	reduplication, logic, generative capacity, computational morphology, computational phonology, complex complexity, phonology
Downloaded:	463 times

 

[ edit this article | back to article list ]