<?xml version="1.0" standalone="yes"?>
<Paper uid="E99-1017">
  <Title>Transducers from Rewrite Rules with Backreferences</Title>
  <Section position="7" start_page="132" end_page="132" type="concl">
    <SectionTitle>
\[NP RepairDet(x) RepairN(y) \]/)~__p 7 so that an
</SectionTitle>
    <Paragraph position="0"> NP could be parsed as a slightly malformed Det followed by a slightly malformed N. RepairDet and RepairN, in this example, could be doing a variety of things such as: contextualized spelling correction, reordering of function words, replacement of phrases by acronyms, or any other operation implemented as a transducer.</Paragraph>
    <Paragraph position="1"> Finally, we should mention the problem of complexity. A critical reader might see the nine steps in our algorithm and conclude that the algorithm is overly complex. This would be a false conclusion. To begin with, the problem itself is complex. It is easy to create examples where the resulting transducer created by any algorithm would become unmanageably large. But there exist strategies for keeping the transducers smaller. For example, it is not necessary for all nine steps to be composed. They can also be cascaded. In that case it will be possible to implement different steps by different strategies, e.g. by deterministic or non-deterministic transducers or bimachines (Roche and Schabes, 1997b). The range of possibilities leaves plenty of room for future research.</Paragraph>
  </Section>
class="xml-element"></Paper>