<?xml version="1.0" standalone="yes"?>
<Paper uid="J87-1005">
  <Title>AN ALGORITHM FOR GENERATING QUANTIFIER SCOPINGS</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1 INTRODUCTION
</SectionTitle>
    <Paragraph position="0"> A principal focus of computational linguistics, as a branch of computer science, ought to be the design of algorithms. A large number of algorithms have undoubtedly been devised for dealing with problems every researcher has to face in constructing a natural language system, but they simply have not received wide circulation. These algorithms are part of the &amp;quot;folk culture&amp;quot;, buried in the most technical, unreadable portions of theses, passed among colleagues informally at best, and often reinvented. It should be a practice to publish these algorithms in isolation, independent of a particular implementation or system.</Paragraph>
    <Paragraph position="1"> This paper constitutes an effort to initiate such a practice. A problem that many natural-language efforts have faced is the recovery of implicit semantic scope dependency possibilities - such as those manifest in quantifiers and modals - from predicate-argument relations and relations of grammatical subordination, which are more or less transparently conveyed by the syntactic structure of sentences. Previous computational efforts typically have not been based on an explicit notion of the range of possible scopings. In response to this problem, we present an algorithm that generates quantifier scopings for English sentences.</Paragraph>
  </Section>
class="xml-element"></Paper>