<?xml version="1.0" standalone="yes"?>
<Paper uid="P84-1070">
  <Title>A DISCOVERY PROCEDURE FOR CERTAIN PHONOLOGICAL RULES</Title>
  <Section position="8" start_page="346" end_page="346" type="concl">
    <SectionTitle>
6. CONCLUSION
</SectionTitle>
    <Paragraph position="0"> In this paper I have presented the details of a discovery procedure that can determine a limited class of phonological rules with arbitrary rule ordering. The procedure has the interesting property that it can be separated into two separate phases, the first, phase being superificial data analysis, that is, collecting the sets C, and C b of equations (2) and (3), and the second phase being the application of the procedure proper, which need never reference the data directly, but can do all of its calculations using C, and Cb ~. This property is interesting because it is likely that 6&amp;quot;, and C a have limiting values, as the number of forms in the surface data increases. That is, presumably the language only has a fixed number of alternations, and each of these only occurs in some fixed contexts, and as soon as we have enough data to see all of these contexts we will have determined C, and C b. and extra data will not. make these sets larger. Thus the computational complexity of the second phase of the discovery procedure is more or less independent, of the size the lexicon, making the entire procedure require linear time with respect to the size of the data.</Paragraph>
    <Paragraph position="1"> i think this is a desirable result, since there is something counterintuitive to a situation in which the difficulty of discovering a grammar increases rapidly with the size of the lexicon.</Paragraph>
  </Section>
class="xml-element"></Paper>