tailieunhanh - Báo cáo khoa học: "AN ALGORITHM FOR GENERATING NON-REDUNDANT QUANTIFIER SCOPINGS"

This paper describes an algorithm for generating quantifier scopings. The algorithm is designed to generate only logically non-redundant scopings and to partially order the scopings with a given :default scoping first. Removing logical redundancy is not only interesting per se, but also drastically reduces the processing time. The input and output formats are described through a few access and construction functions. Thus, the algorithm is interesting for a modular linguistic theory, which is flexible with respect to syntactic and semantic framework. . | AN ALGORITHM FOR GENERATING NON-REDUNDANT QUANTIFIER SCOPINGS Espen J. Vestre Department of Mathematics University of Oslo . Box 1053 Blindem N-0316 OSLO 3 Norway Internet espen@ ABSTRACT This paper describes an algorithm for generating quantifier scopings. Die algorithm is designed to generate only logically non-redundant scopings and to partially order the scopings with a given default scoping first. Removing logical redundancy is not only interesting per se but also drastically reduces the processing time. The input and output formats are described through a few access and construction functions. Thus the algorithm is interesting for a modular linguistic theory which is flexible with respect to syntactic and semantic framework. INTRODUCTION Natural language sentences like the notorious 1 Every man loves a woman are usually regarded to be scope ambiguous. There have been two ways to attack this problem To generate the most probable scoping and ignore the rest or to generate all theoretically possible scopings. Choosing the first alternative is actually not a bad solution since any sample piece of text usually contains few possibilities for real scope ambiguity and since reasonable heuristics in most cases pick out the intended reading. However there are cases which seem to be genuinely ambiguous or where the selection of the intended reading requires extensive world knowledge. If the second alternative is chosen there are basically two possible approaches To integrate the generation of scopings into the grammar like . in Johnson and Kay 90 or Halvorsen and Kaplan 88 or to devise a procedure that generates the scopings from the parse output like in Hobbs and Shieber 87 . In both cases only structurally impossible scopings are ruled out like the reading of 2 2 Every representative of a company saw most samples in which most samples is outscoped by every representative but outscopes a company Hobbs and Shieber 87 . Logically equivalent readings are

• Báo cáo khoa học
• AN ALGORITHM FOR GENERATING
• NON REDUNDANT QUANTIFIER SCOPINGS
• Espen J
• Vestre
• 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