Nested Named Entity Recognition as Single-Pass Sequence Labeling (2025.findings-emnlp)
Copied to clipboard
| Challenge: | nested named entity recognition is a sequence labeling task that can be trained using any off-the-shelf sequence labelling library. |
| Approach: | They use prior work that linearizes constituency structures to create a nested named entity recognition task. |
| Outcome: | The proposed method reduces the complexity of the predicted nested entity recognition problem to a simple token classification task. |
Similar Papers
Neural Architectures for Nested NER through Linearization (P19-1)
Copied to clipboard
| Challenge: | a nested named entity recognition (NER) is a set of entities that can overlap and be labeled with more than one label. |
| Approach: | They propose two neural network architectures for nested named entity recognition . they propose to model nesting entities as multilabels and predict a sequence-to-sequence problem . |
| Outcome: | The proposed methods outperform the state-of-the-art on four corpora . the proposed models also improve on the recently published contextual embeddings . |
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. |
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. |
Multi-grained Named Entity Recognition (P19-1)
Copied to clipboard
| Challenge: | Existing approaches treat Named Entity Recognition (NER) as a sequence labeling task. |
| Approach: | They propose a framework for Multi-Grained Named Entity Recognition where multiple entities or entity mentions in a sentence could be non-overlapping or totally nested. |
| Outcome: | The proposed framework outperforms current state-of-the-art frameworks by 4.4% in terms of the F1 score among nested/non-overlapping NER tasks. |
Nested Named Entity Recognition via Second-best Sequence Learning and Decoding (2020.tacl-1)
Copied to clipboard
| Challenge: | Named entity recognition (NER) is the task of identifying text spans associated with proper names and classifying them according to their semantic class such as person or organization. |
| Approach: | They propose a method that treats the tag sequence for nested entities as the second best path within the span of their parent entity. |
| Outcome: | The proposed method achieves F1-scores of 85.82%, 84.34%, and 77.36% on ACE-2004, ACE 2005, and GENIA datasets. |
Locate and Label: A Two-stage Identifier for Nested Named Entity Recognition (2021.acl-long)
Copied to clipboard
| Challenge: | Named entity recognition (NER) is a well-studied task in natural language processing. |
| Approach: | They propose a method that generates span proposals and labels them with categories . they use boundary information of entities and partially matched spans to locate them . |
| Outcome: | The proposed method outperforms state-of-the-art models on nested NER datasets. |
Hierarchical Region Learning for Nested Named Entity Recognition (2020.findings-emnlp)
Copied to clipboard
| 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. |
Bottom-Up Constituency Parsing and Nested Named Entity Recognition with Pointer Networks (2022.acl-long)
Copied to clipboard
| Challenge: | Constituency parsing and nested named entity recognition (NER) are similar tasks since they aim to predict a collection of nesting and non-crossing spans. |
| Approach: | They propose a model that uses a pointer network to predict a constituency tree's boundary . constituency parsing is an important task in natural language processing . |
| Outcome: | The proposed model achieves state-of-the-art performance on PTB among all BERT-based models and competitive performance on CTB7 in constituency parsing. |
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. |
NNE: A Dataset for Nested Named Entity Recognition in English Newswire (P19-1)
Copied to clipboard
| Challenge: | Named entity recognition (NER) is widely used in downstream tasks but most tools focus on flat mention structure over coarse schemas. |
| Approach: | They describe a fine-grained, nested named entity dataset over the Wall Street Journal portion of the Penn Treebank. |
| Outcome: | The proposed dataset comprises 279,795 mentions of 114 entity types with up to 6 layers of nesting. |