REFERENTIAL CHOICE: FACTORS AND MODELING Andrej A. Kibrik, Mariya V. Khudyakova, Grigoriy B. Dobrov, and Anastasia S. Linnik Night Whites.

Slides:



Advertisements
Similar presentations
PDAs Accept Context-Free Languages
Advertisements

3.6 Support Vector Machines
Chapter 1 The Study of Body Function Image PowerPoint
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
and 6.855J Spanning Tree Algorithms. 2 The Greedy Algorithm in Action
Describing Data: Measures of Dispersion
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 2 Q 3 Q 4 Q 5 Q 6Q 16Q 11Q 21 Q 7Q 12Q 17Q 22 Q 8Q 13Q 18 Q 23 Q 9 Q 14Q 19Q 24 Q 10Q 15Q 20Q 25 Final Jeopardy Writing Terms.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
CALENDAR.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Year 6 mental test 5 second questions
Year 6 mental test 10 second questions
Lecture 2 ANALYSIS OF VARIANCE: AN INTRODUCTION
CS1512 Foundations of Computing Science 2 Week 3 (CSD week 32) Probability © J R W Hunter, 2006, K van Deemter 2007.
Database Design: ER Modelling (Continued)
The 5S numbers game..
Solve Multi-step Equations
Richmond House, Liverpool (1) 26 th January 2004.
A Fractional Order (Proportional and Derivative) Motion Controller Design for A Class of Second-order Systems Center for Self-Organizing Intelligent.
Randomized Algorithms Randomized Algorithms CS648 1.
ABC Technology Project
Chapter 9 -- Simplification of Sequential Circuits.
3 Logic The Study of What’s True or False or Somewhere in Between.
Hash Tables.
5-1 Chapter 5 Theory & Problems of Probability & Statistics Murray R. Spiegel Sampling Theory.
Capacity Planning For Products and Services
1 Undirected Breadth First Search F A BCG DE H 2 F A BCG DE H Queue: A get Undiscovered Fringe Finished Active 0 distance from A visit(A)
Green Eggs and Ham.
VOORBLAD.
Name Convolutional codes Tomashevich Victor. Name- 2 - Introduction Convolutional codes map information to code bits sequentially by convolving a sequence.
2009 Foster School of Business Cost Accounting L.DuCharme 1 Determining How Costs Behave Chapter 10.
1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
1 CS 391L: Machine Learning: Rule Learning Raymond J. Mooney University of Texas at Austin.
The world leader in serving science TQ ANALYST SOFTWARE Putting your applications on target.
BIOLOGY AUGUST 2013 OPENING ASSIGNMENTS. AUGUST 7, 2013  Question goes here!
Factor P 16 8(8-5ab) 4(d² + 4) 3rs(2r – s) 15cd(1 + 2cd) 8(4a² + 3b²)
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
Machine Learning: Intro and Supervised Classification
© 2012 National Heart Foundation of Australia. Slide 2.
Lecture plan Outline of DB design process Entity-relationship model
Chapter 6: ER – Entity Relationship Diagram
Understanding Generalist Practice, 5e, Kirst-Ashman/Hull
25 seconds left…...
Slippery Slope
Is it Mathematics? Linking to Content Standards. Some questions to ask when looking at student performance Is it academic? – Content referenced: reading,
1 Non Deterministic Automata. 2 Alphabet = Nondeterministic Finite Accepter (NFA)
1 Minimally Supervised Morphological Analysis by Multimodal Alignment David Yarowsky and Richard Wicentowski.
H to shape fully developed personality to shape fully developed personality for successful application in life for successful.
Chapter 2 Entity-Relationship Data Modeling: Tools and Techniques
Januar MDMDFSSMDMDFSSS
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
PSSA Preparation.
Essential Cell Biology
Weekly Attendance by Class w/e 6 th September 2013.
Simple Linear Regression Analysis
Correlation and Linear Regression
Multiple Regression and Model Building
Self-training with Products of Latent Variable Grammars Zhongqiang Huang, Mary Harper, and Slav Petrov.
© 2014 Fair Isaac Corporation. Confidential. This presentation is provided for the recipient only and cannot be reproduced or shared without Fair Isaac.
User Defined Functions Lesson 1 CS1313 Fall User Defined Functions 1 Outline 1.User Defined Functions 1 Outline 2.Standard Library Not Enough #1.
1 Non Deterministic Automata. 2 Alphabet = Nondeterministic Finite Accepter (NFA)
Chapter 9: Using Classes and Objects. Understanding Class Concepts Types of classes – Classes that are only application programs with a Main() method.
A CORPUS-BASED STUDY OF REFERENTIAL CHOICE: Multiplicity of factors and machine learning techniques Andrej A. Kibrik, Grigorij B. Dobrov, Mariya V. Khudyakova,
REFERENTIAL CHOICE AS A PROBABILISTIC MULTI-FACTORIAL PROCESS Andrej A. Kibrik, Grigorij B. Dobrov, Natalia V. Loukachevitch, Dmitrij A. Zalmanov
Presentation transcript:

REFERENTIAL CHOICE: FACTORS AND MODELING Andrej A. Kibrik, Mariya V. Khudyakova, Grigoriy B. Dobrov, and Anastasia S. Linnik Night Whites SPb February 28, 2014

2 22 Referential choice in discourse When a speaker needs to mention (or refer to) a specific, definite referent, s/he chooses between several options, including: Full noun phrase Proper name (e.g. Peter) Description = common noun (with or without modifiers) (e.g. the tzar) Mix: Peter the Great Reduced NP, particularly a third person pronoun (e.g. he)

