Challenge: Existing approaches to few-shot named entity recognition require large amounts of labeled data.
Approach: They propose a streamlined span-based factorization method that solves few-shot NER problem . they propose to decompose the span-level alignment problem into several refined procedures .
Outcome: The proposed method achieves an average F1 score improvement of 12 points on the FewNERD dataset and 10 points on SNIPS dataset.

Similar Papers

SpanProto: A Two-stage Span-based Prototypical Network for Few-shot Named Entity Recognition (2022.emnlp-main)

Copied to clipboard

Challenge: Existing methods for few-shot Named Entity Recognition ignore entity boundaries and are time-consuming . a seminal span-based prototypical network solves the problem using two stages: span extraction and mention classification.
Approach: They propose a seminal span-based prototypical network that tackles few-shot NER . they transform sequential tags into a global boundary matrix and use prototypical learning .
Outcome: The proposed model outperforms strong baselines over multiple benchmarks.
A Novel Three-stage Framework for Few-shot Named Entity Recognition (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods for Named Entity Recognition (NER) rely on labeled data, but data scarcity is a major challenge.
Approach: They propose a framework for Few-shot Named Entity Recognition that can learn from limited labeled data and generalize to new domains.
Outcome: The proposed framework surpasses existing methods on several benchmarks.
Focusing, Bridging and Prompting for Few-shot Nested Named Entity Recognition (2023.findings-acl)

Copied to clipboard

Challenge: Existing work on few-shot named entity recognition (NER) addresses flat entities instead of nested entities.
Approach: They propose a method based on focusing, bridging and prompting for few-shot nested NER without using source domain data.
Outcome: The proposed method outperforms baseline models on four benchmark datasets and outperformed several competing models on F1-score by 9.33% on ACE2004, 6.17% on ace2005, 9.40% on GENIA and 5.12% on KBP2017.
An Enhanced Span-based Decomposition Method for Few-Shot Sequence Labeling (2022.naacl-main)

Copied to clipboard

Challenge: Existing approaches to tagging tasks are limited to predefined classes and require large-scale annotated data.
Approach: They propose an Enhanced Span-based Decomposition method for Few-Shot Sequence Labeling to generalize on emerging, resource-scare domains.
Outcome: The proposed method achieves state-of-the-art results on two popular FSSL benchmarks, FewNERD and SNIPS, and is more robust in noisy and nested tagging scenarios.
BANER: Boundary-Aware LLMs for Few-Shot Named Entity Recognition (2025.coling-main)

Copied to clipboard

Challenge: Named Entity Recognition (NER) is a fundamental task in Natural Language Processing (NLP) that aims to detect the entity spans of text and classify them into pre-defined set of entity types.
Approach: They propose a boundary-aware contrastive learning strategy to enhance the LLM’s ability to perceive entity boundaries for generalized entity spans.
Outcome: The proposed framework outperforms prior methods and validates its effectiveness across a range of LLM architectures.
TECA: A Two-stage Approach with Controllable Attention Soft Prompt for Few-shot Nested Named Entity Recognition (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods for few-shot nested named entity recognition (NER) ignore relationship between inner and outer entities, which is crucial for fewshot ner.
Approach: They propose a span-based method with a controllable attention soft prompt for few-shot nested named entity recognition (TECA) the span part identification provides possible entity mentions without an extra filtering module.
Outcome: The proposed method outperforms baseline models on four benchmark datasets and outperformed competing models on F1-score by 5.62% on ACE04, 5.11% on ace05, 3.41% on KBP2017 and 0.7% on GENIA on the 10-shot setting.
Coarse-to-fine Few-shot Learning for Named Entity Recognition (2023.findings-acl)

Copied to clipboard

Challenge: Existing few-shot NER solutions do not consider sub-class discrimination and various granularity of new classes during coarse training.
Approach: They propose a method that uses a cluster-based prototype loss to learn group-wise discriminative representations of coarse-grained classes and a mixture prototype loss for learning the representations.
Outcome: The proposed method shows superior performance over baseline methods on in-domain and cross-domain settings with various target granularity.
Simple and Effective Few-Shot Named Entity Recognition with Structured Nearest Neighbor Learning (2020.emnlp-main)

Copied to clipboard

Challenge: Named entity recognition (NER) is widely adopted in several domains, such as news, medical, and social media.
Approach: They propose a few-shot named entity recognition system based on nearest neighbor learning and structured inference.
Outcome: The proposed method improves F1 scores on standard few-shot NER evaluation tasks by 6% to 16% relative to previous methods.
Decomposed Meta-Learning for Few-Shot Named Entity Recognition (2022.findings-acl)

Copied to clipboard

Challenge: Named entity recognition systems aim at recognizing unseen entity types based on a few labeled examples.
Approach: They propose a decomposed meta-learning approach to solve few-shot span detection and few- shot entity typing problems by introducing a model-agnostic meta-loop algorithm.
Outcome: The proposed approach achieves superior performance over prior methods on benchmarks.
Few-Shot Named Entity Recognition: An Empirical Baseline Study (2021.emnlp-main)

Copied to clipboard

Challenge: Existing methods to build named entity recognition systems with limited labeled data are lacking.
Approach: They propose three orthogonal schemes to build named entity recognition systems when labeled data is limited.
Outcome: The proposed NER systems outperform existing methods on few-shot and training-free settings.

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