On the Expressivity of Optimality Theory versus Ordered Rewrite Rules
نویسنده
چکیده
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.
منابع مشابه
Probabilistic Ranking
This paper discusses aspects of ordering, more specifically probabilistic ordering. An algorithm is presented for adaptive learning an optimal ordering based on data, such that the resulting ordering follows the statistical properties in the input data. The properties to be ordered can be phonological rewrite rules, pronunciation rules inferred from observed phonetic data, grammar rules, etc. T...
متن کاملThe Proper Treatment of Optimality in Computational Phonology
This paper presents a novel formalization of optimality theory. Unlike previous treatments of optimality in computational linguistics, starting with Ellison (1994), the new approach does not require any explicit marking and counting of constraint violations. It is based on the notion of \lenient composition", de ned as the combination of ordinary composition and priority union. If an underlying...
متن کاملOptimality Theory and the Generative Complexity of Constraint Violability
It has been argued that rule-based phonological descriptions can uniformly be expressed as mappings carried out by finite-state transducers, and therefore fall within the class of rational relations. If this property of generative capacity is an empirically correct characterization of phonological mappings, it should hold of any sufficiently restrictive theory of phonology, whether it utilizes ...
متن کاملSemantics Of Non-Terminating Systems Through Term Rewriting
This thesis is primarily concerned with the algebraic semantics of non-terminating term rewriting systems. The usual semantics for rewrite system is based in interpreting rewrite rules as equations and rewriting as a particular case of equational reasoning. The termination of a rewrite system ensures that every term has a value (normal form). But, in general we cannot guarantee this. The resear...
متن کاملOpacity and Sound Change in the Polish Lexicon
................................................................................................................. ix Acknowledgements................................................................................................. xi Transcriptions, Abbreviations, and Symbols...................................................... xiv Chapter 1: Essentials............................................
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013