<?xml version="1.0" standalone="yes"?>
<Paper uid="P95-1023">
  <Title>TAL Recognition in O(M(n2)) Time</Title>
  <Section position="11" start_page="172" end_page="172" type="concl">
    <SectionTitle>
9 Conclusions
</SectionTitle>
    <Paragraph position="0"> In this paper we have presented an O(M(n2)) time algorithm for parsing TALs, n being the length of the input string. We have also demonstrated with our implementation work that matrix multiplication techniques can help us obtain efficient parsing algorithms. null</Paragraph>
  </Section>
class="xml-element"></Paper>