<?xml version="1.0" standalone="yes"?>
<Paper uid="C90-3034">
  <Title>A Quantifier Scoping Algorithm without A Free Variable Constraint</Title>
  <Section position="7" start_page="192" end_page="193" type="concl">
    <SectionTitle>
6 Summary and Conclusion
</SectionTitle>
    <Paragraph position="0"> A modification to the algorithm of \[Hobbs and Shieber 1987\] based on a hint from standard logical theory has led to a simpler algorithm, and one which makes no illegitimate appeal to tile syntax of logical form. The algorithm is sound and complete with respect to the input language since it retraces the semantic definition of that language. The degree to which it matches our intuitions concerning English determines how good a contribution to natural language processing it is.</Paragraph>
    <Paragraph position="1"> Acknowledgement~ Helpful comments on this work have been made by Robin Cooper, Graeme Ritchie and audiences at both the A.I. Natural Language Group and the Cognitive Science Formal Semantics Workshop in Edinburgh.</Paragraph>
    <Paragraph position="2"> Tile research was supported by SERC research studentship no. 88304590 6There are other uses of pronouns not treated in the version of the algorithm glven here. For example, there i~ a possible deictie use of &amp;quot;his&amp;quot; in 7). Nor do we aceotmt for &amp;quot;donkey&amp;quot; pronouns tmeh ~ts Every woman who saw a man disliked him.</Paragraph>
  </Section>
class="xml-element"></Paper>