T2-NER: A Ṯwo-Stage Span-Based Framework for Unified Named Entity Recognition with Ṯemplates

6Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

Named Entity Recognition (NER) has so far evolved from the traditional flat NER to overlapped and discontinuous NER. They have mostly been solved separately, with only several exceptions that concurrently tackle three tasks with a single model. The current bestperforming method formalizes the unified NER as word-word relation classification, which barely focuses on mention content learning and fails to detect entity mentions comprising a single word. In this paper, we propose a two-stage span-based framework with templates, namely, T2-NER, to resolve the unified NER task. The first stage is to extract entity spans, where flat and overlapped entities can be recognized. The second stage is to classify over all entity span pairs, where discontinuous entities can be recognized. Finally, multi-task learning is used to jointly train two stages. To improve the efficiency of span-based model, we design grouped templates and typed templates for two stages to realize batch computations. We also apply an adjacent packing strategy and a latter packing strategy to model discriminative boundary information and learn better span (pair) representation. Moreover, we introduce the syntax information to enhance our span representation. We perform extensive experiments on eight benchmark datasets for flat, overlapped, and discontinuous NER, where our model beats all the current competitive baselines, obtaining the best performance of unified NER.

Cite

CITATION STYLE

APA

Huang, P., Zhao, X., Hu, M., Tan, Z., & Xiao, W. (2023). T2-NER: A Ṯwo-Stage Span-Based Framework for Unified Named Entity Recognition with Ṯemplates. Transactions of the Association for Computational Linguistics, 11, 1265–1282. https://doi.org/10.1162/tacl_a_00602

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free