This article proposes a three-stage enhancement strategy: a global self-attention mechanism to enhance contextual modeling and boundary semantic representation; a dropout reorganization strategy to mitigate over-regularization during prediction; a dynamic gated fusion network to achieve adaptive aggregation of structured features and contextual representations at the word-pair granularity.
Abstract
Unified modeling poses significant challenges for named entity recognition (NER), where effectively modeling contextual semantics and achieving efficient feature fusion remain critical challenges. The Word-Word Relation Classification for Named Entity Recognition (W
2
NER) framework, based on word-word relationship classification, offers a unified NER solution through two-dimensional word-grid modeling. However, it still faces limitations in modeling long-range dependencies and achieving flexible feature interactions. To address these limitations, this article proposes a three-stage enhancement strategy: (1) a global self-attention mechanism to enhance contextual modeling and boundary semantic representation; (2) a dropout reorganization strategy to mitigate over-regularization during prediction; (3) a dynamic gated fusion network to achieve adaptive aggregation of structured features and contextual representations at the word-pair granularity. Experiments on eight benchmark datasets covering Chinese and English flat, nested, and discontinuous NER tasks show that the proposed model achieves competitive overall performance and yields consistent gains over the reproduced W
2
NER baseline on multiple benchmarks. Further analyses indicate that the model is more effective for longer entities while introducing only mild additional inference overhead.
This paper proposes NE-R1, a novel framework for adaptive retrieval-augmented NER, which achieves state-of-the-art performance on various benchmarks, with an average F1 score gain of 2.52% in in-domain evaluation and 1.18% in zero-shot cross-domain evaluation.
Mei-Xuan Chen, He-Han Li, Rui-Zhi Zhao et al.· 0 citations
A Chinese nested NER method based on attention decoupling and character–word association masking mechanism that decomposes traditional character–word interactions into three independent matrices, content–content, content–position, and position–content, thereby achieving decoupled representation of position and content.
Mingjian Li, Fei Gao, Nuo Qun et al.· Applied Sciences· 0 citations
This analysis shows that, in new sentences, the contextual associations of tokens representing old entity types exhibit a significantly stronger bias towards new entity types compared to their contexts in old sentences, which intensifies the degradation of old knowledge while promoting the overfitting of new knowledge.
Du-Zhen Zhang, Yahan Yu, Xiuyi Chen et al.· IEEE Transactions on Artific...· 0 citations
A robust WSD model that integrates a bidirectional long shortterm memory network (BiLSTM) with an attention mechanism, specifically designed for Chinese patent texts is proposed, providing reliable support for knowledge mining and intelligent text processing in technical domains.
L.-X. Gao, T. Dong, M.-H. Yang· Advanced Electromagnetics· 0 citations
Large-scale post-click conversion rate (CVR) prediction requires jointly modeling heterogeneous feature interactions and dependencies over multi-domain user behavior sequences. Existing industrial ranking models usually handle these two aspects with separate modules. Recent unified architectures attempt to incorporate...
Zhiwu Zhu, Dezheng Han, Jingjie Xia et al.· 0 citations
Frequency-Domain Latent-attention Gated Pooling (FLaG), a plug-in aggregation module that re-expresses encoder outputs in the Fourier domain before final pooling, provides a transferable frequency-domain aggregation bias across protein, visual, and textual representations, with benefits that depend on the backbone and...
Ke-Wei Li, Rong Zhang, Xuelin Wang et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.