3 Example The Victorian house that Ms. Johnson is inspecting has been deemed unsafe by town officials. But she asks a workman toting the bricks from the lawn to give her a boost through an open first-floor window. Once inside, she spends nearly four hours Ø measuring and diagramming each room in the 80-year-old house, Ø gathering enough information to Ø estimate what it would cost to rebuild it. She snaps photos of the buckled floors and the plaster that has fallen away from the walls. DescriptionProper namePronoun Zero

4 Research question How is referential choice made?

5 Why is this question important? Reference is among the most basic cognitive operations performed by language users Reference constitutes a lions share of all information in natural communication Consider text manipulation according to the method of Biber et al. 1999:

6 Referential expressions marked in green The Victorian house that Ms. Johnson is inspecting has been deemed unsafe by town officials. But she asks a workman toting the bricks from the lawn to give her a boost through an open first-floor window.

7 Referential expressions removed The Victorian house that Ms. Johnson is inspecting has been deemed unsafe by town officials. But she asks a workman toting the bricks from the lawn to give her a boost through an open first-floor window.

8 Referential expressions kept The Victorian house that Ms. Johnson is inspecting has been deemed unsafe by town officials. But she asks a workman toting the bricks from the lawn to give her a boost through an open first-floor window.

9 Types of referential devices: levels of granularity We mostly concentrate on the two upper levels in this hierarchy REG tradition: most attention to varieties of descriptive full NPs

10 Multi-factorial character of referential choice Multiple factors of referential choice Distance to antecedent Along the linear discourse structure (Givón) Along the hierarchical discourse structure (Fox, Kibrik) Antecedent role (Centering theory) Referent animacy (Dahl) Protagonisthood (Grimes) Properties of the discourse context Properties of the referent

11 Cognitive multi-factorial model of referential choice Discourse context Referent activation in working memory Referents properties Referential choice Factors of referential choice

12 Rhetorical distance Distance along the hierarchical discourse structure between the current point in discourse, where referential choice is to be made the antecedent Measured in elementary discourse units roughly equaling clauses Rhetorical structure theory by Mann and Thompson (RST) Very important factor RST Discourse Treebank corpus (Marcu et al.)

13 Example of a rhetorical graph from RST Discourse Treebank

14 RefRhet and MoRA RST Discourse Treebank + our annotation = RefRhet corpus Subcorpus RefRhet 3 ( ) Annotation scheme MoRA (Moscow Referential Annotation)

15 RefRhet 3 64 texts 6294 markables 1852 anaphor-antecedent pairs 475 pronouns 1377 full NPs 706 descriptions 671 proper names

16 Candidate factors of ref. choice Some values are drawn from MoRA annotation Some other are computed automatically Factor-predicted variable Discourse context

17 Windows of the MMAX2 program

18 Some properties of the MoRA scheme Wide range of activation factors and their values E.g. multiple values of the grammatical role factor Annotation of groups complex markables serving as antecedents and-coordinate or-coordinate prepositional (children with their parents) discontinuous

19 A discontinuous group

20 Tasks for machine learning Candidate factors: All potential parameters implemented in corpus annotation Factor-predicted variable: Form of referential expression (np_form) Two-way task: Full NP vs. pronoun Three-way task: Definite description vs. proper name vs. pronoun Accuracy maximization: Ratio of correct predictions to the overall number of instances

21 Machine learning methods (Weka, a data mining system) Logical algorithms Decision trees (C4.5) Decision rules (JRip) Logistic regression Compositions Boosting Bagging Quality control – the cross-validation method

22 Results of machine learning on RefRhet 3 and MoRA Algorithm Accuracy two-way Accuracy two-way (2012) Accuracy three-way Baseline (frequency of the most common ref. option) 74,4% 37,9% Logistic regression87,2%71,3% Decision tree algorithm93,7% 86,1% 74,0% Bagging89,4% 88,0% 76,1% Boosting89,5% 86,2% 74,0%

23 Non-categorical referential choice (Kibrik 1999) min Referent activation max Cognitive plane: graded variable Linguistic plane: binary variable full NP Peter pronoun he

24 Non-categorical referential choice In many instances, more than one referential options can be used Referential choice is less than fully categorical (cf. Belz & Varges 2007, van Deemter et al. 2012: 173–179) In the intermediate activation instances both the original text author and the algorithm: more or less randomly make a categorical decision at the linguistic plane those decisions do not have to always coincide Therefore, no model can predict the actual referential choice with 100% accuracy

25 Experiment: Understanding (allegedly non-categorical) referential expressions 9 texts, in which the algorithms have diverged in their prediction from the original referential choice 9 original texts (proper name) and 9 altered texts (pronoun) distributed between 2 experimental lists 60 participants 1 experimental question + 2 control question If the instances of divergence are explained by intermediate referent activation, the accuracy in experimental questions should not be lower than the accuracy in control questions 25

26 Control questions – 84% Questions to proper names – 84% Questions to pronouns – 75% If we exclude questions #2 and #5, then the accuracy for questions to pronouns is 80%, not differing significantly from control and PN questions In general, the algorithm diverges from the original in the places where that is acceptable, that is, referent activation is intermediate Experiment: results 26

27 Non-categorical referential choice Sometimes referential choice allows more than one option A proper model of referential choice must account for this property of human speakers Our modeling procedures actually conform to this requirement

28 Further studies Explore logistic regressions ability to evaluate the certainty of prediction and attempt to correlate that with the humans assessment of non-categorical referential choice as well as with the theoretical notion of intermediate referent activation Cheap data modeling Secondary referential options, such as demonstrative descriptions Genres and referential choice

29 Conclusions Multi-factorial approach Corpus large enough for machine-learning modeling Results of prediction close to theoretical maximum Account of the non-deterministic character of referential choice This approach can be applied to a wide range of other linguistic choices

30 Thank you for your attention