Challenge: Existing methods for zero-shot relation extraction lack explicit modeling of matching pattern . et al. (2018) show that our method achieves higher matching accuracy and faster inference speed .
Approach: They propose a fine-grained semantic matching method tailored for zero-shot relation extraction . they decompose sentence-level similarity score into entity matching score and context matching score .
Outcome: The proposed method achieves higher matching accuracy and faster inference speed than state-of-the-art methods.

Similar Papers

Fusion Makes Perfection: An Efficient Multi-Grained Matching Approach for Zero-Shot Relation Extraction (2024.naacl-short)

Copied to clipboard

Challenge: Existing methods to extract unseen relations require laborious manual annotation . a new approach uses fine-grained matching to reduce manual annotation cost .
Approach: They propose an efficient multi-grained matching approach that uses virtual entity matching to reduce manual annotation cost.
Outcome: The proposed approach outperforms the state-of-the-art methods and achieves inference efficiency and accuracy in zero-shot relation extraction tasks.
Grasping the Essentials: Tailoring Large Language Models for Zero-Shot Relation Extraction (2024.emnlp-main)

Copied to clipboard

Challenge: Existing Relation extraction models require extensive annotated training data, which is costly and labor-intensive to collect.
Approach: They propose a new zero-shot RE task where only relation definitions are provided instead of seen-unseen relation instances.
Outcome: The proposed task significantly improves cost-effective zero-shot performance by large margins.
AlignRE: An Encoding and Semantic Alignment Approach for Zero-Shot Relation Extraction (2024.findings-acl)

Copied to clipboard

Challenge: Existing prototype-based methods for ZSRE ignore abundant side information and suffer from a significant encoding gap between prototypes and sentences.
Approach: They propose a framework to encode schema alignment to enhance prototype-based ZSRE methods.
Outcome: The proposed method outperforms existing methods on FewRel and Wiki-ZSL datasets and exhibits substantially faster performance and reduces the need for extensive manual labor in prototype construction.
Pre-training to Match for Unified Low-shot Relation Extraction (2022.acl-long)

Copied to clipboard

Challenge: Low-shot relation extraction (RE) aims to recognize novel relations with very few or even no samples.
Approach: They propose a method that leverages triplet paraphrase to pre-train zero-shot label matching ability and uses meta-learning paradigm to learn few-shot instance summarizing ability.
Outcome: The proposed method outperforms strong baselines and achieves the best performance on few-shot RE leaderboard.
Scalable Zero-shot Entity Linking with Dense Entity Retrieval (2020.emnlp-main)

Copied to clipboard

Challenge: Existing methods for entity linking use manually curated mention tables and incoming Wikipedia link popularity.
Approach: They propose a BERT-based entity linking model with a bi-encoder that embeds the mention context and the entity descriptions and then re-ranked the candidate with . they also evaluate the accuracy-speed trade-off inherent to large pre-trained models.
Outcome: The proposed model is state-of-the-art on recent zero-shot benchmarks and established non-zero-shot evaluations.
A Read-and-Select Framework for Zero-shot Entity Linking (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing methods focus on the candidate retrieval stage and ignore the essential candidate ranking stage, which disambiguates among entities and makes the final linking prediction.
Approach: They propose a read-and-select framework that models the main components of entity disambiguation . they use mention context to output mention-aware entity representations .
Outcome: The proposed framework achieves state-of-the-art performance on established zero-shot entity linking dataset ZESHEL with 2.55% micro-average accuracy gain, with no need for laborious multi-phase pre-training used in most of the previous work.
Document-Level Zero-Shot Relation Extraction with Entity Side Information (2026.eacl-long)

Copied to clipboard

Challenge: Existing approaches rely on Large Language Models (LLMs) to generate synthetic data for unseen labels.
Approach: They propose a document-level zero-shot relation extraction framework with Entity Side Information to solve existing problems.
Outcome: The proposed approach achieves an average improvement of 11.6% in the macro F1-Score compared to baseline models and existing benchmarks.
Unleashing the Power of Large Language Models in Zero-shot Relation Extraction via Self-Prompting (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for zero-shot Relation Extraction (RE) lack detailed, context-specific prompts for understanding various sentences and relations.
Approach: They propose a framework that uses a three-stage diversity approach to prompt LLMs by generating multiple synthetic samples that encapsulate specific relations from scratch.
Outcome: The proposed framework outperforms existing LLM-based zero-shot RE methods on benchmark datasets and shows that it produces high-quality synthetic data that enhances performance.
On The Ingredients of an Effective Zero-shot Semantic Parser (2022.acl-long)

Copied to clipboard

Challenge: Recent studies have performed zero-shot learning by synthesizing training examples of canonical utterances and programs from a grammar, and further paraphrasing these utterrances to improve linguistic diversity.
Approach: They propose to bridge gaps between canonical and real-world user-issued examples by using stronger paraphrasers and improved grammars.
Outcome: The proposed model achieves strong performance on two semantic parsing benchmarks with zero labeled data.
Structured Semantic Information Helps Retrieve Better Examples for In-Context Learning Applied to Few-Shot Relation Extraction (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to relation extraction require many training examples per relation, resulting in low results.
Approach: They propose a strategy where new examples are selected based on their similarity to the provided 1-shot example.
Outcome: The proposed strategy outperforms other methods on FS-TACRED and FS - FewRel subsets and achieves state-of-the-art performance on both datasets.

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