{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T11:19:43Z","timestamp":1743160783433,"version":"3.37.3"},"reference-count":20,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T00:00:00Z","timestamp":1578873600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602241","BK20150758"],"award-info":[{"award-number":["61602241","BK20150758"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["61602241","BK20150758"],"award-info":[{"award-number":["61602241","BK20150758"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2020,1,13]]},"abstract":"Recently, the natural language processing- (NLP-) based intelligent question and answer (Q&A) robots have been used ubiquitously. However, the robustness and security of current Q&A robots are still unsatisfactory, e.g., a slight typo in the user\u2019s question may cause the Q&A robot unable to return the correct answer. In this paper, we propose a fast and automatic test dataset generation method for the robustness and security evaluation of current Q&A robots, which can work in black-box scenarios and thus can be applied to a variety of different Q&A robots. Specifically, we propose a d<\/jats:bold>ependency p<\/jats:bold>arse-based a<\/jats:bold>dversarial e<\/jats:bold>xamples g<\/jats:bold>eneration (DPAEG) method for Q&A robots. DPAEG first uses the proposed dependency parse-based keywords extraction algorithm to extract keywords from a question. Then, the proposed algorithm generates adversarial words according to the extracted keywords, which include typos and words that are spelled similarly to the keywords. Finally, these adversarial words are used to generate a large number of adversarial questions. The generated adversarial questions which are similar to the original questions do not affect human\u2019s understanding, but the Q&A robots cannot answer these adversarial questions correctly. Moreover, the proposed method works in a black-box scenario, which means it does not need the knowledge of the target Q&A robots. Experiment results show that the generated adversarial examples have a high success rate on two state-of-the-art Q&A robots, DrQA and Google Assistant. In addition, the generated adversarial examples not only affect the correct answer (top-1) returned by DrQA but also affect the top-k<\/jats:italic> candidate answers returned by DrQA. The adversarial examples make the top-k<\/jats:italic> candidate answers contain fewer correct answers and make the correct answers rank lower in the top-k<\/jats:italic> candidate answers. The human evaluation results show that participants with different genders, ages, and mother tongues can understand the meaning of most of the generated adversarial examples, which means that the generated adversarial examples do not affect human\u2019s understanding.<\/jats:p>","DOI":"10.1155\/2020\/5890820","type":"journal-article","created":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T18:32:42Z","timestamp":1578940362000},"page":"1-15","source":"Crossref","is-referenced-by-count":6,"title":["DPAEG: A Dependency Parse-Based Adversarial Examples Generation Method for Intelligent Q&A Robots"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2408-503X","authenticated-orcid":true,"given":"Mingfu","family":"Xue","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China"},{"name":"Collaborative Innovation Center of Novel Software Technology and Industrialization, Nanjing, China"}]},{"given":"Chengxiang","family":"Yuan","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China"},{"name":"Collaborative Innovation Center of Novel Software Technology and Industrialization, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8376-5898","authenticated-orcid":true,"given":"Jian","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China"},{"name":"Collaborative Innovation Center of Novel Software Technology and Industrialization, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8398-8648","authenticated-orcid":true,"given":"Weiqiang","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China"}]}],"member":"311","reference":[{"doi-asserted-by":"publisher","key":"1","DOI":"10.1136\/amiajnl-2011-000464"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1016\/j.jksuci.2014.10.007"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1017\/s1351324901002807"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1007\/s10994-010-5207-6"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1007\/s10994-010-5188-5"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1109\/tkde.2013.57"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1109\/msp.2016.51"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1109\/tnnls.2018.2886017"},{"doi-asserted-by":"publisher","key":"22","DOI":"10.1007\/s10994-017-5663-3"},{"doi-asserted-by":"publisher","key":"27","DOI":"10.5121\/ijwest.2013.4304"},{"doi-asserted-by":"publisher","key":"29","DOI":"10.1145\/1229179.1229180"},{"doi-asserted-by":"publisher","key":"30","DOI":"10.1109\/taslp.2016.2520371"},{"doi-asserted-by":"publisher","key":"34","DOI":"10.1147\/jrd.2012.2184637"},{"volume":"1","year":"2011","journal-title":"International Journal of Soft Computing and Engineering (IJSCE)","key":"35"},{"doi-asserted-by":"publisher","key":"36","DOI":"10.1109\/access.2018.2807385"},{"volume-title":"Dependency-based evaluation of Minipar","year":"2003","first-page":"317","key":"42"},{"issue":"2","key":"47","first-page":"291","volume":"54","year":"1964","journal-title":"English Journal"},{"doi-asserted-by":"publisher","key":"50","DOI":"10.1145\/219717.219748"},{"doi-asserted-by":"publisher","key":"51","DOI":"10.1145\/363958.363994"},{"issue":"8","key":"52","first-page":"707","volume":"10","year":"1966","journal-title":"Soviet Physics Doklady"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/5890820.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/5890820.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/5890820.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T18:32:46Z","timestamp":1578940366000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2020\/5890820\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,13]]},"references-count":20,"alternative-id":["5890820","5890820"],"URL":"https:\/\/doi.org\/10.1155\/2020\/5890820","relation":{},"ISSN":["1939-0114","1939-0122"],"issn-type":[{"type":"print","value":"1939-0114"},{"type":"electronic","value":"1939-0122"}],"subject":[],"published":{"date-parts":[[2020,1,13]]}}}