Abstract

Harmonic Serialism and Finite-State Optimality Theory

Highlights

  • The seminal paper of Frank and Satta (1998) showed that grammars in the Optimality Theory (OT) framework can generate non-rational relations, but that a finite-state implementation is possible if each grammar specifies a bound on the number of violations that can be assigned by a constraint

  • I have shown that the Harmonic Seralism version of Optimality Theory defines rational relations if markedness constraints are assumed to be strictly local

  • This transducer was extended to a transducer that makes recursive calls to the grammar by relying on techniques from regular model checking for computing the transitive closure of rational relations satisfying certain conditions

Read more

Summary

Introduction

The seminal paper of Frank and Satta (1998) showed that grammars in the Optimality Theory (OT) framework can generate non-rational relations, but that a finite-state implementation is possible if each grammar specifies a bound on the number of violations that can be assigned by a constraint. Various finite-state approximations of OT have been developed that achieve rationality by modifying the framework to reduce its computational power. Eisner (2000) and Eisner (2002) propose a model called directional OT that prefers candidates whose violations are incurred as close as possible to the left or right boundary of the string. Riggle (2004) presents an algorithm, called the Optimality Transducer Construction Algorithm (OTCA), that takes an OT grammar as input and produces a finite-state transducer that correctly computes the grammar if and only if the grammar defines a rational relation.

Preliminaries
Restrictions on Constraints
Formalization of Harmonic Serialism
Finite-State Harmonic Serialism
HC as a Rational Relation
Transducing Recursion
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.