<?xml version="1.0" standalone="yes"?>
<Paper uid="C00-1038">
  <Title>Directional Constraint Evaluation in Optimality Theory*</Title>
  <Section position="4" start_page="259" end_page="259" type="intro">
    <SectionTitle>
2.5 Related Work
</SectionTitle>
    <Paragraph position="0"> Walther (1999), working with intersective constraints, defines a similar notion of Bounded Local Optimization (BLO). Tronnner (1998; 1999) applies a variant of Walther's idea to OT.</Paragraph>
    <Paragraph position="1"> The motivation in both eases is linguistic.</Paragraph>
    <Paragraph position="2"> We sketch how our idea differs via 3 examples: UR uuuuu uu uuu uuuuu candidate X vvvbb vv vbb vvvbb candidate Y vvbaa vvvvbaa vzbaa Consider *b, a left-to-right constraint that is of fended by each instance of b. On our proposal, candidate X wins in each column, because Y always offends ,b first, at position 3 in the UR. But under BLO, this offense is not fatal. Y can survive *b by inserting epenthetic material (colunm 2: Y wins by postt)oning b relative to tits SR), or by changing v to z (cohmm 3: Y ties X, since vv C/ vz and BLO merely requires the cheapest choice 9iven the sur:face output so far). In the same way, NoCoDA under BLO would trigger many changes unrelated to codas. Our definition avoids these apparent inconveniences. Walther and Trommer do not consider the expressive power of BLO (cf. ga.3) or whether grammars can be compiled into UR-to-SR FSTs (our main result; see discussion in SS3.4).</Paragraph>
  </Section>
class="xml-element"></Paper>