An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition

Hang Yan, Yu Sun, Xiaonan Li, Xipeng Qiu
8/9/2022
cs.CL

No official code found. Best implementation: yhcc/CNN_Nested_NER (114 stars, last commit 2022-11-04). 1 more below.

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 more nested entities. 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.

View on arXivView PDF

Code Implementations(2)

yhcc/CNN_Nested_NERCommunity100%
1147PythonAug 8, 20223 years ago
Joel4U/Span_CNNCommunity61%

This is the code for An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition

00PythonSep 2, 20251 years ago

Similar Papers

Cite this paper

@article{yan2022embarrassingly,
  title  = {An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition},
  author = {Hang Yan and Yu Sun and Xiaonan Li and Xipeng Qiu},
  year   = {2022},
  eprint = {2208.04534},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2208.04534v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2208.04534.svg)](https://codeofpaper.com/paper/2208.04534)

Discussion