<?xml version="1.0" standalone="yes"?>
<Paper uid="C94-2163">
  <Title>Phonological Derivation in Optimality Theory*</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
INTRODUCTION
</SectionTitle>
    <Paragraph position="0"> Recent years have sect) two major trends in phonology: Iheories \[lave begOlllC \[11o1{3 oriented arOl.llld constlai\[lts Ihan transformations, while itnplenmntations have come to rely increasingly on finite state attlomata and transducers.</Paragraph>
    <Paragraph position="1"> This paper seeks to build a bridge between these trends, showing how one constraint-based theory of phonology, munoly Optimality Theory, might be implemented using \[inite-statc tnethods.</Paragraph>
    <Paragraph position="2"> The paper falls into three main sections. The lirst descrihcs Optimality Theory alld its restriction to constraints which can only make binary distinclions in harmony. The second part covers the fornmlisation of the evaluation of harmony, inchtding the silnl)lifying assumptions that the set of candidate forms nntst initially be regular, and that the action of each constraint in assigning harmony also be regular. The third section l)resents algorithms for (i) delining the product of automata modelling constraints, (ii) finding the optimal level o f harlnony o f a set o f candidates and (iii) culling suhoptimal candidates. The last two algorithms are proved COITeCt, alld St)ale worst-case complexity results are given. Tim paper concludes with a discussion o1' the work.</Paragraph>
  </Section>
class="xml-element"></Paper>