<?xml version="1.0" standalone="yes"?>
<Paper uid="P99-1038">
  <Title>Two Accounts of Scope Availability and Semantic Underspecification</Title>
  <Section position="9" start_page="299" end_page="299" type="concl">
    <SectionTitle>
7 Conclusion and Comments
</SectionTitle>
    <Paragraph position="0"> A desirable property for an underspecified representation of quantifier scope ambiguity is that there should be a computationally efficient test for whether a partial scope is available or not.</Paragraph>
    <Paragraph position="1"> We have shown that accepting a theory of availability which states that scope availability is determined by the function-argument structure of a sentence allows the development of a test for availability which is polynomial in the number of quantifiers and relations in a sentence, while theories of availability based upon the logical well-formedness of meaning representations has been shown to be NP-hard.</Paragraph>
    <Paragraph position="2"> Acknowledgements The authors would like to thank Alan Frisch, Mark Steedman and three anonymous reviewers for useful comments. The first author is funded by an EPSRC grant.</Paragraph>
  </Section>
class="xml-element"></Paper>