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

Slides:



Advertisements
Similar presentations
Lecture 3a Clause functions Adapted from Mary Laughren.
Advertisements

Referring Expressions: Definition Referring expressions are words or phrases, the semantic interpretation of which is a discourse entity (also called referent)
Ever feel like you’re not getting anywhere with your writing???
Syntactic Complexity and Cohesion
M. A. K. Halliday Notes on transivity and theme in English (4.2 – 4.5) Part 2.
Sentence Types.
Semantics (Representing Meaning)
Albert Gatt LIN3022 Natural Language Processing Lecture 11.
Curs 7: Teorii ale discursului Centering Dan Cristea Selecţie de slide-uri prezentate în tutoriale (RANLP-03, Borovits, Sept. 2003; ICON-04, Hyderabad,
Does Mr. Rochester hold any power or authority over Jane? Yes! He is her boss man. “…with Master- Mr. Rochester- he has just arrived.”
Business English.School of Business Administration Pntificia Universidad Catòlica de Valparaìso Past Perfect FORM Past Perfect [HAD] + [PAST PARTICIPLE]
Chapter 18 Faces The Internet Good to see you today.. Let’s review our previous lesson on last meeting..
GRAMMARAMA!!!! How exciting is this? Pronouns as subjects and objects.
Automatic Essay Scoring Evaluation of text coherence for electronic essay scoring systems (E. Miltsakaki and K. Kukich, 2004) Universität des Saarlandes.
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 –
Weak forms, strong forms. I can! She has! He was! I can leave! She has decided ! He was afraid.
Linguistic Theory Lecture 8 Meaning and Grammar. A brief history In classical and traditional grammar not much distinction was made between grammar and.
Introduction to Linguistics II Ling 2-121C, group b Lecture 8
CS 4705 Algorithms for Reference Resolution. Anaphora resolution Finding in a text all the referring expressions that have one and the same denotation.
Final Review CS4705 Natural Language Processing. Semantics Meaning Representations –Predicate/argument structure and FOPC Thematic roles and selectional.
ANAPHORA IN NATURAL LANGUAGE Aránzazu San Ginés Ruiz IHPST/U.Granada.
CS 4705 Lecture 21 Algorithms for Reference Resolution.
1 Special Electives of Comp.Linguistics: Processing Anaphoric Expressions Eleni Miltsakaki AUTH Fall 2005-Lecture 4.
Centering theory and its direct applications
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 2.
Matakuliah: G0922/Introduction to Linguistics Tahun: 2008 Session 10 Syntax 1.
July 2003LSA1 Computational Approaches to Reference Massimo Poesio (University of Essex) Lecture 4: Centering Theory.
1 Pragmatics: Discourse Analysis J&M’s Chapter 21.
Pragmatics I: Reference resolution Ling 571 Fei Xia Week 7: 11/8/05.
Verb Forms Base Form write 3rd Person Sg. writes Simple Past wrote
Pronoun Usage 4. Pronouns in comparisons Sometimes a comparison is made by using a clause that begins with than or as. Examples Fred is better at chess.
Introduction to English Syntax Level 1 Course Ron Kuzar Department of English Language and Literature University of Haifa Chapter 2 Sentences: From Lexicon.
Pragmatics Language in Context
12 Tenses of English grammar
Binding Theory Describing Relationships between Nouns.
Discourse and Syntax March 5, 2009 Thompson and Couper-Kuhlen. Clause as Locus of Interaction.
EL 111 Unit 12 Ms. Khadeeja Rabah Ms. Khadeeja Rabah.
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.
past simple vs. past CONTINUOUS
GrammaticalHierarchy in Information Flow Translation Grammatical Hierarchy in Information Flow Translation CAO Zhixi School of Foreign Studies, Lingnan.
Scenarios 1-6 Scenario 1 – Steve Scenario 2 – Marie Scenario 3 – Not so Popular Student… Scenario 4 – Cheerleading! Scenario 5 – Pharmacy Scenario 6 –
Unit 9 Can you come to my party? Language Goals: Make invitations Decline invitations accept invitations Talk about obligations.
1 Special Electives of Comp.Linguistics: Processing Anaphoric Expressions Eleni Miltsakaki AUTH Fall 2005-Lecture 7.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 8.
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.
Unit 5 What do you want to do?.
My good friends Chapter 1, Book 3B Primary Longman Express.
What makes a complete sentence? English I CP. What do you need to make a complete sentence? A subject and a predicate. End of story. Without these, you.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 2.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 3.
Scenarios 1-4 Scenario 1 – Steve Scenario 2 – Marie Scenario 3 – Not so Popular Student… Scenario 4 – Cheerleading!
1 Special Electives of Comp.Linguistics: Processing Anaphoric Expressions Eleni Miltsakaki AUTH Fall 2005-Lecture 5.
By group no What are Tenses ? Objective of Tenses In grammar, tense is a category that expresses time reference. Tenses are usually manifested.
How to Write Good Sentences Sentence Writing ( 1 ) Sentence Writing ( 1 )
Written by Patrick Skene Catling
DictionSyntax Style  Your diction is simply your choice of words. There is no single, correct diction in the English language; instead, you choose.
Subject & Object Pronouns L.6.1a – Ensure that pronouns are in the proper case. Jenn Roy Montegut Middle 6 th grade English.
Karla Valentina Muñoz. Who I am… Hola everybody!!! My name is Karla Valentina Munoz. I am 25 years old, and I have been married for almost 6 years. I.
Predicate Nominatives
Referring Expressions: Definition
Anaphora Resolution Spring 2010, UCSC – Adrian Brasoveanu
Algorithms for Reference Resolution
Dictation practice 5th Form Ms. Macarena – Ms. Romina.
Eleni Miltsakaki AUTH Fall 2005-Lecture 6
CS4705 Natural Language Processing
Introduction to Computational Linguistics
Dictation practice 5th Form Ms. Macarena – Ms. Romina.
Presentation transcript:

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

2 Main points from Lecture 2 Pronouns –Bound variables The man who 1 Mary likes t 1 The man who 1 t 1 talked to the boy who 2 t 2 visited him 1/*2 –Referring expressions John invited George for a drink. He told him it was his birthday. Background for Centering –Comes from two strands of work Centered logic (Joshi and Kuhn 1979) Discourse structure (Grosz and Sidner 1981) Centered logic –Makes n-ary predicates monadic by singling out one argument of the many that a predicate might have. –Facilitates inferencing Discourse structure –Linguistic structure –Intentional structure –Attentional state

3 What is Centering about? A theory that relates focus of attention, choice of referring expression and perceived coherence of utterances within a discourse segment

4 CT: Basic intuition Perceived difference in coherence due to attention structure: 1. a. John went to his favorite music store to buy a piano b. He had frequented the store for many years. c. He was excited that he could finally buy a piano. d. He arrived just as the store was closing for the day. 2. a. John went to his favorite music store to buy a piano. b. It was a store he had frequented for many years. c. He was excited that he could finally buy a piano. d. It was closing just as John arrived.

5 Garden paths 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

6 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.Tony was sick and furious at being woken up so early.

7 Basic definitions: Centers Centers –Forward-looking centers (Cfs) List of entities evoked in the current utterance (ranked) –Preferred center (Cp) The highest ranked entity in the list of forward-looking centers –Backward-looking center (Cb) The highest ranked entity in the previous utterance that is realized in the current utterance

8 Basic rules: Center ranking Ranking rule –Depends on the language –Grammatical hierarchy for English SUBJ>OBJ>OTHER

9 Example Mary loves music. –Cb=none –Cfs= MARY, MUSIC –Cp= MARY She plays the guitar –Cb= MARY –Cfs= MARY, GUITAR –Cp= MARY

10 Basic definitions: Center transitions Continue: the Cb in the current utterance is the same as in the previous utterance and it is also the Cp of the current utterance Retain: the Cb of the current utterance is the same as in the previous utterance but it is not realized as the Cp of the current utterance Smooth-Shift: the Cb of the current utterance is not the same as in the previous utterance but it is realized as the Cp of the current utterance Rough-Shift: the Cb of the current utterance is not the same as in the previous utterance and it is not realized as the Cp of the current utterance

11 Centering transitions

12 Example Assume the previous discourse was about Mary Mary loves music. –Cb=MARY –Cfs= MARY, MUSIC –Cp= MARY –Transition=none She plays the guitar –Cb= MARY –Cfs= MARY, GUITAR –Cp= MARY –Transition=Continue

13 Assume the previous discourse was about Mary Mary loves John. –Cb=MARY –Cfs= MARY, JOHN –Cp= MARY –Transition=none John loves her too. –Cb= MARY –Cfs= JOHN, MARY –Cp= JOHN –Transition=Retain

14 Assume the previous discourse was about Mary Mary loves John. –Cb=MARY –Cfs= MARY, JOHN –Cp= MARY –Transition=none John loves her too. –Cb= MARY –Cfs= JOHN, MARY –Cp= JOHN –Transition=Retain He is getting his math degree this year. –Cb= JOHN –Cfs= JOHN, MATH, DEGREE, MATH DEGREE, YEAR –Cp=JOHN –Transition: Smooth-Shift

15 Basic rules: Transition rule Continues are preferred over Retains Retains are preferred over Smooth-shifts Smooth-shifts are preferred over Rough- Shifts  Continue>Retain>Smooth-Shift>Rough- Shift

16 Basic rules: Pronoun rule Pronoun rule –If any element of the preceding utterance is realized as a pronoun then so is the backward looking center of the current utterance  Intuition: Backward-looking centers are pronominalized first

17 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

Mary likes Jane. She invited her for dinner. Jane accepted the invitation. > > > MaryJane Sheher Janeinvitation MaryJane Cp=Mary Sheher Cp=Mary JaneInvitation Cp=Jane Mary likes Jane. Cb=Mary She invited her for dinner. Cb=Mary Jane accepted the invitation. Cb=Jane Tr= CONTINUE Tr= SMOOTH-SHIFT Cb(Ui)=Cb(Ui-1)Cb(Ui)≠Cb(Ui-1) Cb(Ui)=Cp(Ui)ContinueSmooth-Shift Cb(Ui)≠Cp(Ui)RetainRough-Shift Applying the Centering model

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