Nested Named Entity Recognition as Latent Lexicalized Constituency Parsing

• URL: http://arxiv.org/abs/2203.04665v1
• Date: Wed, 9 Mar 2022 12:02:59 GMT
• Title: Nested Named Entity Recognition as Latent Lexicalized Constituency Parsing
• Authors: Chao Lou, Songlin Yang, Kewei Tu
• Abstract summary: Recently, (Fu et al, 2021) adapt a span-based constituency to tackle nested NER. In this work, we resort to more expressive structures, lexicalized constituency trees in which constituents are annotated by headwords. We leverage the Eisner-Satta algorithm to perform partial marginalization and inference efficiently.
• Score: 29.705133932275892
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Nested named entity recognition (NER) has been receiving increasing attention. Recently, (Fu et al, 2021) adapt a span-based constituency parser to tackle nested NER. They treat nested entities as partially-observed constituency trees and propose the masked inside algorithm for partial marginalization. However, their method cannot leverage entity heads, which have been shown useful in entity mention detection and entity typing. In this work, we resort to more expressive structures, lexicalized constituency trees in which constituents are annotated by headwords, to model nested entities. We leverage the Eisner-Satta algorithm to perform partial marginalization and inference efficiently. In addition, we propose to use (1) a two-stage strategy (2) a head regularization loss and (3) a head-aware labeling loss in order to enhance the performance. We make a thorough ablation study to investigate the functionality of each component. Experimentally, our method achieves the state-of-the-art performance on ACE2004, ACE2005 and NNE, and competitive performance on GENIA, and meanwhile has a fast inference speed.

Related papers

• Coherent Entity Disambiguation via Modeling Topic and Categorical Dependency [87.16283281290053]
  Previous entity disambiguation (ED) methods adopt a discriminative paradigm, where prediction is made based on matching scores between mention context and candidate entities. We propose CoherentED, an ED system equipped with novel designs aimed at enhancing the coherence of entity predictions. We achieve new state-of-the-art results on popular ED benchmarks, with an average improvement of 1.3 F1 points.
  arXiv  Detail & Related papers  (2023-11-06T16:40:13Z)
• 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)
• Nested Named Entity Recognition from Medical Texts: An Adaptive Shared Network Architecture with Attentive CRF [53.55504611255664]
  We propose a novel method, referred to as ASAC, to solve the dilemma caused by the nested phenomenon. The proposed method contains two key modules: the adaptive shared (AS) part and the attentive conditional random field (ACRF) module. Our model could learn better entity representations by capturing the implicit distinctions and relationships between different categories of entities.
  arXiv  Detail & Related papers  (2022-11-09T09:23:56Z)
• Entity Disambiguation with Entity Definitions [50.01142092276296]
  Local models have recently attained astounding performances in Entity Disambiguation (ED) Previous works limited their studies to using, as the textual representation of each candidate, only its Wikipedia title. In this paper, we address this limitation and investigate to what extent more expressive textual representations can mitigate it. We report a new state of the art on 2 out of 6 benchmarks we consider and strongly improve the generalization capability over unseen patterns.
  arXiv  Detail & Related papers  (2022-10-11T17:46:28Z)
• 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)
• Global Pointer: Novel Efficient Span-based Approach for Named Entity Recognition [7.226094340165499]
  Named entity recognition (NER) task aims at identifying entities from a piece of text that belong to predefined semantic types. The state-of-the-art solutions for flat entities NER commonly suffer from capturing the fine-grained semantic information in underlying texts. We propose a novel span-based NER framework, namely Global Pointer (GP), that leverages the relative positions through a multiplicative attention mechanism.
  arXiv  Detail & Related papers  (2022-08-05T09:19:46Z)
• Nested Named Entity Recognition as Holistic Structure Parsing [92.8397338250383]
  This work models the full nested NEs in a sentence as a holistic structure, then we propose a holistic structure parsing algorithm to disclose the entire NEs once for all. Experiments show that our model yields promising results on widely-used benchmarks which approach or even achieve state-of-the-art.
  arXiv  Detail & Related papers  (2022-04-17T12:48:20Z)
• 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)
• Locate and Label: A Two-stage Identifier for Nested Named Entity Recognition [9.809157050048375]
  We propose a two-stage entity identifier for named entity recognition. First, we generate span proposals by filtering and boundary regression on the seed spans to locate the entities, and then label the boundary-adjusted span proposals with the corresponding categories. Our method effectively utilizes the boundary information of entities and partially matched spans during training.
  arXiv  Detail & Related papers  (2021-05-14T12:52:34Z)
• Nested Named Entity Recognition with Partially-Observed TreeCRFs [23.992944831013013]
  We view nested NER as constituency parsing with partially-observed trees and model it with partially-observed TreeCRFs. Our approach achieves the state-of-the-art (SOTA) F1 scores on the ACE2004, ACE2005 dataset, and shows comparable performance to SOTA models on the GENIA dataset.
  arXiv  Detail & Related papers  (2020-12-15T18:20:36Z)

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.