TAILIEUCHUNG - Báo cáo khoa học: "Resolving Discourse Deictic Anaphora in Dialogues"

Most existing anaphora resolution algorithms are designed to account only for anaphors with NP-antecedents. This paper describes an algorithm for the resolution of discourse deictic anaphors, which constitute a large percentage of anaphors in spoken dialogues. The success of the resolution is dependent on the classification of all pronouns and demonstratives into individual, discourse deictic and vague anaphora. Finally, the empirical results of the application of the algorithm to a corpus of spoken dialogues are presented. spoken language cannot succeed without taking this into account. Summarised below are some issues specific to anaphora resolution in spoken dialogues (see also. | Proceedings of EACL 99 Resolving Discourse Deictic Anaphora in Dialogues Miriam Eckert Michael Strube Institute for Research in Cognitive Science University of Pennsylvania 3401 Walnut Street Suite 400A Philadelphia PA 19104 USA miriame strube @ Abstract Most existing anaphora resolution algorithms are designed to account only for anaphors with NP-antecedents. This paper describes an algorithm for the resolution of discourse deictic anaphors which constitute a large percentage of anaphors in spoken dialogues. The success of the resolution is dependent on the classification of all pronouns and demonstratives into individual discourse deictic and vague anaphora. Finally the empirical results of the application of the algorithm to a corpus of spoken dialogues are presented. 1 Introduction Most anaphora resolution algorithms are designed to deal with the co-indexing relation between anaphora and NP-antecedents. In the spoken language corpus we examined - the Switchboard corpus of telephone conversations LDC 1993 - this type of link only accounts for of all anaphoric references. Another are anaphora whose referents are not individual concrete entities but events facts and propositions . 1 We never know what they re thinking j. Thati s right. I don t trust them j maybe I guess itj s because of what happened over there with their own people how they threw them out of power. sw3241 Whilst there have been attempts to classify abstract objects and the rules governing anaphoric reference to them Webber 1991 Asher 1993 Dahl and Hellman 1995 there have been no exhaustive empirical studies using actual resolution algorithms. These have so far only been applied to written corpora. However the high frequency of absưact object anaphora in dialogues means that any attempt to resolve anaphora in spoken language cannot succeed without taking this into account. Summarised below are some issues specific to anaphora resolution in spoken dialogues .

• Báo cáo khoa học
• Resolving Discourse Deictic
• Anaphora in Dialogues
• Long Papers
• 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
• 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