<?xml version="1.0" standalone="yes"?>
<Paper uid="C02-1001">
  <Title>Disambiguation of Finite-State Transducers</Title>
  <Section position="8" start_page="8" end_page="8" type="concl">
    <SectionTitle>
5 Conclusion and future
</SectionTitle>
    <Paragraph position="0"> work We have been able to disambiguate an important class of cyclic and ambiguous transducers, which allows us to apply the determinization algorithm (Mohri, 1997); and then to reduce the size of those transducers. With our new approach, we do not have to take into account the number of transducers Ri and their auxiliary labels as was the case with the approach used before. Thus, new transducers Ri such as phonological rules can be easily inserted in the chain.</Paragraph>
    <Paragraph position="1"> The major disadvantage of our approach is that disambiguating a transducer increases its size systematically. Our future work will consist of developing a more e ective algorithm for disambiguating an acyclic transducer.</Paragraph>
  </Section>
class="xml-element"></Paper>