An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition

• URL: http://arxiv.org/abs/2208.04534v1
• Date: Tue, 9 Aug 2022 04:33:46 GMT
• Title: An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition
• Authors: Hang Yan, Yu Sun, Xiaonan Li, Xipeng Qiu
• Abstract summary: We propose using Conal Neural Network (CNN) to model spatial relations in the score matrix. Our model surpasses several recently proposed methods with the same pre-trained encoders.
• Score: 55.080101447586635
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Named entity recognition (NER) is the task to detect and classify the entity spans in the text. When entity spans overlap between each other, this problem is named as nested NER. Span-based methods have been widely used to tackle the nested NER. Most of these methods will get a score $n \times n$ matrix, where $n$ means the length of sentence, and each entry corresponds to a span. However, previous work ignores spatial relations in the score matrix. In this paper, we propose using Convolutional Neural Network (CNN) to model these spatial relations in the score matrix. Despite being simple, experiments in three commonly used nested NER datasets show that our model surpasses several recently proposed methods with the same pre-trained encoders. Further analysis shows that using CNN can help the model find nested entities more accurately. Besides, we found that different papers used different sentence tokenizations for the three nested NER datasets, which will influence the comparison. Thus, we release a pre-processing script to facilitate future comparison.

Related papers

• S2F-NER: Exploring Sequence-to-Forest Generation for Complex Entity Recognition [47.714230389689064]
  We propose a novel Sequence-to-Forest generation paradigm, S2F-NER, which can directly extract entities in sentence via a Forest decoder. Specifically, our model generate each path of each tree in forest autoregressively, where the maximum depth of each tree is three. Based on this novel paradigm, our model can elegantly mitigate the exposure bias problem and keep the simplicity of Seq2Seq.
  arXiv  Detail & Related papers  (2023-10-29T09:09:10Z)
• NERetrieve: Dataset for Next Generation Named Entity Recognition and Retrieval [49.827932299460514]
  We argue that capabilities provided by large language models are not the end of NER research, but rather an exciting beginning. We present three variants of the NER task, together with a dataset to support them. We provide a large, silver-annotated corpus of 4 million paragraphs covering 500 entity types.
  arXiv  Detail & Related papers  (2023-10-22T12:23:00Z)
• Gaussian Prior Reinforcement Learning for Nested Named Entity Recognition [52.46740830977898]
  We propose a novel seq2seq model named GPRL, which formulates the nested NER task as an entity triplet sequence generation process. Experiments on three nested NER datasets demonstrate that GPRL outperforms previous nested NER models.
  arXiv  Detail & Related papers  (2023-05-12T05:55:34Z)
• Optimizing Bi-Encoder for Named Entity Recognition via Contrastive Learning [80.36076044023581]
  We present an efficient bi-encoder framework for named entity recognition (NER) We frame NER as a metric learning problem that maximizes the similarity between the vector representations of an entity mention and its type. A major challenge to this bi-encoder formulation for NER lies in separating non-entity spans from entity mentions.
  arXiv  Detail & Related papers  (2022-08-30T23:19:04Z)
• Trigger-GNN: A Trigger-Based Graph Neural Network for Nested Named Entity Recognition [5.9049664765234295]
  We propose a trigger-based graph neural network (Trigger-GNN) to leverage the nested NER. It obtains the complementary annotation embeddings through entity trigger encoding and semantic matching. It helps the model to learn and generalize more efficiently and cost-effectively.
  arXiv  Detail & Related papers  (2022-04-12T04:15:39Z)
• Unified Named Entity Recognition as Word-Word Relation Classification [25.801945832005504]
  We present a novel alternative by modeling the unified NER as word-word relation classification, namely W2NER. The architecture resolves the kernel bottleneck of unified NER by effectively modeling the neighboring relations between entity words. Based on the W2NER scheme we develop a neural framework, in which the unified NER is modeled as a 2D grid of word pairs.
  arXiv  Detail & Related papers  (2021-12-19T06:11:07Z)
• Bottom-Up Constituency Parsing and Nested Named Entity Recognition with Pointer Networks [24.337440797369702]
  Constituency parsing and nested named entity recognition (NER) are typical textitnested structured prediction tasks. We propose a novel global pointing mechanism for bottom-up parsing with pointer networks to do both tasks, which needs linear steps to parse. Our method obtains the state-of-the-art performance on PTB among all BERT-based models (96.01 F1 score) and competitive performance on CTB7 in constituency parsing.
  arXiv  Detail & Related papers  (2021-10-11T17:01:43Z)
• Adaptive Nearest Neighbor Machine Translation [60.97183408140499]
  kNN-MT combines pre-trained neural machine translation with token-level k-nearest-neighbor retrieval. Traditional kNN algorithm simply retrieves a same number of nearest neighbors for each target token. We propose Adaptive kNN-MT to dynamically determine the number of k for each target token.
  arXiv  Detail & Related papers  (2021-05-27T09:27:42Z)
• A Sequence-to-Set Network for Nested Named Entity Recognition [38.05786148160635]
  We propose a novel sequence-to-set neural network for nested NER. We use a non-autoregressive decoder to predict the final set of entities in one pass. Experimental results show that our proposed model achieves state-of-the-art on three nested NER corpora.
  arXiv  Detail & Related papers  (2021-05-19T03:10:04Z)
• Exploring and Evaluating Attributes, Values, and Structures for Entity Alignment [100.19568734815732]
  Entity alignment (EA) aims at building a unified Knowledge Graph (KG) of rich content by linking the equivalent entities from various KGs. attribute triples can also provide crucial alignment signal but have not been well explored yet. We propose to utilize an attributed value encoder and partition the KG into subgraphs to model the various types of attribute triples efficiently.
  arXiv  Detail & Related papers  (2020-10-07T08:03:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.