tailieunhanh - Báo cáo khoa học: "A Calculus for Semantic Composition and Scoping"

Certain restrictions on possible scopings of quantifiednoun phrases in natural language are usually expressed in terms of formal constraints on binding at a level of logical form. Such reliance on the form rather than the content of semantic interpretations goes against the spirit of compositionality. I will show that those scoping restrictions follow from simple and fundamental facts about functional application and abstraction, and can be expressed as constraints on the derivation of possible meanings for sentences rather than constraints of the alleged forms of those meanings. . | A Calculus for Semantic Composition and Scoping Fernando . Pereira Artificial Intelligence Center SRI International 333 Ravenswood Ave. Menlo Park CA 94025 USA Abstract Certain restrictions on possible scopings of quantified noun phrases in natural language are usually expressed in terms of formal constraints on binding at a level of logical form. Such reliance on the form rather than the content of semantic interpretations goes against the spirit of compositionality. I will show that those scoping restrictions follow from simple and fundamental facts about functional application and abstraction and can be expressed as constraints on the derivation of possible meanings for sentences rather than constraints of the alleged forms of those meanings. 1 An Obvious Constraint Treatments of quantifier scope in Montague grammar Montague 1973 Dowty et al. 1981 Cooper 1983 transformational grammar Reinhart 1983 May 1985 Heim 1982 Roberts 1987 and computational linguistics Hobbs and Shieber 1987 Moran 1988 have depended implicitly or explicitly on a constraint on possible logical forms to explain why examples1 such as 1 A woman who saw every man disliked him are ungrammatical and why in examples such as 2 Every man saw a friend of his 3 Every admirer of a picture of himself is vain the every. noun phrase must have wider scope than the a. noun phrase if the pronoun in each example is assumed to be bound by its antecedent. What exactly counts as bound anaphora varies between different accounts of the phenomena but the rough intuition is that semantically a bound pronoun plays the role of a variable bound by the logical form a quantifier of its antecedent. Example 1 above is then explained by noting that 1 In all the examples that follow the pronoun and its intended antecedent are italicized. As usual starred examples are supposed to be ungrammatical. its logical form would be something like w m saw w m disliked w m but this is ill-formed because variable m .

• Báo cáo khoa học
• A Calculus for Semantic
• Composition and Scoping
• Fernando C
• Pereira
• scientific reports
• model language
• process natural language
• Dialog Control
• Natural Language System
• Dialog Control in a Natural Language System
• Expanding the Horizons
• Natural Language Interfaces
• Phil Hayes
• PROSPECTS OR PRACTICAL
• NATURAL LANGUAGE SYSTEMS
• Workshops
• NATURAL LANGUAGE
• INTERACTION WITH MACHINES
• Long Papers
• COMPUTER INTEBFACE DESIGN MURRAY TUROFF DEPARTMENT OF COMPUTER
• IiVFORMATION SCIENCE IIEW JERSEY INSTITUTE OF TECHNOLOGY
• EVALUATION OF NATURAL LANGUAGE
• INTERFACES TO DATABASE SYSTEMS
• A PANEL DISCUSSION
• database query system
• J
• Norwood Crout
• INTERFACES TO DATA BASE SYSTEMS
• Bozena Henisz
• INTERPRETING NATURAL LANGUAGE
• DATABASE UPDATES
• S
• Jermld Kaplan Jim David
• TRANSPORTABLE NATURAL LANGUAGE
• INTERFACES TO DATABASES
• Gary G
• Hendrlx and William H
• Lewis
• DATABASES THEORETICAL
• TECHNICAL ISSUES
• TRANSPORTABLE NATURAL LANGUAGE INTERFACES
• PROBLEMS AND TECHNIQUES
• Barbara J
• Grosz
• THEORETICAL TECHNICAL ISSUES
• NATURAL LANGUAGE ACCESS TO DATABASES
• R
• Petrick
• Domain Independent
• Database Access Systems
• ISSUES IN NATURAL LANGUAGE
• ACCESS TO DATABASES
• A LOGIC PROGRAMMING PERSPECTIVE
• Sharon C
• Salveter David Maier
• PLANNING NATURAL LANGUAGE
• EXPRESSIONS REFERRING
• Douglas E
• Appelt
• THE TEXT SYSTEM
• NATURAL LANGUAGE GENERATION
• Kathleen R
• M
• MENTING A DATABASE
• KNOWLEDGE REPRESENTATION
• THE KEY TO THE SELECTION PROBLEM
• E
• Jeffrey Conklin David D
• McDonald
• A KNOWLEDGE ENGINEERING
• NATURAL LANGUAGE UNDERSTANDING
• Stuart C
• Shapiro
• NATURAL LANGUAGE TEXTS
• NECESSARILY GRAMMATICAL
• EVEN COMPLETE
• UNGRAMHATICALITY
• EXTRA GRAMMATICALITY
• NATURAL LANGUAGE UNDERSTANDING SYSTEMS
• Taxonomy
• Descriptions
• Individuals in Natural
• Language Understanding
• The Use of Ooject Special Knowledge
• Natural Language Processing
• Mark H
• Bursteln