<?xml version="1.0" standalone="yes"?>
<Paper uid="P88-1028">
  <Title>Polynomial Learnability and Locality of Formal Grammars</Title>
  <Section position="7" start_page="231" end_page="231" type="concl">
    <SectionTitle>
7 Conclusions
</SectionTitle>
    <Paragraph position="0"> We have investigated the use of complexity theory to the evaluation of grammatical systems as linguistic formalisms from the point of view of feasible learnability. In particular, we have demonstrated that a single, natural and non-trivial constraint of &amp;quot;locality ~ on the grammars allows a rich class of mildly context sensitive languages to be feasibly learnable, in a well-defined complexity theoretic sense. Our work differs from recent works on efficient learning of formal languages, for example by Angluin (\[4\]), in that it uses only examples and no other powerful oracles. We hope to have demonstrated that learning formal grammars need not be doomed to be necessaxily computationally intractable, and the investigation of alternative formulations of this problem is a worthwhile endeavour.</Paragraph>
  </Section>
class="xml-element"></Paper>