Challenge: Existing methods to recognize entities recursively from innermost to outermost are based on brute force and two-stage paradigms, often leading to cascaded errors.
Approach: They propose a hierarchical region learning framework to automatically generate a tree hierarchy of candidate regions with nearly linear complexity and incorporate structure information into the region representation for better classification.
Outcome: Experiments on benchmark datasets ACE-2005, GENIA and JNLPBA show that the proposed framework performs better than state-of-the-art models.

Similar Papers

Deep Exhaustive Model for Nested Named Entity Recognition (D18-1)

Copied to clipboard

Challenge: Named entity recognition (NER) is a task of finding entities with specific semantic types such as Protein, Cell, and RNA in text.
Approach: They propose a deep neural model for nested named entity recognition . they enumerate all possible regions or spans as potential entity mentions .
Outcome: The proposed model outperforms state-of-the-art models on nested and flat NER . it achieves 77.1% and 78.4% respectively in terms of F-score, without external knowledge resources.
Nested Named Entity Recognition with Span-level Graphs (2022.acl-long)

Copied to clipboard

Challenge: Named entity recognition is one of the major subtasks of information extraction for extracting categorized named entities from unstructured text.
Approach: They propose to use retrieval-based span-level graphs to connect spans and entities in the training data based on n-gram features to integrate information of similar neighbor entities into the span representation.
Outcome: The proposed method achieves general improvements on all three benchmarks and special superiority on low frequency entities.
Learning Nested Named Entity Recognition from Flat Annotations (2026.eacl-srw)

Copied to clipboard

Challenge: Named entity recognition (NER) requires expensive multi-level annotation.
Approach: They evaluate four approaches to learning nested structure from flat annotations alone . on NEREL, a Russian benchmark, they find the best method achieves 26.37% inner F1 .
Outcome: The proposed method closes 40% of the gap to full nested supervision on a Russian benchmark with 29 entity types where 21% of entities are nest.
A Neural Layered Model for Nested Named Entity Recognition (N18-1)

Copied to clipboard

Challenge: Entity mentions embedded in longer entity mentions are referred to as nested entities due to the properties of natural language.
Approach: They propose a neural model that dynamically stacks flat NER layers to identify nested entities by capturing sequential context representation with bidirectional long-term memory.
Outcome: The proposed model outperforms state-of-the-art feature-based systems on nested NER, achieving 74.7% and 72.2% on GENIA and ACE2005 datasets, respectively in terms of F-score.
HiTRANS: A Hierarchical Transformer Network for Nested Named Entity Recognition (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing studies for named entity recognition focus on flat NER, i.e., without nested entities, by sequence labeling methods.
Approach: They propose a Hierarchical Transformer network which decomposes the input sentence into multi-grained spans and enhances the representation learning in a hierarchical manner.
Outcome: The proposed method achieves much better performance than the state-of-the-art approaches on GENIA, ACE-2004, ace-2005 and NNE datasets.
Exploring Nested Named Entity Recognition with Large Language Models: Methods, Challenges, and Insights (2024.emnlp-main)

Copied to clipboard

Challenge: Named entity recognition (NER) is a challenging task in natural language processing . nested NER requires sophisticated techniques to identify entities within entities .
Approach: They investigate the application of Large Language Models (LLMs) to nested NER . they find methodologies from previous work are less effective .
Outcome: The proposed methods outperform BERT-based models in nested NER tasks . however, they do not outperformed the existing models on the GENIA dataset .
Simple Yet Powerful: An Overlooked Architecture for Nested Named Entity Recognition (2022.coling-1)

Copied to clipboard

Challenge: Named Entity Recognition (NER) is an important task in Natural Language Processing that aims to identify text spans belonging to predefined categories.
Approach: They propose to revisit the Multiple LSTM-CRF (MLC) model, a simple, overlooked, yet powerful approach based on training independent sequence labeling models for each entity type.
Outcome: The proposed model achieves state-of-the-art results in the Chilean Waiting List corpus by including pre-trained language models.
Pyramid: A Layered Model for Nested Named Entity Recognition (2020.acl-main)

Copied to clipboard

Challenge: Named Entity Recognition (NER) is a fundamental NLP task.
Approach: They propose a pyramid-like layered model for Nested Named Entity Recognition . token or text region embeddings are recursively inputted into L flat NER layers .
Outcome: The proposed model achieves state-of-the-art F1 scores in nested NER on ACE-2004, ACE 2005, GENIA, and NNE.
Nested Named Entity Recognition as Latent Lexicalized Constituency Parsing (2022.acl-long)

Copied to clipboard

Challenge: Existing methods to recognize named entities have been criticized for their performance on flat NER but fail to handle nested entities.
Approach: They propose to use a span-based constituency parser to tackle nested NER . they use lexicalized constituency trees to model nesting entities .
Outcome: The proposed method achieves state-of-the-art performance on ACE2004, ACE2005 and NNE, and competitive performance on the GENIA platform.
A Boundary-aware Neural Model for Nested Named Entity Recognition (D19-1)

Copied to clipboard

Challenge: Existing methods for named entity recognition ignore nested entities . a boundary-aware neural model can locate entities precisely by detecting boundaries .
Approach: They propose a boundary-aware neural model for nested named entity recognition which leverages entity boundaries to predict entity categorical labels.
Outcome: The proposed model outperforms state-of-the-art methods on GENIA dataset . it captures dependencies of entity boundaries and categorical labels, which helps to improve identifying entities.

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