drawing timeml relations marc verhagen, brandeis university
Post on 19-Dec-2015
214 views
TRANSCRIPT
![Page 1: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/1.jpg)
Drawing TimeML Relations
Marc Verhagen, Brandeis University
![Page 2: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/2.jpg)
Outline
Visualization of TimeML graphs
1. Visualization history and future
2. Procedure to display TimeML relations
3. Consistency and drawability
4. What about disjunctions?
5. Temporal information in text widgets
![Page 3: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/3.jpg)
Drawing TimeML Relations
1. Visualization history and future
2. Procedure to display TimeML relations
3. Consistency and drawability
4. What about disjunctions?
5. Temporal information in text widgets
![Page 4: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/4.jpg)
Alembic (1)
![Page 5: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/5.jpg)
Alembic (2)
![Page 6: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/6.jpg)
Tango
![Page 7: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/7.jpg)
Other Efforts
• Using GraphViz (Luc Belanger)– Works nice for small samples, does not scale
up gracefully
• Event Diagram– Take one event and group all others around it
• Using Petri Nets (Natalia Kotsyba)– More boxes in representation than there are
events in the text
• Tango improvements (Nick Chubrich)– Color-coding, skirts
![Page 8: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/8.jpg)
Current Tango
![Page 9: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/9.jpg)
Future Tango
![Page 10: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/10.jpg)
Side by Side
![Page 11: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/11.jpg)
Drawing TimeML Relations
1. Visualization history and future
2. Procedure to display TimeML relations
3. Consistency and drawability
4. What about disjunctions?
5. Temporal information in text widgets
![Page 12: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/12.jpg)
Display Rules
Simultaneity
Precedence
Inclusion
Begins/Ends
![Page 13: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/13.jpg)
Display Rules - special case
One event is included by two other events that have no further relation to each other
![Page 14: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/14.jpg)
Example Fragments (1)
![Page 15: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/15.jpg)
Example Fragments (2)
![Page 16: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/16.jpg)
Drawing Procedure
![Page 17: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/17.jpg)
Input to Drawing Procedure
TimeML annotation that is maximal and consistent
![Page 18: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/18.jpg)
Temporal Closure (1)
• Consistency and maximality are guaranteed by temporal closure
• SputLink: temporal closure based on Allen’s interval algebra, but using restrictions from point algebra
• Implications for annotation task(in short: closure makes it feasible)
• Added as a module to Tango
![Page 19: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/19.jpg)
Temporal Closure (2)
![Page 20: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/20.jpg)
Reducing the Graph (1)
![Page 21: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/21.jpg)
Reducing the Graph (2)
![Page 22: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/22.jpg)
Reducing the Graph (3)
• Create equivalence classes
• Convert to basic set of relations:– before, ibefore, includes, begun_by,
ended_by– eliminates cycles
• Use temporal closure rules for reductions– [X ibefore Y] & [Z ended_by X] & [Z ibefore Y]
==> delete [X ibefore Y]
![Page 23: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/23.jpg)
The Reduced Graph
It’s a… directed acyclic graph
![Page 24: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/24.jpg)
Create Pseudo AVM
![Page 25: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/25.jpg)
Basic Mapping Rule
• Draw a bar for 0 in the top left corner • For every before attribute, remove the
attribute and draw an arrow from bar 0 to the drawing that is the value of before
• For every includes attribute, remove the attribute and move the value of the attribute to the box underneath 0, draw the box if there isn't one yet.
• If there are no more attributes in the box, remove the box (but keep the contents)
• Remove the label of the box if its ID is the same as the head of the drawing.
![Page 26: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/26.jpg)
Basic Mapping Rule at Work
![Page 27: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/27.jpg)
Merging Branches (1)
• There are three special cases for which we cannot use the basic mapping rule
Note that there are more cases when ibefore,begun_by and ended_by are included
![Page 28: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/28.jpg)
Merging Branches (2)
• Simply draw arrow if merging in a re-entrancy after a before relation
![Page 29: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/29.jpg)
Merging Branches (3)
• In some cases, arrows will go to the left, which is not allowed
• Simply move part of the drawing to the right
![Page 30: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/30.jpg)
Merging Branches (4)
• Event included by two events, relates to the special display rule
![Page 31: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/31.jpg)
Drawing TimeML Relations
1. Visualization history and future
2. Procedure to display TimeML relations
3. Consistency and drawability
4. What about disjunctions?
5. Temporal information in text widgets
![Page 32: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/32.jpg)
Consistency vs Drawability (1)
• Can any consistent graph be drawn?– Yes, see the drawing procedure– Need a more formal proof
• Can an inconsistent graph be drawn?– No, first step is to run closure– Yes perhaps, what about drawings that are
constructed differently?
![Page 33: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/33.jpg)
Consistency vs Drawability (2)
• Closure throws an inconsistency• Graph cannot be drawn
Inconsistent graph, but it can be drawn
![Page 34: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/34.jpg)
Drawing TimeML Relations
1. Visualization history and future
2. Procedure to display TimeML relations
3. Consistency and drawability
4. What about disjunctions?
5. Temporal information in text widgets
![Page 35: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/35.jpg)
Disjunctions (1)
• TimeML does not yet have disjunctions, but may need some soon
• Closure uses 29 relation types, 16 of them are disjunctions
• All those 16 disjunctions can be mapped to drawings
![Page 36: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/36.jpg)
Disjunctions (2)
![Page 37: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/37.jpg)
Disjunctions (3)
• Some disjunctions are still not available to us:“He got promoted on Wednesday or Friday”
• No neat way to localize or encapsulate disjunctions in TimeML graphs, but use multiple positions in TimeML drawings
![Page 38: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/38.jpg)
Consistency vs Drawability (3)
• Adding the disjunctions– Expanding the drawing procedure– Not necessarily a good idea to draw all
disjunctions– Does drawability now imply consistency?– Previous example cannot be drawn
![Page 39: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/39.jpg)
Drawing TimeML Relations
1. Visualization history and future
2. Procedure to display TimeML relations
3. Consistency and drawability
4. What about disjunctions?
5. Temporal information in text widgets
![Page 40: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/40.jpg)
Displaying TLinks in Text (1)
![Page 41: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/41.jpg)
Displaying TLinks in Text (2)
• Temporal information by color-coding events• Problem: if two events have the same color,
then you assume they are at the same time• Use a bar with a spectrum that spans the
whole TimeML graph in a document
Distinguish three bins: past, present and futureAssign parts of the spectrum to these bins
![Page 42: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/42.jpg)
Displaying TLinks in Text (3)
• Four kinds of events with simple scheme
past present future
unknown
• Scales up nicely when more precise information is available
![Page 43: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/43.jpg)
Drawing TimeML Relations
1. Visualization history and future
2. Procedure to display TimeML relations
3. Consistency and drawability
4. What about disjunctions?
5. Temporal information in text widgets
![Page 44: Drawing TimeML Relations Marc Verhagen, Brandeis University](https://reader036.vdocuments.us/reader036/viewer/2022081519/56649d365503460f94a0e822/html5/thumbnails/44.jpg)
Future Work
Yes