<?xml version="1.0" standalone="yes"?>
<Paper uid="P97-1042">
  <Title>Compiling Regular Formalisms with Rule Features into Finite-State Automata</Title>
  <Section position="6" start_page="333" end_page="334" type="concl">
    <SectionTitle>
6 Conclusion and Future Work
</SectionTitle>
    <Paragraph position="0"> The above algorithm was implemented in Prolog and was tested successfully with a number of sampletype grammars. In every case, the automata produced by the compiler were manually checked for correctness, and the machines were executed in generation mode to ensure that they did not over generate. null It was mentioned that the algorithm presented here is based on the work of (Grimley-Evans, Kiraz, and Pulman, 1996) rather than (Kaplan and Kay, 1994). It must be stated, however, that the intuitive ideas behind our compilation of rule features, viz. the incorporation of rule features in contexts, are independent of the algorithm itself and can be also applied to (Kaplan and Kay, 1994) and (Mohri and Sproat, 1996).</Paragraph>
    <Paragraph position="1"> One issue which remains to be resolved, however, is to determine which approach for compiling rules into automata is more efficient: the standard method of (Kaplan and Kay, 1994) (also (Mohri and Sproat, 1996) which follows the same philosophy) or  dealt with at the morphotactic level using a unification based formalism.</Paragraph>
  </Section>
class="xml-element"></Paper>