<?xml version="1.0" standalone="yes"?>
<Paper uid="P04-1065">
  <Title>FSA: An Efficient and Flexible C++ Toolkit for Finite State Automata Using On-Demand Computation</Title>
  <Section position="7" start_page="0" end_page="0" type="evalu">
    <SectionTitle>
6 Shortcomings and Future Extensions
</SectionTitle>
    <Paragraph position="0"> There is still room to improve the RWTH FSA toolkit. For example, the current implementation of determinization is not as general as described in (Allauzen and Mohri, 2003). In case of ambiguous input the algorithm still produces an infinite transducer. At the moment this can be solved in many cases by adding disambiguation symbols to the input transducer manually.</Paragraph>
    <Paragraph position="1"> As the implementation model is based on virtual C++ methods for all types of objects in use (semirings, alphabets, transducers and algorithmic transducers) it should also be fairly easy to add support for dynamically loadable objects to the toolkit.</Paragraph>
    <Paragraph position="2"> Other semirings like the expectation semiring described in (Eisner, 2001) are supported but not yet implemented.</Paragraph>
  </Section>
class="xml-element"></Paper>