Automated Prediction of Temporal Relations
Amol S Patwardhan, Jacob Badeaux, Siavash, Gerald M Knapp

TL;DR
This paper presents an automated method for predicting temporal relations between events and times in news documents, aiming to improve accuracy and efficiency over manual annotation methods.
Contribution
It introduces decision tree and parsing techniques to automate and enhance the accuracy of temporal relationship tagging in TimeML-annotated news texts.
Findings
Improved accuracy in temporal relation classification.
Reduced complexity in relationship tagging.
Automated approach outperforms previous machine learning methods.
Abstract
Background: There has been growing research interest in automated answering of questions or generation of summary of free form text such as news article. In order to implement this task, the computer should be able to identify the sequence of events, duration of events, time at which event occurred and the relationship type between event pairs, time pairs or event-time pairs. Specific Problem: It is important to accurately identify the relationship type between combinations of event and time before the temporal ordering of events can be defined. The machine learning approach taken in Mani et. al (2006) provides an accuracy of only 62.5 on the baseline data from TimeBank. The researchers used maximum entropy classifier in their methodology. TimeML uses the TLINK annotation to tag a relationship type between events and time. The time complexity is quadratic when it comes to tagging…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Text Analysis Techniques · Time Series Analysis and Forecasting · Topic Modeling
