<?xml version="1.0" standalone="yes"?>
<Paper uid="W04-0309">
  <Title>The information-processing difficulty of incremental parsing</Title>
  <Section position="9" start_page="0" end_page="0" type="concl">
    <SectionTitle>
8 Conclusion
</SectionTitle>
    <Paragraph position="0"> By extending Lounsbury's (1954) entropy reduction idea to infinite languages, it has become possible to relate predictability and processing difficulty in a way that takes into account linguistic structures defined by one kind of mildly context-sensitive grammar formalism. This relation is the linking hypothesis ERH.</Paragraph>
    <Paragraph position="1"> On this linking hypothesis, a grammar expressing the promotion analysis of relative clauses yields whole-sentence predictions more closely approximating human repetition accuracy results than does a grammar expressing the standard adjunction analysis. null If the ERH is true, this result suggests that one grammar carries a kind of greater psychological validity than the other. On the other hand, to the extent that the promotion grammar correctly characterizes human linguistic competence, this confirms the ERH as a linking hypothesis. In any case, the information-processing difficulty of incremental parsing can now be given a more specific definition.</Paragraph>
  </Section>
class="xml-element"></Paper>