Two accounts of scope availability and semantic underspecification

Authors:
Alistair Willis;Suresh Manandhar
Affiliations:
University of York, York, UK;University of York, York, UK
Venue:
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Year:
1999

Citing 6
Cited 3

An algorithm for generating quantifier scopings

Computational Linguistics
Introduction to algorithms

Introduction to algorithms
On reasoning with ambiguities

EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Constraints over Lambda-Structures in semantic underspecification

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Quantifier scope and constituency

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Monotonic semantic interpretation

ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics

An efficient graph algorithm for dominance constraints

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Alternating quantifier scope in CCG

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
A polynomial-time fragment of dominance constraints

ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a formal system for representing the available readings of sentences displaying quantifier scope ambiguity, in which partial scopes may be expressed. We show that using a theory of scope availability based upon the function-argument structure of a sentence allows a deterministic, polynomial time test for the availability of a reading, while solving the same problem within theories based on the well-formedness of sentences in the meaning language has been shown to be NP-hard.