{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:42:47Z","timestamp":1725594167818},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1109\/ialp48816.2019.9037729","type":"proceedings-article","created":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T03:29:02Z","timestamp":1584674942000},"page":"331-336","source":"Crossref","is-referenced-by-count":1,"title":["How to Answer Comparison Questions"],"prefix":"10.1109","author":[{"given":"Hongxuan","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaili","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"5998","article-title":"Attention is all you need","author":"vaswani","year":"2017","journal-title":"In Advances in Neural Information Processing Systems"},{"key":"ref11","first-page":"1693","article-title":"Teaching machines to read and comprehend","author":"hermann","year":"2015","journal-title":"In Advances in Neural Information Processing Systems"},{"key":"ref12","article-title":"The goldilocks principle: Reading children’s books with explicit memory representations","author":"hill","year":"2015","journal-title":"Computer Science"},{"key":"ref13","first-page":"193","article-title":"Mctest: A challenge dataset for the open-domain machine comprehension of text","author":"richardson","year":"2013","journal-title":"In Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing"},{"key":"ref14","article-title":"Coqa: A conversational question answering challenge","author":"reddy","year":"2018","journal-title":"arXiv preprint arXiv 1808 02194"},{"journal-title":"Neural reading comprehension and beyond","year":"0","author":"chen","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1181"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1179"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-1171"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref4","article-title":"Reinforced mnemonic reader for machine reading comprehension","author":"hu","year":"2017","journal-title":"ArXiv preprint arXiv 1705 02798"},{"key":"ref3","article-title":"Bert: Pre-training of deep bidirectional transformers for language understanding","author":"devlin","year":"2018","journal-title":"arXiv preprint arXiv 1810 04805"},{"key":"ref6","article-title":"Recurrent neural network based language model","author":"mikolov","year":"2010","journal-title":"Eleventh Annual Conf the Int Speech Communications Association"},{"article-title":"Flowqa: Grasping flow in history for conversational machine comprehension","year":"2018","author":"huang","key":"ref5"},{"key":"ref8","article-title":"Bidirectional attention flow for machine comprehension","author":"seo","year":"2016","journal-title":"arXiv preprint arXiv 1611 01603"},{"key":"ref7","first-page":"2692","article-title":"Pointer networks","author":"vinyals","year":"2015","journal-title":"In Advances in Neural Information Processing Systems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1259"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D16-1264"},{"key":"ref9","article-title":"Machine comprehension using match-lstm and answer pointer","author":"wang","year":"2016","journal-title":"arXiv preprint arXiv 1608 07905"},{"key":"ref20","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"arXiv preprint arXiv 1412 6980"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1613"}],"event":{"name":"2019 International Conference on Asian Language Processing (IALP)","start":{"date-parts":[[2019,11,15]]},"location":"Shanghai, Singapore","end":{"date-parts":[[2019,11,17]]}},"container-title":["2019 International Conference on Asian Language Processing (IALP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9032029\/9037565\/09037729.pdf?arnumber=9037729","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T17:53:37Z","timestamp":1658080417000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9037729\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/ialp48816.2019.9037729","relation":{},"subject":[],"published":{"date-parts":[[2019,11]]}}}