File Information

File: 05-lr/acl_arc_1_sum/cleansed_text/xml_by_section/intro/06/e06-2008_intro.xml

Size: 2,511 bytes

Last Modified: 2025-10-06 14:03:26

<?xml version="1.0" standalone="yes"?>
<Paper uid="E06-2008">
  <Title>ELLEIPO: A module that computes coordinative ellipsis for language generators that don't</Title>
  <Section position="3" start_page="0" end_page="115" type="intro">
    <SectionTitle>
1 Introduction
</SectionTitle>
    <Paragraph position="0"> Coordination and coordinative ellipsis are essential tools for the sentence aggregation component of any language generator. Very often, when the aggregator chooses to combine several clauses into a single coordinate structure, the need arises to eliminate unnatural reduplications of coreferential constituents.</Paragraph>
    <Paragraph position="1"> In the literature, one often distinguishes four major types of clause-level coordinative ellipsis: * Gapping (as in (1)), with a special variant called Long-Distance Gapping (LDG). In LDG, the second conjunct consists of constituents stemming from different clauses -in (2), the main clause and the complement.</Paragraph>
    <Paragraph position="2">  left after three o'clock The subscripts denote the elliptical mechanism at work: g=Gapping, gl=LDG, f=FCR, s=SGF, b=BCR. We will not deal with VP Ellipsis and VP Anaphora because they generate pro-forms rather than elisions and are not restricted to coordination (cf. the title of the paper).</Paragraph>
    <Paragraph position="3"> In current sentence generators, the coordinative ellipsis rules are often inextricably intertwined with the rules for generating non-elliptical coordinate structures, so that they cannot easily be ported to other grammar formalisms -- e.g., Sarkar &amp; Joshi (1996) for Tree Adjoining Grammar; Steedman (2000) for Combinatory Categorial Grammar; Bateman, Matthiessen &amp; Zeng (1999) for Functional Grammar. Generators that do include an autonomous component for coordinative ellipsis (Dalianis, 1999; Shaw, 2002; Hielkema, 2005), use incomplete rule sets, thus risking over- or undergeneration, and incorrect or unnatural output.</Paragraph>
    <Paragraph position="4"> The module (dubbed ELLEIPO, from Greek uni1F18lleuni1F77pio 'I leave out') we present here, is less  formalism-dependent and, in principle, less liable to over- or undergeneration than its competitors. In Section 2, we sketch the theoretical background. Section 3 and the Appendix describe our implementation, with examples from German.</Paragraph>
    <Paragraph position="5"> Finally, in Section 4, we discuss the prospects of extending the module to additional constructions.</Paragraph>
  </Section>
class="xml-element"></Paper>
Download Original XML