• Corpus ID: 18211380

Easy and Hard Constraint Ranking in OT: Algorithms and Complexity

  title={Easy and Hard Constraint Ranking in OT: Algorithms and Complexity},
  author={Jason Eisner},
We consider the problem of ranking a set of OT constraints in a manner consistent with data. We speed up Tesar and Smolensky's RCD algorithm to be linear on the number of constraints. This finds a ranking so each attested form x_i beats or ties a particular competitor y_i. We also generalize RCD so each x_i beats or ties all possible competitors. Alas, this more realistic version of learning has no polynomial algorithm unless P=NP! Indeed, not even generation does. So one cannot improve… 

Insertion and Deletion in English: A Phonological Approach

This paper attempts to show the basic procedures of how OT works, especially in case of insertion and deletion, and how OT provides an ideal surface form considering the competing candidates who have also the possibilities to surface.

Completeness in the ∆ p 2 Hierarchy

A list of problems known to be complete for the ∆p2 = P NP Hierarchy (P with an NP Oracle hierarchy, level 2) is presented.

Proceedings of the Society for Computation in Linguistics Proceedings of the Society for Computation in Linguistics Strong Generative Capacity of Morphological Processes Strong Generative Capacity of Morphological Processes

It is shown that 1-way transducers do not capture the strong generative capacity of certain morphological analyses for more complex processes, including mobile affixation, in-in-in, and partial reduplication.

Strong generative capacity of morphological processes

It is shown that 1-way transducers do not capture the strong generative capacity of certain morphological analyses for more complex processes, including mobile affixation, infixation and partial reduplication, so origin semantics and order-preservation are used as diagnostics.



How we learn variation, optionality and probalility

Evidence suggests that natural learners follow a symmetrized maximal gradual learning algorithm, rather than a demotion-and-promotion strategy, instead of a dem promotion-only strategy.

The complexity of optimization problems

The central result is that any FPSAT function decomposes into an OptP function followed by polynomial-time computation, and it quantifies "how much" NP-completeness is in a problem, i.e., the number of NP queries it takes to compute the function.

Systematic parameterized complexity analysis in computational phonology

This thesis considers the merits of a systematic parameterized complexity analysis in which results are derived relative to all subsets of a specified set of aspects of a given NP-hard problem and defines an “intractability map” that shows relative to which sets of aspects algorithms whose non-polynomial time complexities are purely functions of those aspects do and do not exist for that problem.

Efficient Generation in Primitive Optimality Theory

This paper introduces primitive Optimality Theory (OTP), a linguistically motivated formalization of OT. OTP specifies the class of autosegmental representations, the universal generator Gen, and the

Multi-Recursive Constraint Demotion

Tesar and Smolensky have demonstrated that, given the correct full structural descriptions, a constraint ranking can be determined e ciently which makes all of those structural descriptions optimal, thus, if the problem of hidden structure can be overcome, constraint rankings can be learned.

The Proper Treatment of Optimality in Computational Phonology

This paper presents a novel formalization of optimality theory based on the notion of "lenient composition", defined as the combination of ordinary composition and priority union that maps each underlying form directly into its optimal surface realizations, and vice versa.

Language Identification in the Limit

  • E. M. Gold
  • Linguistics, Computer Science
    Inf. Control.
  • 1967

Optimality Theory and the Generative Complexity of Constraint Violability

It is shown that the conditions under which the phonological descriptions that are possible within the view of constraint interaction embodied in Optimality Theory remain within the class of rational relations are correct when GEN is itself a rational relation.

Directional Constraint Evaluation in Optimality Theory

This work proposes replacing unbounded constraints, as well as non-finite-state Generalized Alignment constraints, with a new class of finite-state directional constraints, and gives linguistic applications, results on generative power; and algorithms to compile grammars into transducers.

Computing Optimal Descriptions for Optimality Theory Grammars with Context-Free Position Structures

This algorithm extends Tesar's dynamic programming approach to computing optimal structural descriptions from regular to context-free structures, and has a time complexity cubic in the length of the input, and is applicable to grammars with universal constraints that exhibit context- free locality.