Temporal Information Extraction by Predicting Relative Time-lines (D18-1)

Copied to clipboard

Challenge: a new paradigm for temporal information extraction from text evades the relation extraction phase because there are n 2 possible entity pairs in a text with n temporal entities.
Approach: They propose a method to construct a linear time-line from a set of temporal relations from text without the intermediate step of prediction of tempor relations.
Outcome: The proposed method predicts start and end-points without intermediate step of prediction of temporal relations . it evades phase 2 because there are n 2 possible entity pairs in the extraction phase .

Similar Papers

Utilizing Relative Event Time to Enhance Event-Event Temporal Relation Extraction (2021.emnlp-main)

Copied to clipboard

Challenge: Existing methods for event-event temporal relation extraction are sparse on event-time information.
Approach: They propose a model for event-event temporal relation classification and an auxiliary task, relative event time prediction, which predicts the event time as real numbers.
Outcome: The proposed model significantly improves the RoBERTa-based baseline and achieves state-of-the-art performance on MATRES dataset.
Joint Event and Temporal Relation Extraction with Shared Representations and Structured Prediction (D19-1)

Copied to clipboard

Challenge: Existing systems treat this task as a pipeline of two separate subtasks, i.e., event extraction and temporal relation classification.
Approach: They propose a joint event and temporal relation extraction model with shared representation learning and structured prediction.
Outcome: The proposed method improves both event extraction and temporal relation extraction over state-of-the-art systems.
Improving Temporal Relation Extraction with a Globally Acquired Statistical Resource (N18-1)

Copied to clipboard

Challenge: Existing temporal extraction systems that extract temporal relations can be improved by using a resource that provides prior knowledge of the temporal order that events usually follow.
Approach: They propose to use a probabilistic knowledge base acquired in the news domain to extract temporal relations between events from the New York Times articles over a 20-year span.
Outcome: The proposed system and resource are both publicly available.
DCT-Centered Temporal Relation Extraction (2022.coling-1)

Copied to clipboard

Challenge: Existing work on temporal relation extraction focuses on extracting temporal relations between events . previous work on relation extraction focused on focusing on event-centered tasks .
Approach: They propose a temporal relation extraction model that unifies events, timexes and DCT . they propose combining event mentions, time expressions and document creation time into a sentence-style model .
Outcome: The proposed model outperforms baselines on E-E, E-T and E-D significantly.
Severing the Edge Between Before and After: Neural Architectures for Temporal Ordering of Events (2020.emnlp-main)

Copied to clipboard

Challenge: Existing models for temporal ordering of events rely on pretrained representations, transfer and multitask learning, and self-training techniques.
Approach: They propose a neural architecture and a set of training methods for ordering events by predicting temporal relations by pre-training models.
Outcome: The proposed models can predict temporal relations between two pairs of events within a span of text and identify temporal relationships between them.
TIMELINE: Exhaustive Annotation of Temporal Relations Supporting the Automatic Ordering of Events in News Articles (2023.emnlp-main)

Copied to clipboard

Challenge: Existing temporal relation extraction models have low inter-annotator agreement due to lack of specificity of annotation guidelines . authors propose a method for annotating all temporal relations, including long-distance ones, which automates the process .
Approach: They propose a new annotation scheme that defines criteria for temporal relations to be annotated . scheme includes events even if they are not expressed as verbs, they argue .
Outcome: The proposed method reduces time and manual effort on the part of annotators.
An Improved Neural Baseline for Temporal Relation Extraction (D19-1)

Copied to clipboard

Challenge: Existing datasets are small and/or have low inter-annotator agreements.
Approach: They propose a new neural system that achieves 10% absolute accuracy improvement over the previous best system.
Outcome: The proposed system achieves 10% absolute improvement over the previous best system on two benchmark datasets.
Inducing Temporal Relations from Time Anchor Annotation (N18-1)

Copied to clipboard

Challenge: Existing methods for judging temporal relations are limited to “salient” event pairs or on pairs in a fixed window of sentences.
Approach: They propose a new method to obtain temporal relations from absolute time value (a.k.a. time anchors) they start from time anchor for events and time expressions and induced temporal relation annotations automatically .
Outcome: The proposed method shows that it requires less annotation effort and induces inter-sentence relations easily.
Context-Aware Neural Model for Temporal Information Extraction (P18-1)

Copied to clipboard

Challenge: Existing temporal information extraction systems rely on statistical learning with feature-engineered task-specific models.
Approach: They propose a context-aware neural network model for temporal information extraction using a global context layer.
Outcome: The proposed model outperforms existing models in terms of performance and performance . it is the first model to use NTM-like architecture to process the information from global context in discourse-scale natural text processing.
Extracting Temporal Event Relation with Syntax-guided Graph Transformer (2022.findings-naacl)

Copied to clipboard

Challenge: Temporal relationship extraction is crucial for understanding complex events and reasoning over them.
Approach: They propose a Syntax-guided Graph Transformer network to extract temporal relations between events by explicitly exploiting the connection between two events based on their dependency parsing trees.
Outcome: The proposed approach outperforms state-of-the-art methods on MATRES and TB-DENSE with up to 7.9% absolute F-score gain.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations