Nested Named Entity Recognition with Partially-Observed TreeCRFs

• URL: http://arxiv.org/abs/2012.08478v1
• Date: Tue, 15 Dec 2020 18:20:36 GMT
• Title: Nested Named Entity Recognition with Partially-Observed TreeCRFs
• Authors: Yao Fu, Chuanqi Tan, Mosha Chen, Songfang Huang, Fei Huang
• Abstract summary: 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.
• Score: 23.992944831013013
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Named entity recognition (NER) is a well-studied task in natural language processing. However, the widely-used sequence labeling framework is difficult to detect entities with nested structures. In this work, we view nested NER as constituency parsing with partially-observed trees and model it with partially-observed TreeCRFs. Specifically, we view all labeled entity spans as observed nodes in a constituency tree, and other spans as latent nodes. With the TreeCRF we achieve a uniform way to jointly model the observed and the latent nodes. To compute the probability of partial trees with partial marginalization, we propose a variant of the Inside algorithm, the \textsc{Masked Inside} algorithm, that supports different inference operations for different nodes (evaluation for the observed, marginalization for the latent, and rejection for nodes incompatible with the observed) with efficient parallelized implementation, thus significantly speeding up training and inference. Experiments show that 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. Our approach is implemented at: \url{https://github.com/FranxYao/Partially-Observed-TreeCRFs}.

Related papers

• Reliable Node Similarity Matrix Guided Contrastive Graph Clustering [51.23437296378319]
  We introduce a new framework, Reliable Node Similarity Matrix Guided Contrastive Graph Clustering (NS4GC) Our method introduces node-neighbor alignment and semantic-aware sparsification, ensuring the node similarity matrix is both accurate and efficiently sparse.
  arXiv  Detail & Related papers  (2024-08-07T13:36:03Z)
• Rapid and Precise Topological Comparison with Merge Tree Neural Networks [7.443474354626664]
  We introduce the Merge Tree Neural Network (MTNN), a learned neural network model designed for merge tree comparison. We first demonstrate how to train graph neural networks, which emerged as effective encoders for graphs, in order to produce embeddings of merge trees in vector spaces. We then formulate the novel MTNN model that further improves the similarity comparisons by integrating the tree and node embeddings with a new topological attention mechanism.
  arXiv  Detail & Related papers  (2024-04-08T21:26:04Z)
• Node Classification in Random Trees [4.800441150586326]
  We propose a method for the classification of objects that are structured as random trees. Our aim is to model a distribution over the node label assignments in settings where the tree data structure is associated with node attributes. We evaluate our method on the tasks of node classification in trees on the Stanford Sentiment Treebank dataset.
  arXiv  Detail & Related papers  (2023-11-20T20:33:35Z)
• A Topological Perspective on Demystifying GNN-Based Link Prediction Performance [72.06314265776683]
  Topological Concentration (TC) is based on the intersection of the local subgraph of each node with the ones of its neighbors. We show that TC has a higher correlation with LP performance than other node-level topological metrics like degree and subgraph density. We propose Approximated Topological Concentration (ATC) and theoretically/empirically justify its efficacy in approximating TC and reducing the complexity.
  arXiv  Detail & Related papers  (2023-10-06T22:07:49Z)
• Type-supervised sequence labeling based on the heterogeneous star graph for named entity recognition [6.25916397918329]
  The representation learning of the heterogeneous star graph containing text nodes and type nodes is investigated in this paper. The model performs the type-supervised sequence labeling after updating nodes in the graph. Experiments on public NER datasets reveal the effectiveness of our model in extracting both flat and nested entities.
  arXiv  Detail & Related papers  (2022-10-19T01:40:06Z)
• Nested Named Entity Recognition as Latent Lexicalized Constituency Parsing [29.705133932275892]
  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.
  arXiv  Detail & Related papers  (2022-03-09T12:02:59Z)
• Spectral Top-Down Recovery of Latent Tree Models [13.681975313065477]
  Spectral Top-Down Recovery (STDR) is a divide-and-conquer approach for inference of large latent tree models. STDR's partitioning step is non-random. Instead, it is based on the Fiedler vector of a suitable Laplacian matrix related to the observed nodes. We prove that STDR is statistically consistent, and bound the number of samples required to accurately recover the tree with high probability.
  arXiv  Detail & Related papers  (2021-02-26T02:47:42Z)
• Node Similarity Preserving Graph Convolutional Networks [51.520749924844054]
  Graph Neural Networks (GNNs) explore the graph structure and node features by aggregating and transforming information within node neighborhoods. We propose SimP-GCN that can effectively and efficiently preserve node similarity while exploiting graph structure. We validate the effectiveness of SimP-GCN on seven benchmark datasets including three assortative and four disassorative graphs.
  arXiv  Detail & Related papers  (2020-11-19T04:18:01Z)
• Graph Neural Networks with Composite Kernels [60.81504431653264]
  We re-interpret node aggregation from the perspective of kernel weighting. We present a framework to consider feature similarity in an aggregation scheme. We propose feature aggregation as the composition of the original neighbor-based kernel and a learnable kernel to encode feature similarities in a feature space.
  arXiv  Detail & Related papers  (2020-05-16T04:44:29Z)
• Neighborhood Matching Network for Entity Alignment [71.24217694278616]
  Neighborhood Matching Network (NMN) is a novel entity alignment framework. NMN estimates the similarities between entities to capture both the topological structure and the neighborhood difference. It first uses a novel graph sampling method to distill a discriminative neighborhood for each entity. It then adopts a cross-graph neighborhood matching module to jointly encode the neighborhood difference for a given entity pair.
  arXiv  Detail & Related papers  (2020-05-12T08:26:15Z)
• Graph Inference Learning for Semi-supervised Classification [50.55765399527556]
  We propose a Graph Inference Learning framework to boost the performance of semi-supervised node classification. For learning the inference process, we introduce meta-optimization on structure relations from training nodes to validation nodes. Comprehensive evaluations on four benchmark datasets demonstrate the superiority of our proposed GIL when compared against state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-01-17T02:52:30Z)

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.