<?xml version="1.0" standalone="yes"?>
<Paper uid="W00-0718">
  <Title>ALLiS: a Symbolic Learning System for Natural Language Learning Herv@ D@jean Seminar ffir Sprachwissenschaft</Title>
  <Section position="7" start_page="97" end_page="97" type="concl">
    <SectionTitle>
7 Conclusion
</SectionTitle>
    <Paragraph position="0"> We showed that even a simple implementation of TR provides good results (comparable to other systems) for learning non-recursive structures from bracketed corpora. The next steps 4More complete results are shown in (D6jean, 2000a) and (D6jean, 2000b).</Paragraph>
    <Paragraph position="1"> concern two directions. First the improvement of algorithms used by ALLiS (especially the selection of rules). The second step consists of applying ALLiS on other structures, especially the clause so that ALLiS can provide a more complete parsing.</Paragraph>
  </Section>
class="xml-element"></Paper>