{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:28:15Z","timestamp":1753885695420,"version":"3.41.2"},"reference-count":42,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"name":"Postgraduate Research & Practice Innovation Program of Jiangsu Province under Grant","award":["KYCX24_0684"],"award-info":[{"award-number":["KYCX24_0684"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. As. Lang. Proc."],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:p> In Natural Language Processing (NLP), it is common for one entity to contain another entity, i.e., nested entities. However, the most commonly used methods can only handle flat entities but not nested entities. To solve this problem, this paper proposes a flat-span contrastive learning method for nested Named Entity Recognition (NER), which consists of two sub-modules: a flat NER module and a candidate span classification module. The flat NER module is used to recognize the outermost entities, and we use star-transformer to capture the long-range dependencies of sentences, and the Conditional Random Field (CRF) to decode the outermost entity spans, contrastive learning is introduced, and the InfoNEC loss function is used to increase the difference between entity spans and nonentity spans. Finally, to improve the model performance and reduce error propagation, we jointly train the flat NER and candidate span classification modules through multi-task learning. Experimental results on the GENIA, GermEval2014, and JNLPBA datasets thoroughly verify the effectiveness of our model, and the ablation experiments further demonstrate the effectiveness of the model components. In the candidate span classification module, we generate all possible candidate spans based on the outermost entities by enumeration to better distinguish entity spans from nonentity. <\/jats:p>","DOI":"10.1142\/s2717554524500139","type":"journal-article","created":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T07:02:36Z","timestamp":1734678156000},"source":"Crossref","is-referenced-by-count":1,"title":["A Flat-Span Contrastive Learning Method for Nested Named Entity Recognition"],"prefix":"10.1142","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7048-6566","authenticated-orcid":false,"given":"Yaodi","family":"Liu","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing 210000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8502-5081","authenticated-orcid":false,"given":"Kun","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing 210000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-1808-9744","authenticated-orcid":false,"given":"Rong","family":"Tong","sequence":"additional","affiliation":[{"name":"Infocomm Technology Cluster, Singapore Institute of Technology, Singapore 999002, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0339-3643","authenticated-orcid":false,"given":"Chenxi","family":"Cai","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing 210000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6222-8520","authenticated-orcid":false,"given":"Dianying","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing 210000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-4696-3645","authenticated-orcid":false,"given":"Xiaohe","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing 210000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2025,1,27]]},"reference":[{"doi-asserted-by":"publisher","key":"S2717554524500139BIB001","DOI":"10.1145\/3604931"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB002","DOI":"10.1007\/s00521-020-05509-y"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB003","DOI":"10.3390\/app112211017"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB004","DOI":"10.1145\/3445965"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB005","DOI":"10.1007\/s10499-023-01367-2"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB007","DOI":"10.1007\/s11063-021-10547-1"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB009","DOI":"10.18653\/v1\/D15-1102"},{"key":"S2717554524500139BIB010","first-page":"2006","volume-title":"ECAI 2020","author":"Eberts M.","year":"2020"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB012","DOI":"10.18653\/v1\/P16-1101"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB013","DOI":"10.18653\/v1\/N18-1202"},{"key":"S2717554524500139BIB014","first-page":"4171","volume-title":"Proc. NAACL-HLT 2019","volume":"1","author":"Devlin J.","year":"2019"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB015","DOI":"10.1093\/bib\/bbac409"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB018","DOI":"10.1109\/TASLP.2021.3073868"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB019","DOI":"10.18653\/v1\/P18-1144"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB020","DOI":"10.18653\/v1\/2020.acl-main.611"},{"key":"S2717554524500139BIB021","first-page":"5951","volume-title":"Proc. 58th Annual Meeting of the Association for Computational Linguistics","author":"Ma R.","year":"2019"},{"key":"S2717554524500139BIB022","first-page":"117467","volume":"203","author":"Wang Y.","year":"2022","journal-title":"ESWA"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB023","DOI":"10.18653\/v1\/D18-1019"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB024","DOI":"10.1016\/j.neucom.2020.09.077"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB025","DOI":"10.1109\/WAINA.2012.75"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB026","DOI":"10.18653\/v1\/N18-1131"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB027","DOI":"10.18653\/v1\/2020.acl-main.525"},{"key":"S2717554524500139BIB028","first-page":"605","volume":"8","author":"Shibuya T.","year":"2020","journal-title":"Trans. Assoc. Comput. Ling."},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB029","DOI":"10.18653\/v1\/D18-1309"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB031","DOI":"10.1609\/aaai.v34i05.6434"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB032","DOI":"10.1016\/j.neunet.2021.02.019"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB033","DOI":"10.1080\/09540091.2023.2181483"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB034","DOI":"10.18653\/v1\/2020.acl-main.571"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB035","DOI":"10.1609\/aaai.v35i14.17519"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB036","DOI":"10.18653\/v1\/N16-1030"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB037","DOI":"10.1007\/s11063-022-11122-y"},{"key":"S2717554524500139BIB038","first-page":"282","volume-title":"Proc. I8th Int. Conf. Machine Learning (ICML \u201801)","author":"Lafferty J.","year":"2001"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB039","DOI":"10.18653\/v1\/N19-1133"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB041","DOI":"10.1109\/PROC.1973.9030"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB042","DOI":"10.1109\/ACCESS.2020.3031549"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB044","DOI":"10.3115\/1699510.1699529"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB045","DOI":"10.18653\/v1\/D17-1276"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB046","DOI":"10.1016\/j.ins.2019.10.065"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB047","DOI":"10.5715\/jnlp.29.23"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB049","DOI":"10.1609\/aaai.v35i16.17669"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB050","DOI":"10.1016\/j.neucom.2022.07.012"},{"doi-asserted-by":"publisher","key":"S2717554524500139BIB051","DOI":"10.1093\/bioinformatics\/bty869"}],"container-title":["International Journal of Asian Language Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S2717554524500139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T08:32:22Z","timestamp":1739781142000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S2717554524500139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,27]]},"references-count":42,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["10.1142\/S2717554524500139"],"URL":"https:\/\/doi.org\/10.1142\/s2717554524500139","relation":{},"ISSN":["2717-5545","2424-791X"],"issn-type":[{"type":"print","value":"2717-5545"},{"type":"electronic","value":"2424-791X"}],"subject":[],"published":{"date-parts":[[2025,1,27]]},"article-number":"2450013"}}