<?xml version="1.0" standalone="yes"?>
<Paper uid="P90-1024">
  <Title>Parsing with Combinatory Categorial Grammar in a Graph-Unification-Based</Title>
  <Section position="4" start_page="191" end_page="191" type="concl">
    <SectionTitle>
5. Conclusion
</SectionTitle>
    <Paragraph position="0"> Hoeksema (1985\] argues for the rule-based approach over the zero morpheme approach, pointing out that the postulation of zero morphemes requires certain arbitrary decisions about their position in the word or in the sentence. While we admit that such arbitrariness exists in some zero morphemes we have defined, we believe the advantages of positing zero morphemes, as discussed in Section 1, outweigh this objection. Our approach combines the linguistic advantages of the zero morpheme analysis with the efficiency of a rule-based approach. Our use of zero morphemes is not restricted to the traditional zero-affix domain. We use them, for example, to handle optional words and VP-ellipsis, extending the coverage of our grammar in a natural way.</Paragraph>
  </Section>
class="xml-element"></Paper>