<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-2240">
  <Title>Discovering Phonotactic Finite-State Automata by Genetic Search</Title>
  <Section position="4" start_page="0" end_page="0" type="intro">
    <SectionTitle>
2 Task Description
</SectionTitle>
    <Paragraph position="0"> Given a known finite alphabet of symbols I, a target finite-state language L, and a data sample D + _C L _C I', the task is to find an FSA A, such that L( A ) is consistent with D +, L( A ) is a superset of D + encoding generalisation over the structural regularities of D +, and the size of S is as small as possible. Where the target language is known in advance, the degree of language and size approximation can be measured, and its adequacy relative to training set size and representativeness can be described. In the case of inference of automata that encode (part of) a phonological grammar, language approximation and its degree of adequacy can be described relative to a set of theoretical linguistic assumptions that describes a target grammar.</Paragraph>
  </Section>
class="xml-element"></Paper>