Challenge: Existing methods for Coreference Resolution rely on word embeddings for word representation, but performance of different embeddables is largely overlooked.
Approach: They frame their study in the context of Event and Entity Coreference Resolution (EvCR & EnCR) they examine whether there is a trade-off between performance and embedding size .
Outcome: The embeddings achieve 86% of the performance of the largest model while being 1.2% of its size.

Similar Papers

On the Influence of Coreference Resolution on Word Embeddings in Lexical-semantic Evaluation Tasks (2020.lrec-1)

Copied to clipboard

Challenge: Existing word embeddings rely on local information delimited by context windows or dependency parents to predict word relations.
Approach: They propose to use coreference resolution to find all spans of a text that refer to the same entity to improve the F1-Scores.
Outcome: The proposed methods do not benefit significantly from pronoun substitution.
Revisiting Joint Modeling of Cross-document Entity and Event Coreference Resolution (P19-1)

Copied to clipboard

Challenge: Recognizing that various textual spans across multiple texts refer to the same entity or event is an important NLP task.
Approach: They propose a neural architecture for cross-document coreference resolution by representing an event mention using its lexical span, surrounding context, and relation to other mentions via predicate-arguments structures.
Outcome: The proposed model outperforms the state-of-the-art event coreference model on ECB+ while providing the first entity coreference results on this corpus.
Evaluating the Impact of a Hierarchical Discourse Representation on Entity Coreference Resolution Performance (2021.naacl-main)

Copied to clipboard

Challenge: Recent work on entity coreference resolution (CR) follows current trends in Deep Learning . traditional approaches do not make use of hierarchical representations of discourse structure .
Approach: They propose to leverage automatically constructed discourse parse trees within a neural approach to generate anaphoric mentions.
Outcome: The proposed model improves on two benchmark entity coreference-resolution datasets.
What’s in Your Embedding, And How It Predicts Task Performance (C18-1)

Copied to clipboard

Challenge: Attempts to find a single technique for general-purpose intrinsic evaluation of word embeddings have so far not been successful.
Approach: They propose a method that quantifies interpretable characteristics of word vector neighborhoods and shows how they correlate with performance on 14 extrinsic and intrinsic task datasets.
Outcome: The proposed approach enables multi-faceted evaluation, parameter search, and generally – a more principled, hypothesis-driven approach to development of distributional semantic representations.
Contrastive Representation Learning for Cross-Document Coreference Resolution of Events and Entities (2022.naacl-main)

Copied to clipboard

Challenge: Identifying related entities and events within and across documents is fundamental to natural language understanding.
Approach: They propose an approach to entity and event coreference resolution using contrastive representation learning.
Outcome: The proposed method achieves state-of-the-art results on key metrics on the ECB+ corpus and is competitive on others.
Towards Consistent Document-level Entity Linking: Joint Models for Entity Linking and Coreference Resolution (2022.acl-short)

Copied to clipboard

Challenge: Existing approaches to solve entity linking (EL) jointly with coreference resolution (coref) a coreferenced cluster can only be linked to a single entity or NIL (i.e., a nonlinkable entity)
Approach: They propose to join entity linking and coreference resolution in a single structured prediction task over directed trees and use a globally normalized model to solve it.
Outcome: The proposed model improves on two datasets with a +5% boost in accuracy compared to standalone models . the proposed model is based on current models that predict a single antecedent for each span to resolve .
Entity or Relation Embeddings? An Analysis of Encoding Strategies for Relation Extraction (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to relation extraction use concatenating embeddings of head and tail entities . however, such representations capture the types of the entities involved, leading to false positives and confusion between relations involving entities of the same type.
Approach: They propose a model which combines [MASK] embeddings with entity embedds to learn relation embeddations.
Outcome: The proposed model outperforms the state-of-the-art on several benchmarks . it uses a self-supervised pre-training strategy which further improves the results.
Contextual Embeddings: When Are They Worth It? (2020.acl-main)

Copied to clipboard

Challenge: In recent years, rich contextual embeddings have enabled rapid progress on benchmarks like GLUE, but require significant computational resources during pretraining and during downstream task training and inference.
Approach: They empirically compare contextual embeddings with classic pretrained embedders and a random word embeddable with a simple baseline.
Outcome: The proposed models perform within 5 to 10% accuracy on industry-scale data.
New Benchmark Corpus and Models for Fine-grained Event Classification: To BERT or not to BERT? (2020.coling-main)

Copied to clipboard

Challenge: Existing methods for fine-grained event classification are of tiny size, ranging from 5-10K events.
Approach: They propose to use ACLED data for fine-grained event classification . they compare performance of various state-of-the-art models on these datasets .
Outcome: The proposed models perform better on micro (94.3-94.9%) and macro F1 (86.0-88.9%) the proposed models are robust and the performance is dependent on training data size.
Exploring the Value of Personalized Word Embeddings (2020.coling-main)

Copied to clipboard

Challenge: a subset of words belonging to specific psycholinguistic categories vary more in their representations across users . combining generic and personalized word embeddings yields the best performance .
Approach: They propose personalized word embeddings and compare their performance to generic ones . they show that personalized word representations can be leveraged for improved performance .
Outcome: The proposed model can be used for authorship attribution.

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