{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:21:53Z","timestamp":1740169313761,"version":"3.37.3"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3315840","type":"journal-article","created":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T18:05:59Z","timestamp":1695060359000},"page":"101498-101513","source":"Crossref","is-referenced-by-count":0,"title":["Semantic Sentence Matching Based on Multiple Parallelly Organized Interaction Layers at Various Granularity Combinations With Two-Stage Aggregation Strategy"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-7501-6601","authenticated-orcid":false,"given":"Dian","family":"Wang","sequence":"first","affiliation":[{"name":"Second Research Institute of Civil Aviation Administration of China, Chengdu, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4464-1008","authenticated-orcid":false,"given":"Jing","family":"Li","sequence":"additional","affiliation":[{"name":"Second Research Institute of Civil Aviation Administration of China, Chengdu, China"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-018-7063-5"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10341"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N16-1170"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2019.102090"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.05.103"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2020.2995290"},{"key":"ref14","article-title":"Natural language inference over interaction space","author":"gong","year":"2017","journal-title":"arXiv 1709 04348"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.03.091"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00249"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10342"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-03410-w"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/579"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113384"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2020.102794"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.32604\/cmc.2019.06045"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2018.06.005"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1007"},{"journal-title":"Jieba Chinese Text Segmentation Built to be the Best Python Chinese Word Segmentation Module","year":"2019","author":"sun","key":"ref39"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2021.102738"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-82147-0_45"},{"key":"ref19","first-page":"449","article-title":"A parameterized similarity function for text comparison","author":"jimenez","year":"2012","journal-title":"Proc 6th Int Workshop Semantic Eval 1st Joint Conf Lexical Comput Semantics"},{"key":"ref18","first-page":"52","article-title":"Combining symbolic and distributional models of meaning","author":"clark","year":"2007","journal-title":"Proc AAAI Spring Symp Quantum Interact"},{"key":"ref24","article-title":"Natural language inference by tree-based convolution and heuristic matching","author":"mou","year":"2015","journal-title":"arXiv 1512 08422"},{"key":"ref46","article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","author":"devlin","year":"2018","journal-title":"arXiv 1810 04805"},{"key":"ref23","article-title":"LSTM-based deep learning models for non-factoid answer selection","author":"tan","year":"2015","journal-title":"arXiv 1511 04108"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1465"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10350"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3450520"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-1202"},{"key":"ref20","first-page":"1011","article-title":"Tree edit models for recognizing textual entailments, paraphrases, and answers to questions","author":"heilman","year":"2010","journal-title":"Proc Hum Lang Technol Annu Conf North Amer Chapter Assoc Comput Linguistics"},{"key":"ref42","article-title":"Sentence similarity learning by lexical decomposition and composition","author":"wang","year":"2016","journal-title":"arXiv 1602 07019"},{"article-title":"Convolutional neural network for sentence classification","year":"2015","author":"chen","key":"ref41"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1075"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D16-1244"},{"key":"ref21","first-page":"22","article-title":"What is the jeopardy model? A quasi-synchronous grammar for QA","author":"wang","year":"2007","journal-title":"Proc Joint Conf Empirical Methods Natural Lang Process Comput Natural Lang Learn"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00097"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s11063-021-10561-3"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-021-01349-x"},{"key":"ref29","first-page":"2042","article-title":"Convolutional neural network architectures for matching natural language sentences","volume":"27","author":"hu","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2019.102109"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.03.007"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-02156-7"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105544"},{"key":"ref3","article-title":"Enhanced LSTM for natural language inference","author":"chen","year":"2016","journal-title":"arXiv 1609 06038"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.01.028"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-019-7240-1"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46478-7_9"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10253944.pdf?arnumber=10253944","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T19:22:49Z","timestamp":1696879369000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10253944\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3315840","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2023]]}}}