<?xml version="1.0" standalone="yes"?>
<Paper uid="E93-1032">
  <Title>Towards efficient parsing with proof-nets</Title>
  <Section position="6" start_page="275" end_page="275" type="concl">
    <SectionTitle>
5- Conclusion
</SectionTitle>
    <Paragraph position="0"> We have presented a conception of parsing essentially based on a geometrical viewpoint. It amounts to build a correct linking of nodes in an ordered sequence of types represented as trees. Such a linking corresponds to an alternating spanning tree in a graph. We have shown that this method is sound and complete with respect to the associative product free Lambek calculus and we have given an idea of what an algorithm for finding such a spanning tree could be.</Paragraph>
  </Section>
class="xml-element"></Paper>