Knowledge-aware Named Entity Recognition with Alleviating Heterogeneity
Binling Nie, Ruixue Ding, Pengjun Xie, Fei Huang, Chen Qian, Luo Si
摘要
Named Entity Recognition (NER) is a fundamental and important research topic for many downstream NLP tasks, aiming at detecting and classifying named entities (NEs) mentioned in unstructured text into pre-defined categories. Learning from labeled data only is far from enough when it comes to domain-specific or temporally-evolving entities (e.g. medical terminologies or restaurant names). Luckily, open-source Knowledge Bases (KBs) (e.g. Wikidata and Freebase) contain NEs that are manually labeled with predefined types in different domains, which is potentially beneficial to identify entity boundaries and recognize entity types more accurately. However, the type system of a domain-specific NER task is typically independent of that of current KBs and thus exhibits heterogeneity issue inevitably, which makes matching between the original NER and KB types (e.g. Person in NER potentially matches President in KBs) less likely, or introduces unintended noises without considering domainspecific knowledge (e.g. Band in NER should be mapped to Out of Entity Types in the restaurant-related task). To better incorporate and denoise the abundant knowledge in KBs, we propose a new KB-aware NER framework (KaNa), which utilizes type-heterogeneous knowledge to improve NER. Specifically, for an entity mention along with a set of candidate entities that are linked from KBs, KaNa first uses a type projection mechanism that maps the mention type and entity types into a shared space to homogenize the heterogeneous entity types. Then, based on projected types, a noise detector filters out certain less-confident candidate entities in an unsupervised manner. Finally, the filtered mention-entity pairs are injected into a NER model as a graph to predict answers. The experimental results demonstrate KaNa's state-ofthe-art performance on five public benchmark datasets from different domains, outperforming strong baselines by 1.33 F1 points on average.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- VerifiNER: Verification-augmented NER via Knowledge-grounded Reasoning with Large Language ModelsSeoyeon Kim, Kwangwook Seo, Hyungjoo Chae, Jinyoung Yeo 等ACL 2024 · 被引用 7 次
- PeerDA: Data Augmentation via Modeling Peer Relation for Span Identification TasksWeiwen Xu, Xin Li, Yang Deng, Wai Lam 等ACL 2023 · 被引用 6 次
它引用的顶会 Paper1
相关 Paper
- Three Heads Are Better than One: Improving Cross-Domain NER with Progressive Decomposed NetworkXuming Hu, Zhaochen Hong, Yong Jiang, Zhichao Lin 等AAAI 2024 · 被引用 1 次
- Coarse-to-Fine Pre-training for Named Entity RecognitionMengge Xue, Bowen Yu, Zhenyu Zhang, Tingwen Liu 等EMNLP 2020 · 被引用 49 次
- BOND: BERT-Assisted Open-Domain Named Entity Recognition with Distant SupervisionChen Liang, Yue Yu, Haoming Jiang, Siawpeng Er 等KDD 2020 · 被引用 118 次
- Grounded Multimodal Named Entity Recognition on Social MediaJianfei Yu, Ziyan Li, Jieming Wang, Rui XiaACL 2023 · 被引用 32 次
- ChemNER: Fine-Grained Chemistry Named Entity Recognition with Ontology-Guided Distant SupervisionXuan Wang, Vivian Hu, Xiangchen Song, Shweta Garg 等EMNLP 2021 · 被引用 23 次
