<?xml version="1.0" standalone="yes"?>
<Paper uid="W05-1503">
  <Title>Switch Graphs for Parsing Type Logical Grammars[?]</Title>
  <Section position="6" start_page="26" end_page="27" type="concl">
    <SectionTitle>
4 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have introduced switch graphs for shift-reduce and CKY-style parsing of grammars in the associative Lambek calculus. Switch graphs encode  the axiom-linking possibilities of a sequence of unlinked literals deriving from underlying polar trees. We introduced two parsers based on switch graphs. The shift-reduce parsers are memory efficient and parses correspond uniquely to (cut free) proof nets. They can be made more efficient by bounding stack size. The memoizing parsers are able to pack attachment and scope distinctions that lead to different l-terms but have the same combinatory possibilities.</Paragraph>
  </Section>
class="xml-element"></Paper>