<?xml version="1.0" standalone="yes"?>
<Paper uid="W00-1414">
  <Title>Generating Referring Quantified Expressions</Title>
  <Section position="4" start_page="100" end_page="100" type="relat">
    <SectionTitle>
2 Related Work
</SectionTitle>
    <Paragraph position="0"> Because a quantified expression refers to multiple entities in a domain, our work can be categorized as referring expression generation (Dale, 1992; Reiter and Dale, 1992; Horacek, 1997). Previous work in this area did not address the generation of quantified expressions directly. In this paper, we are interested in how to systematically derive quantifiers from input propositions, discourse history, and ontological information. Recent work on the generation ofquantifiers (Gailly, 1988; Creaney, 1996; Creaney, 1999) follows the analysis viewpoint, discussing scope anabiguities extensively. Though our algorithm generates different sentences for different scope orderings, we do not achieve this through scoping operations as they did. Creaney also discussed various imprecise quantifiers, such as some, at least, and at most.</Paragraph>
    <Paragraph position="1"> In regards to generating generic quantified expressions, (Knott et al., 1997) has proposed an algorithm for generating defeasible, but informative descriptions for objects in nmseums.</Paragraph>
    <Paragraph position="2"> Other researchers (van Eijck and Alshawi, 1992; Copestake et al., 1999) proposed representations in a machine translation setting which allow underspecification in regard to quantifier scope. Our work is different, in that we perform quantification directly on the instance-based representation obtained from database tuples. Our input .does not have the in-..</Paragraph>
    <Paragraph position="3"> formation about which entities are quantified as is the case in machine translation, where the quantitiers are already specified in the input from a source language.</Paragraph>
  </Section>
class="xml-element"></Paper>