Curs 8 Teoria nervurilor.

Slides:



Advertisements
Similar presentations
Computational language: week 10 Lexical Knowledge Representation concluded Syntax-based computational language Sentence structure: syntax Context free.
Advertisements

Justification-based TMSs (JTMS) JTMS utilizes 3 types of nodes, where each node is associated with an assertion: 1.Premises. Their justifications (provided.
Curs 11: Aşteptări şi satisfacerea lor în parsarea discursului Dan Cristea Selecţie de sliduri.
Processing of large document collections Part 6 (Text summarization: discourse- based approaches) Helena Ahonen-Myka Spring 2006.
1 Discourse, coherence and anaphora resolution Lecture 16.
Says who? On the treatment of speech attributions in discourse structure Gisela Redeker & Markus Egg University of Groningen.
Introduction to RST Rhetorical Structure Theory Maite Taboada and Manfred Stede Simon Fraser University / Universität Potsdam Contact:
Week 5a. Binding theory CAS LX 522 Syntax I. Structural ambiguity John said that Bill slipped in the kitchen. John said that Bill slipped in the kitchen.
1 Annotation Guidelines for the Penn Discourse Treebank Part B Eleni Miltsakaki, Rashmi Prasad, Aravind Joshi, Bonnie Webber.
Meaning and Language Part 1.
Comparing Fractions © Math As A Second Language All Rights Reserved next #6T Taking the Fear out of Math
Slide 1 Testing Multivariate Assumptions The multivariate statistical techniques which we will cover in this class require one or more the following assumptions.
CSC 8310 Programming Languages Meeting 2 September 2/3, 2014.
THIRD AND FOURTH GRADE NUMBER AND OPERATIONS: FRACTIONS
READING QUESTION TYPES
Curs 10: Veins Theory Discourse structure and coherence Dan Cristea Selecţie de sliduri.
Problem of the DAY Create a regular context-free grammar that generates L= {w  {a,b}* : the number of a’s in w is not divisible by 3} Hint: start by designing.
Module 1 Unit 2 Project: writing an advice letter --By Zhou Zhenghu No
1 DO NOW  Copy your homework: Finish writing your note cards and adding transitions to your speech. Practice your speech and keep up with you reading.
Quantifying the dynamics of Binary Search Trees under combined insertions and deletions BACKGROUND The complexity of many operations on Binary Search Trees.
Binding Theory Describing Relationships between Nouns.
Design contex-free grammars that generate: L 1 = { u v : u ∈ {a,b}*, v ∈ {a, c}*, and |u| ≤ |v| ≤ 3 |u| }. L 2 = { a p b q c p a r b 2r : p, q, r ≥ 0 }
An Intelligent Analyzer and Understander of English Yorick Wilks 1975, ACM.
Chapter 11 Heap. Overview ● The heap is a special type of binary tree. ● It may be used either as a priority queue or as a tool for sorting.
Scientific Communication
1 LIN 1310B Introduction to Linguistics Prof: Nikolay Slavkov TA: Qinghua Tang CLASS 24, April 3, 2007.
Today we will identify fractions on a number line. ✓ identify- locate; find ✓ represent- draw and label ✓ fraction - represents part of a whole or part.
Sentence Fragments and Run-Ons This PowerPoint presentation will review the basics of correct sentence structure and help you to identify and correct Sentence.
B-TREE. Motivation for B-Trees So far we have assumed that we can store an entire data structure in main memory What if we have so much data that it won’t.
Yule: “Words themselves do not refer to anything, people refer” Reference and inference Pragmatics: Reference and inference.
the Past Perfect tense What is this tense and when do we use it in English?
Mearns Primary Reading Guidance for Parents. Reading aloud to your child Research has shown that reading aloud to children of all ages helps them to develop.
THE HAMBURGER ANALOGY WRITING A JUICY PARAGRAPH. TOO PLAIN… NOT VERY APPEALING Good writing includes several important elements just like a good burger.
© Worth Weller; M. Stadnycki. Your essays must be your own words with your own thoughts and your own voice. However, quoting sources in your essays: 
1 Context-Free Languages & Grammars (CFLs & CFGs) Reading: Chapter 5.
Introduction to RST (Rhetorical Structure Theory)
3.3 Fundamentals of data representation
Mr Lister’s Maths Notes
Digital Logic & Design Dr. Waseem Ikram Lecture 02.
Textbook:Modern Compiler Design
Types of Families Grade 9 Religion.
Table-driven parsing Parsing performed by a finite state machine.
COMPUTING FUNDAMENTALS
Syntax Analysis Chapter 4.
Common Core Math I Unit 1: One-Variable Statistics Boxplots, Interquartile Range, and Outliers; Choosing Appropriate Measures.
Coordination as a non-headed construction In a coordination, two or more elements of equal status are joined to make a larger unit. Special words called.
Algebra 1. Rules of Algebra
Reading Guidance for Parents
Referring Expressions: Definition
Reading Comprehension Questions
Structural relations Carnie 2013, chapter 4 Kofi K. Saah.
Probabilistic and Lexicalized Parsing
Copyright © 2017, 2013, 2009 Pearson Education, Inc.
Machine Learning in Practice Lecture 11
Chapter 2: A Simple One Pass Compiler
Thinking about grammars
Digital Logic & Design Lecture 02.
Binding theory.
Fundamentals of Data Representation
Use Model Drawing Procedure in Four-Step Process
English parts of speech
How to Avoid Redundant Object-References
Data Structures Sorted Arrays
The of and to in is you that it he for was.
Mr Barton’s Maths Notes
A Path-based Transfer Model for Machine Translation
Pragmatics: Reference and inference
Thinking about grammars
The Practice of Statistics, 4th edition STARNES, YATES, MOORE
COMPILER CONSTRUCTION
Presentation transcript:

Curs 8 Teoria nervurilor

Veins over discourse structure (Veins Theory – VT) (Cristea, Ide and Romary, 1998) to offer a better understanding of the relationship between discourse structure and referentiality to accommodate the left satellite problem to be independent of segment granularity to generalise Centering from local to global to allow summarization and, especially, focused summaries to assist anaphora resolution processes to guide discourse parsing

Are you comfortable with finding a referent for it in unit 3? 1. With one year before finishing his mandate as president of the company, 2. Mr. W. Ross has begun to bring about its bankruptcy. 3. There were rumors that he has obtained it by fraud.

Are you comfortable with finding a referent for it in unit 3? 1. With one year before finishing his mandate as president of the company, 2. Mr. W. Ross has begun to bring about its bankruptcy. *3. There were rumors that he has obtained it by fraud.

How about now? 1. Mr. W. Ross has begun to bring about the bankruptcy of his company. 2. with one year before finishing his mandate as president. 3. There were rumors that he has obtained it by fraud.

How about now? 1. Mr. W. Ross has begun to bring about the bankruptcy of his company. 2. with one year before finishing his mandate as president. 3. There were rumors that he has obtained it by fraud.

How many of you think that she in unit 4 refers John’s mother? 1 John told Mary that he loves her. 2. He has never been married 3. and lived until his 40s with his mother. 4. She, on the contrary, was married twice. If you think this happens because of the linearly smaller distance with the correct antecedent, than look at this…

Discourse structure modifies the distance between anaphor and antecedent 1 John told Mary that he loves her. 2. He has never been married 3. and lived until his 40s with his mother. 4. She, on the contrary, was married twice. 24 Why is that? antithesis 2 4

Discourse structure modifies the distance between anaphor and antecedent 1 John told Mary that he loves her. 2. He has never been married 3. and lived until his 40s with his mother. 4. She, on the contrary, was married twice. 14 elaboration Why is that? 24 1 antithesis 2 4

A satellite can access a far nucleus… 1 John told Mary that he loves her. 2. He has never been married 3. and lived until his 40s with his mother. 4. She, on the contrary, was married twice. 14 elaboration 1 antithesis elaboration 4 2 3

… but not another satellite 1 John told Mary that he loves her. 2. He has never been married 3. and lived until his 40s with his mother. 4. She, on the contrary, was married twice. 14 elaboration 1 antithesis elaboration 4 2 3

A nucleus blocks the access between two satellites… 1. With one year before finishing his mandate as president of the company, 2. Mr. W. Ross has begun to bring about its bankruptcy. 3. There were rumors that he has obtained it by fraud. 13 circumstance background 1 2 3

… and a satellite can access its nucleus 1. Mr. W. Ross has begun to bring about the bankruptcy of his company. 2. with one year before finishing his mandate as president. 3. There were rumors that he has obtained it by fraud. 13 circumstance 1 background 2 3

Fundamental assumption in VT An inter-unit reference is possible only the two units are in a structural relation one with the other The nucleus-satellite distinction together with discourse structure gives indications on the range of referents to which an anaphor can be resolved

VT´s basics a discourse structure can be represented by a (binary) tree a terminal node (unit) – a span of text, syntactically a sentence or clause an intermediate level node (relation) – a span of text that has a structure of its own nodes are marked: nuclei (most important) and satellites (less important) relation names are ignored

Trees as in RST 1 4 2 3 relations units nuclear

The definitions of VT: heads Head expression of a node: the sequence of the most important units within the corresponding span of text: the head of a terminal node: its label the head of a non-terminal node: the concatenation of the head expressions of the nuclear children the important units are projected up to the level where the corresponding span is seen as a satellite

Head expressions are computed bottom-up H=a c H=c b a c H=a H=c H=a H=b

Veins Vein expression of a node: the sequence of units that are required to understand the span of text covered by the node, in the context of the whole discourse to understand a piece of text in the context of the whole discourse one needs the significant units within the span together with other surrounding units

Veins Vein expressions are computed top-down starting with the root the vein expression of the root is its head expression H=h V=h Before: the vein expression of the root must be the sequence of units necessary to understand the whole text  equal to the head expression.

Vein expressions A nuclear node with no satellites to the left V=v V=v If one knows the sequence of nodes necessary to understand the span of text covered by the father node in the context of the whole discourse, then in order to understand a nuclear subspan of that span (therefore important in this context) and that has no satellite span to its left within the surrounding span, the same sequence is necessary. V=v

Vein expressions A nuclear node with left satellites V=v H=h To understand a span of text covered by a nuclear node that has a satellite span to its left one must make use also of the most important units of this left sibling span (just as if temporarily rising this left sibling to the state of a nucleus). As will be seen further „temporarily“ here means: to understand the nuclei within the nuclear span, one will make use of this sequence of units, but if one nucleus occures – it blocks the accessibility of the subsequent satelittes to the sibling left satellite span. V=seq(mark(h), v)

Vein expressions A satellite node on the left V=v H=h V=seq(h, v) To understand a satellite span to the left of a nuclear span within a larger span, one would have to make use of the most important units within the satellite span together with the units that give the understanding of the surrounding span. V=seq(h, v)

Vein expressions A satellite node on the right V=v H=h To understand a satellite span to the right of a nuclear span within a larger span, as in the previous case one would have to make use of the most important units within the satellite span together with the units that give the understanding of the surrounding span, but from where the „marked“ units will have to be withdrawn. Lets remember that the marked units, where „temporarily“ considered as significant for the understanding of the surrounding span as long as nuclear subspans were to be interpreted. V= seq(h, simpl(v))

Example of simplification V0=v V1=seq(mark(h1), v) H=h1 H=h2 V= seq(h2, simpl(V1))

Example of simplification V0=v V1=seq(mark(h1), v) H=h1 H=h2 V= seq(h2, simpl(seq(mark(h1), v)))

Example of simplification V0=v V1=seq(mark(h1), v) H=h1 H=h2 V= seq(h2, simpl(seq(mark(h1), v)))

Example of simplification V0=v V1=seq(mark(h1), v) H=h1 H=h2 V= seq(h2, seq(v))

Example of simplification V0=v V1=seq(mark(h1), v) H=h1 H=h2 V= seq(h2, seq(v))

Example of simplification V0=v V1=seq(mark(h1), v) H=h1 H=h2 V= seq(h2, v)

Consider the text: John sold his bicycle although Bill would have wanted it. He obtained a good price for it, which Bill could not have afforded. Therefore he decided to use the money to go on a trip.

Computing the veins of John and Bill 1. John sold his bicycle 2. although Bill would have wanted it. 3. He obtained a good price for it, 4. which Bill could not have afforded. 5. Therefore he decided to use the money to go on a trip. H=1 3 5 V=1 3 5 1 2 3 4 5 H=1 3 H=5 V=1 3 5 H=1 V=1 3 5 V=1 3 5 H=3 V=1 3 5 H=1 V=1 3 5 H=4 H=2 H=3 V=1 3 4 5 V=1 2 3 5 V=1 3 5

Computing the veins of John and Bill 1. John sold his bicycle 2. although Bill would have wanted it. 3. He obtained a good price for it, 4. which Bill could not have afforded. 5. Therefore he decided to use the money to go on a trip. 1 2 3 4 5 V=1 3 5 V=1 3 5 V=1 3 4 5 V=1 2 3 5 V=1 3 5