An algorithm for generating quantifier scopings
| Title: | An algorithm for generating quantifier scopings |
| Author: |
Hobbs, Jerry; Shieber, Stuart
Note: Order does not necessarily reflect citation order of authors. |
| Citation: | Jerry Hobbs and Stuart M. Shieber. An algorithm for generating quantifier scopings. Computational Linguistics, 13(1-2):47-63, January-June 1987. |
| Full Text & Related Files: |
Shieber_AnAlgorithm.pdf (299.4Kb; PDF) 
|
| Abstract: | The syntactic structure of a sentence often manifests quite clearly the predicate-argument structure and relations of grammatical subordination. But scope dependencies are not so transparent. As a result, many systems for representing the semantics of sentences have ignored scoping or generating scoping mechanisms that have often been inexplicit as to the range of scopings they choose among or profligate in the scopings they allow. In this paper, we present an algorithm, along with proofs of some of its important properties, that generates scoped semantic forms from unscoped expressions encoding predicate-argument structure. The algorithm is not profligate as are those based on permutation of quantifiers, and it can provide a solid foundation for computational solutions where completeness is sacrificed for efficiency and heuristic efficacy. |
| Published Version: | http://www.aclweb.org/anthology-new/J/J87/J87-1005.pdf |
| Terms of Use: | This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA |
| Citable link to this page: | http://nrs.harvard.edu/urn-3:HUL.InstRepos:2027194 |
This item appears in the following Collection(s)
-
FAS Scholarly Articles [5128]
Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University
Contact administrator regarding this item (to report mistakes or request changes)
