Solving Optimality Theory’s Chain Shift Problem
Charles Reiss
November 2021
 

The well-known computational problem of generating chain shifts in a classic Optimality Theory grammar has a simple representational solution. Chain shift patterns can be generated by using underspecified inputs and MAX and DEP faithfulness constraints.
Format: [ pdf ]
Reference: lingbuzz/006309
(please use that when you cite this article)
Published in: ms.
keywords: phonology, feature logic, counterfeeding, chain shift, optimality theory, underspecification, phonology
previous versions: v1 [November 2021]
Downloaded:181 times

 

[ edit this article | back to article list ]