On the expressivity of optimality theory versus ordered rewrite rules

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

I prove that there are phonological patterns which are expressible by ordered rewrite rules but not by any Optimality Theoretic (OT) grammar whose constraint set contains only markedness constraints and single-state faithfulness constraints, i.e. faithfulness constraints that assign violation marks to pairs of single input-output segments in correspondence, with no reference to other segments in the input or output. The intention is to capture formally the widespread intuition that certain opaque patterns, which are expressible by ordered rewrite rules, are problematic for classic, or traditional, OT. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Buccola, B. (2013). On the expressivity of optimality theory versus ordered rewrite rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8036 LNCS, pp. 142–158). https://doi.org/10.1007/978-3-642-39998-5_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free