<?xml version="1.0" standalone="yes"?>
<Paper uid="E91-1031">
  <Title>Prediction in Chart Parsing Algorithms for Categorial Unification Grammar</Title>
  <Section position="9" start_page="2" end_page="2" type="concl">
    <SectionTitle>
7 Conclusions
</SectionTitle>
    <Paragraph position="0"> There is a trend in modern linguistics to replace grammars that are completely language specific by grammars which combine universal rules and principles with language specific parameter settings, lexicons, etc. This trend can be observed in such diverse frameworks as Lexical Functional Grammar, Government-Binding Theory, Head-driven Phrase Structure Grammar and Categorial Grammar. In parsing with such formalisms, especially those formalisms that are unification-based, we find that traditional parsing-techniques, eventhough they may be applicable to UG, are no longer satisfactory. In particular, prediction techniques which may be efficient for phrase structure grammar do not always carry over easily to UG. The present paper shows that if a grammar uses only schematic combinatory principles instead of phrase-structure rules, prediction is only possible if we replace the generic rules by grammar-specific instances of these rules.</Paragraph>
  </Section>
class="xml-element"></Paper>