1 Special Electives of Comp.Linguistics: Processing Anaphoric Expressions Eleni Miltsakaki AUTH Fall 2005-Lecture 4.

Slides:



Advertisements
Similar presentations
Kees van Deemter Matthew Stone Formal Issues in Natural Language Generation Lecture 4 Shieber 1993; van Deemter 2002.
Advertisements

Referring Expressions: Definition Referring expressions are words or phrases, the semantic interpretation of which is a discourse entity (also called referent)
M. A. K. Halliday Notes on transivity and theme in English (4.2 – 4.5) Part 2.
So different. too old so long because of him.
Evaluating Heuristics for the Fixed-Predecessor Subproblem of Pm | prec, p j = 1 | C max.
Albert Gatt LIN3022 Natural Language Processing Lecture 11.
Wednesday, January 29, 2003CSCE Spring 2003 B.Y. Choueiry Constraint Consistency Chapter 3.
Curs 7: Teorii ale discursului Centering Dan Cristea Selecţie de slide-uri prezentate în tutoriale (RANLP-03, Borovits, Sept. 2003; ICON-04, Hyderabad,
Discourse Analysis David M. Cassel Natural Language Processing Villanova University April 21st, 2005 David M. Cassel Natural Language Processing Villanova.
Statistical NLP: Lecture 3
Automatic Essay Scoring Evaluation of text coherence for electronic essay scoring systems (E. Miltsakaki and K. Kukich, 2004) Universität des Saarlandes.
1 Discourse, coherence and anaphora resolution Lecture 16.
Discourse Martin Hassel KTH NADA Royal Institute of Technology Stockholm
Ever feel like you’re not getting anywhere with your writing???
Anaphora Resolution Spring 2010, UCSC – Adrian Brasoveanu [Slides based on various sources, collected over a couple of years and repeatedly modified –
Chapter 18: Discourse Tianjun Fu Ling538 Presentation Nov 30th, 2006.
Albert Gatt LIN1180 – Semantics Lecture 10. Part 1 (from last week) Theories of presupposition: the semantics- pragmatics interface.
CS 4705 Algorithms for Reference Resolution. Anaphora resolution Finding in a text all the referring expressions that have one and the same denotation.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 4.
CS 4705 Lecture 21 Algorithms for Reference Resolution.
Centering theory and its direct applications
Natural Language Query Interface Mostafa Karkache & Bryce Wenninger.
July 2003LSA1 Computational Approaches to Reference Massimo Poesio (University of Essex) Lecture 4: Centering Theory.
1 Pragmatics: Discourse Analysis J&M’s Chapter 21.
Personal Characteristics Genetics Race Gender Age Personality.
Pragmatics I: Reference resolution Ling 571 Fei Xia Week 7: 11/8/05.
1 101 uses for information structure (It’s not just for prosody you know!) Taal- en spraaktechnologie Fall 2005 Lecture 2 Jennifer Spenader.
Pragmatics Language in Context
1 Special Electives of Comp.Linguistics: Processing Anaphoric Expressions Eleni Miltsakaki AUTH Fall 2005-Lecture 3.
A multiple knowledge source algorithm for anaphora resolution Allaoua Refoufi Computer Science Department University of Setif, Setif 19000, Algeria .
Reference in Dialogue Jens Stephan. What is Reference Some sort of Relation between Pele He That guy The best Soccer Player ever.
Discourse Read J & M Chapter More than One Sentence at a Time The alphas have a long-standing hatred of the betas. Their leaders have decided that.
Fiction Writing Plot and Structure. Basic Plot Structure Rising Action Climax Falling Action Resolution.
Chapter 6. Semantics is the study of the meaning of words, phrases and sentences. In semantic analysis, there is always an attempt to focus on what the.
A system for generating teaching initiatives in a computer-aided language learning dialogue Nanda Slabbers University of Twente Netherlands June 9, 2005.
August Discourse Structure and Anaphoric Accessibility Massimo Poesio and Barbara Di Eugenio with help from Gerard Keohane.
1 Special Electives of Comp.Linguistics: Processing Anaphoric Expressions Eleni Miltsakaki AUTH Fall 2005-Lecture 2.
EMPIRICAL INVESTIGATIONS OF ANAPHORA Massimo Poesio Università di Trento and University of Essex Vilem Mathesius Lectures Praha, 2007.
1 Learning Sub-structures of Document Semantic Graphs for Document Summarization 1 Jure Leskovec, 1 Marko Grobelnik, 2 Natasa Milic-Frayling 1 Jozef Stefan.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 4.
Coherence and Coreference Introduction to Discourse and Dialogue CS 359 October 2, 2001.
Avoiding Run-on Sentences, Comma Splices
1 Special Electives of Comp.Linguistics: Processing Anaphoric Expressions Eleni Miltsakaki AUTH Fall 2005-Lecture 7.
I.
Rules, Movement, Ambiguity
Sight Word List.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 1.
1 Special Electives of Comp.Linguistics: Processing Anaphoric Expressions Eleni Miltsakaki AUTH Fall 2005-Lecture 1.
Reference Resolution CMSC Discourse and Dialogue September 30, 2004.
Chapter 8. Situated Dialogue Processing for Human-Robot Interaction in Cognitive Systems, Christensen et al. Course: Robots Learning from Humans Sabaleuski.
1 Finite Model Theory Lecture 1: Overview and Background.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 2.
Support Vector Machines and Kernel Methods for Co-Reference Resolution 2007 Summer Workshop on Human Language Technology Center for Language and Speech.
Flexible Automatic Motion Blending with Registration Curves
1 Special Electives of Comp.Linguistics: Processing Anaphoric Expressions Eleni Miltsakaki AUTH Fall 2005-Lecture 5.
Reference Resolution CMSC Natural Language Processing January 15, 2008.
An evolutionary approach for improving the quality of automatic summaries Constantin Orasan Research Group in Computational Linguistics School of Humanities,
How to use Past Simple Tense By Miss Chonladda Phonklang Soengsang School.
Oxford Words
(plus a few notes on coreference in advance for Friday)
Statistical NLP: Lecture 3
Discourse Analysis & Grammar
Referring Expressions: Definition
CSCI 5832 Natural Language Processing
Information Structure and Prosody
Anaphora Resolution Spring 2010, UCSC – Adrian Brasoveanu
Algorithms for Reference Resolution
Eleni Miltsakaki AUTH Fall 2005-Lecture 6
CS4705 Natural Language Processing
Because and so.
Presentation transcript:

1 Special Electives of Comp.Linguistics: Processing Anaphoric Expressions Eleni Miltsakaki AUTH Fall 2005-Lecture 4

2 Main points on Centering What is it about? –A theory that relates focus of attention, choice of referring expression and perceived coherence of utterances within a discourse segment –Centering captures the difference in perceived text coherence due to attention structure Outline of the Centering model –Discourse  segments  utterances –Set of forward-looking centers, {Cf1, Cf2…} –Preferred center, Cp –Backward-looking center, Cb –Cf ranking (Sub>Obj>Other) –Ordering transitions Centering rules –Pronoun rule –Center transition rule

3 Centering transitions

4 Applying Centering to garden path 1.Terry really goofs sometimes. 2.Yesterday was a beautiful day and he was excited about trying out his new sailboat. 3.He wanted Tony to join him on a sailing expedition. 4.He called him at 6am. 5.He was sick and furious at being woken up so early

Historical development CT CT Complexity of inferencing Almost Monadic PC Attention Reference Coherence Alternatives Functional Linear Semantic Joshi&Kuhn 1979 Joshi&Weinstein 1981 G&S 1986 GJ&W 1986 G,J& W 1995 Strube&Kuhn 1996 Walker 1996 Stevenson et al 2000

6 Centering-based anaphora resolution The BFP algorithm (Brennan, Friedman and Pollard, 1987) Functional centering (Strube and Hahn 1996, 1997) The S-list algorithm (Strube 1998) RAFT/RAPR algorithm (Suri and McCoy 1994, Suri, McCoy and DeCristofaro 1999)

7 The BFP algorithm Assuming the Centering model, The BFP algorithm consists of three basic steps –Generate possible Cb-Cf combinations –Filter by constraints (e.g., contra-indexing, centering rules, etc) –Rank by transition orderings

8 Applying the BFP algorithm 1. Brennan drives an Alfa Romeo 2. She drives too fast. 3. Friedman races her on weekends. 4. She often beats her.

9 Centering analysis a la BFP

10 Shortcomings of the BFP algorithm Resolution error when Cb(Ui-1) is different from Cp(Ui-1) –Ellen-i saw Mary-j at school –Mary-j didn’t talk to her-i –She-j took her-j friends and walked away Ambiguity when Ui-1 is discourse initial –John gave a lot of his property to George –His current salary exceeded the average salary by a lot.

11 Functional Centering Cf ranking is based on functional information status Danes (1974) trichotomy –Given information  Cb –Theme  Cp –New information (rheme)  Elements of Ui not contained in Ui-1 Claim: Functional ranking is universal

12 More detailed Cf ranking Based on Prince’s familiarity scale (1981) –Hearer old: Evoked (E), Unused (U) –Hearer new: Brand-new (BN), Anchored brand new (Ba), Inferrable (I), Containing Inferrable (Ic)

13 Rambow’s diagnostic See relevant section in Miltsakaki 2002

14 Functional Centering analysis

15 The S-list algorithm Basics –No Cbs! –S-list: the list of salient discourse entities –S-list ranking criteria –Hearer-old > hearer-new The algorithm –The S-list is generated incrementally and is updated every time an anaphoric element is resolved –Resolution is done by looking-up in the S-list, starting from the highest ranked –Discourse entities from the S-list that are not realized in the current utterance are removed