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. |
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. |
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. |
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. |
Few-Shot Class-Incremental Learning for Named Entity Recognition (2022.acl-long)
Copied to clipboard
| Challenge: | Existing models of Named Entity Recognition (NER) are trained on large datasets with predefined entity classes, but data of new classes arrives constantly. Existing work on NER relies on the assumption that there exists abundance of labeled data for the training of new class. |
| Approach: | They propose a few-shot class-incremental learning problem where NER model is trained with only few labeled samples of the new classes without forgetting knowledge of the old ones. |
| Outcome: | The proposed model improves over existing baselines by reconstructing training data of old classes and real data from the training set. |
Few-Shot Named Entity Recognition: An Empirical Baseline Study (2021.emnlp-main)
Copied to clipboard
Jiaxin Huang, Chunyuan Li, Krishan Subudhi, Damien Jose, Shobana Balakrishnan, Weizhu Chen, Baolin Peng, Jianfeng Gao, Jiawei Han
| 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. |
Learning from Language Description: Low-shot Named Entity Recognition via Decomposed Framework (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Named entity recognition (NER) is a language understanding task that requires large amounts of in-domain labeled data to perform well. |
| Approach: | They propose a framework which learns from natural language supervision and enables the identification of never-seen entity classes without using in-domain labeled data. |
| Outcome: | The proposed method brings 10%, 23% and 26% improvements over baselines in few-shot learning, domain transfer and zero-shot settings respectively. |
Large-Scale Label Interpretation Learning for Few-Shot Named Entity Recognition (2024.eacl-long)
Copied to clipboard
| Challenge: | Few-shot named entity recognition (NER) uses only a few annotated examples to identify named entities within text. |
| Approach: | They propose to leverage natural language descriptions of each entity type to perform few-shot named entity recognition. |
| Outcome: | The proposed model learns to interpret verbalized descriptions of entities using natural language descriptions of their types and their verbalizations. |
A Streamlined Span-based Factorization Method for Few Shot Named Entity Recognition (2024.lrec-main)
Copied to clipboard
| 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. |
Coarse-to-fine Few-shot Learning for Named Entity Recognition (2023.findings-acl)
Copied to clipboard
Ruotian Ma, Zhang Lin, Xuanting Chen, Xin Zhou, Junzhe Wang, Tao Gui, Qi Zhang, Xiang Gao, Yun Wen Chen
| 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. |