Plausible Reasoning and the Resolution of Quantifier Scope Ambiguities

Despite overwhelming evidence suggesting that quantifier scope is a phenomenon that must be treated at the pragmatic level, most computational treatments of scope ambiguities have thus far been a collection of syntactically motivated preference rules. This might be in part due to the prevailing wisdom that a commonsense inferencing strategy would require the storage of and reasoning with a vast amount of background knowledge. In this paper we hope to demonstrate that the challenge in developing a commonsense inferencing strategy is in the discovery of the relevant commonsense data and in a proper formulation of the inferencing strategy itself, and that a massive amount of background knowledge is not always required. In particular, we present a very effective procedure for resolving quantifier scope ambiguities at the pragmatic level using simple ‘quantitative’ data that is readily available in most database environments.

[1]  Jean-Pierre Corriveau,et al.  A Pragmatic Treatment of Quantification in Natural Language , 1997, AAAI/IAAI.

[2]  ScopingsJerry R. Hobbs,et al.  An Algorithm for Generating Quanti er , 1987 .

[3]  Jong C. Park,et al.  Quantifier Scope and Constituency , 1995, ACL.

[4]  D. Fox Economy and scope , 1995 .

[5]  Martha E. Pollack,et al.  Incremental Interpretation , 1991, Artif. Intell..

[6]  Uwe Reyle,et al.  On Reasoning with Ambiguities , 1995, EACL.

[7]  Norman H. Freeman,et al.  How Children Deal with Natural Language Quantification , 1986 .

[8]  Jan van Eijck,et al.  Logical Forms in the Core Language Engine , 1989, ACL.

[9]  Jerry R. Hobbs Monotone Decreasing Quantiers in a Scope-Free Logical Form , 1996 .

[10]  Robert Rodman SCOPE PHENOMENA, “MOVEMENT TRANSFORMATIONS,” AND RELATIVE CLAUSES , 1976 .

[11]  T. Reinhart Quantifier Scope: How labor is Divided Between QR and Choice Functions , 1997 .

[12]  Robert May,et al.  Interpreting logical form , 1989 .

[13]  Christopher Cherniak,et al.  Minimal Rationality , 1986, Computational models of cognition and perception.

[14]  Jeroen Groenendijk,et al.  Logic, language and meaning: Vol. II: Intensional logic and logical grammar , 1991 .

[15]  J. Barwise,et al.  Generalized quantifiers and natural language , 1981 .

[16]  Douglas B. Moran,et al.  Quantifier Scoping in the SRI Core Language Engine , 1988, ACL.

[17]  Douglas E. Appelt,et al.  TEAM: An Experiment in the Design of Transportable Natural-Language Interfaces , 1987, Artif. Intell..

[18]  R. May Logical Form: Its Structure and Derivation , 1985 .

[19]  T. Reinhart Anaphora and semantic interpretation , 1983 .

[20]  Hiyan Alshawi,et al.  Resolving Quasi Logical Forms , 1990, CL.

[21]  Jean-Pierre Corriveau Time-constrained Memory: A Reader-based Approach To Text Comprehension , 1995 .

[22]  L. Shastri,et al.  From simple associations to systematic reasoning: A connectionist representation of rules, variables and dynamic bindings using temporal synchrony , 1993, Behavioral and Brain Sciences.

[23]  David B. Leake Artiicial Intelligence , 2001 .

[24]  Kees van Deemter,et al.  Towards a Logic of Ambiguous Expressions 1 Coping with Ambiguous Information , 1996 .

[25]  J. Benthem Essays in Logical Semantics , 1986 .

[26]  Douglas B. Lenat,et al.  CYC: a large-scale investment in knowledge infrastructure , 1995, CACM.

[27]  Max J. Cresswell,et al.  Logics and languages , 1973 .

[28]  Robin Cooper,et al.  Quantification and Syntactic Theory , 1983 .

[29]  An inferencing strategy for resolving quantifier scope ambiguities , 1999 .

[30]  Maryellen C. MacDonald,et al.  Resolution of quantifier scope ambiguities , 1993, Cognition.

[31]  Jerry R. Hobbs,et al.  An Algorithm for Generating Quantifier Scopings , 1987, CL.

[32]  P. Johnson-Laird Mental models and probabilistic thinking , 1994, Cognition.