<?xml version="1.0" standalone="yes"?>
<Paper uid="A00-2039">
  <Title>Finite-State Reduplication in One-Level Prosodic Morphology</Title>
  <Section position="7" start_page="299" end_page="299" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> This paper has presented a novel finite-state method for reduplication that is applicable for both unbounded total cases, truncated or otherwise phonologically modified types and infixing instances. The key ingredients of the proposal are suitably enriched automaton representations, the identification of reduplicative copying with automaton intersection and a resource-conscious interpretation that differentiates between two types of arc symbols, namely producers and consumers of information.</Paragraph>
    <Paragraph position="1"> After demonstrating the existence of efficient on-demand algorithms to reduplication's central operations, a case study from Koasati has shown that all of the above ingredients may be necessary in the analysis of a single complex piece of prosodic morphology. null It is worth mentioning that our method can be transferred into a two-level transducer setting without major difficulties (Walther, 1999, appendix B). I conclude that the one-level approach to reduplicative prosodic morphology presents an attractive way of extending finite-state techniques to difficult phenomena that hitherto resisted elegant computational analyses.</Paragraph>
  </Section>
class="xml-element"></Paper>