Quantifier Scope in Syntax (S. Kuno and K. Takami, Quantifier Scope)
نویسندگان
چکیده
منابع مشابه
Quantifier Scope and Constituency
Traditional approaches to quantifier scope typically need stipulation to exclude readings that are unavailable to human understanders. This paper shows that quantifier scope phenomena can be precisely characterized by a semantic representation constrained by surhce constituency, if the distinction between referential and quantificational NPs is properly observed. A CCG implementation is describ...
متن کاملUnrestricted Quantifier Scope Disambiguation
We present the first work on applying statistical techniques to unrestricted Quantifier Scope Disambiguation (QSD), where there is no restriction on the type or the number of quantifiers in the sentence. We formulate unrestricted QSD as learning to build a Directed Acyclic Graph (DAG) and define evaluation metrics based on the properties of DAGs. Previous work on statistical scope disambiguatio...
متن کاملConnection Relations and Quantifier Scope
A formalism will be presented in this paper which makes it possible to realise the idea of assigning only one scope-ambiguous representation to a sentence that is ambiguous with regard to quantif ier scope. The scope de te rmina t ion resul ts in ex tending this representat ion with addit ional context and world knowledge conditions. If there is no scope determining information, the formalism c...
متن کاملAlternating Quantifier Scope in CCG
The paper shows that movement or equivalent computational structure-changing operations of any kind at the level of logical form can be dispensed with entirely in capturing quantifier scope ambiguity. It offers a new semantics whereby the effects of quantifier scope alternation can be obtained by an entirely monotonic derivation, without typechanging rules. The paper follows Fodor (1982), Fodor...
متن کاملDisambiguating quantifier scope in DTS
This paper proposes an extension of Dependency Tree Semantics (DTS), an underspecified logic originally proposed in [20], that uniformily implements constraints on Nested Quantification, Island Constraints and logical Redundancy. Unfortunately, this extension makes the complexity exponential in the number of NPs, in the worst cases. Nevertheless, we conducted an experiment on the Turin Universi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ENGLISH LINGUISTICS
سال: 2004
ISSN: 0918-3701,1884-3107
DOI: 10.9793/elsj1984.21.487