Embedding Time Expressions for Deep Temporal Ordering Models (P19-1)

Copied to clipboard

Challenge: Existing data-driven models fail to capture explicit temporal signals, such as dates and time windows.
Approach: They propose a framework to infuse temporal awareness into data-driven models by learning a pre-trained model to embed timexes.
Outcome: The proposed framework infuses temporal awareness into data-driven models by learning a pre-trained model to embed timexes.

Similar Papers

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.
Extracting Event Temporal Relations via Hyperbolic Geometry (2021.emnlp-main)

Copied to clipboard

Challenge: Recent neural approaches to event temporal relation extraction map events to embeddings in the Euclidean space and train a classifier to detect temporal relations between event pairs.
Approach: They propose to embed events into hyperbolic spaces to model hierarchical structures . they propose to use hyperbolical embeddings to directly infer event relations .
Outcome: The proposed architecture is based on two approaches to encode events and their temporal relations in hyperbolic spaces.
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.
Time-dependent Entity Embedding is not All You Need: A Re-evaluation of Temporal Knowledge Graph Completion Models under a Unified Framework (2021.emnlp-main)

Copied to clipboard

Challenge: Various temporal knowledge graph (KG) completion models have been proposed . knowledge graphs are typically static and store facts in their current state .
Approach: They propose to use temporal embeddings and a score function to model temporal knowledge graphs . they classify the temporal embedded methods into two classes: timestamp and time-dependent .
Outcome: The proposed models outperform current models on ICEWS datasets with 3000 experiments and 13159 GPU hours.
ECOLA: Enhancing Temporal Knowledge Embeddings with Contextualized Language Representations (2023.findings-acl)

Copied to clipboard

Challenge: Existing enhancement approaches cannot be applied to temporal knowledge graphs (tKGs) existing enhancement approaches assume knowledge embedding is time-independent, whereas entity embedded in tKG models evolves .
Approach: They propose to use textual data to enhance temporal knowledge embedding by Enhanced Temporal Knowledge Embeddings with Contextualized Language Representations (ECOLA) to evaluate ECOLA, they introduce three new datasets for training and evaluation.
Outcome: The proposed model significantly improves Hits@1 on the link prediction task.
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.
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 .
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.
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.
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.

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