<?xml version="1.0" standalone="yes"?>
<Paper uid="W04-0301">
  <Title>Competence and Performance Grammar in Incremental Processing</Title>
  <Section position="6" start_page="0" end_page="0" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> This paper has explored some consequences of building an incremental grammar that constrains the possible con gurations of partial structures and the possible interpretable partial structures.</Paragraph>
    <Paragraph position="1"> We have introduced a TAG{based formalism that encodes a strong notion of incrementality directly into the operations of the formal system. null A left-associative type-raising operation has been used to build a DV{TAG realistic lexicon from a LTAG lexicon. The left{association operation can be viewed as a sort of chunking of linguistic knowledge: this chunking could be useful in the de nition of a language model in which speci c combinations of elementary trees that have been successful in the past experience become part of the lexicon.</Paragraph>
    <Paragraph position="2"> As shown in the empirical tests ofn English and Italian, the left{association closure can lead to severe computational problems that suggest the adoption of some form of underspeci cation.</Paragraph>
  </Section>
class="xml-element"></Paper>