Optimality Theory implements complex functions with simple constraints

Abstract

While attested phonological mappings appear to be regular, Optimality Theory is known to implement more complex functions. This squib contributes to the computational characterisation of Optimality Theory by constructing a grammar that implements a non-pushdown function. By using only simple, familiar constraints, the result suggests that a large proportion of optimality-theoretic grammars are more powerful than necessary as models of phonology.