<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-2240">
  <Title>Discovering Phonotactic Finite-State Automata by Genetic Search</Title>
  <Section position="7" start_page="1473" end_page="1473" type="concl">
    <SectionTitle>
5 Conclusion and Further Research
</SectionTitle>
    <Paragraph position="0"> This paper presented a GA for FSA induction and preliminary results for a toy data set and a simple set of Russian nouns. These results indicate that genetic search can successfully be applied to the automatic discovery of finite-state automata that encode (parts of) phonological grammars from arbitrary subsets of positive data. A more detailed description of the GA and a report on subsequent results can be found in Belz and Eskikaya (1998). The method is currently being extended to allow for sets of negative examples.</Paragraph>
  </Section>
class="xml-element"></Paper>