{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T14:28:10Z","timestamp":1749997690795,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819972531"},{"type":"electronic","value":"9789819972548"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-7254-8_7","type":"book-chapter","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T05:01:47Z","timestamp":1697864507000},"page":"82-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Towards Robust Token Embeddings for\u00a0Extractive Question Answering"],"prefix":"10.1007","author":[{"given":"Xun","family":"Yao","sequence":"first","affiliation":[]},{"given":"Junlong","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Xinrong","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Junping","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,21]]},"reference":[{"unstructured":"Cuturi, M.: Sinkhorn distances: lightspeed computation of optimal transport. In: Burges, C., Bottou, L., Welling, M., Ghahramani, Z., Weinberger, K. (eds.) Advances in Neural Information Processing Systems, vol. 26 (2013)","key":"7_CR1"},{"unstructured":"Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), pp. 4171\u20134186. Association for Computational Linguistics, Minneapolis, Minnesota (2019)","key":"7_CR2"},{"doi-asserted-by":"crossref","unstructured":"Fisch, A., Talmor, A., Jia, R., Seo, M., Choi, E., Chen, D.: MRQA 2019 shared task: evaluating generalization in reading comprehension. In: Proceedings of the 2nd Workshop on Machine Reading for Question Answering, pp. 1\u201313. Association for Computational Linguistics, Hong Kong, China (2019)","key":"7_CR3","DOI":"10.18653\/v1\/D19-5801"},{"doi-asserted-by":"crossref","unstructured":"Gehring, J., Miao, Y., Metze, F., Waibel, A.: Extracting deep bottleneck features using stacked auto-encoders. In: 2013 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 3377\u20133381 (2013)","key":"7_CR4","DOI":"10.1109\/ICASSP.2013.6638284"},{"unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT Press, Cambridge (2016). http:\/\/www.deeplearningbook.org","key":"7_CR5"},{"doi-asserted-by":"crossref","unstructured":"Joshi, M., Chen, D., Liu, Y., Weld, D.S., Zettlemoyer, L., Levy, O.: SpanBERT: improving pre-training by representing and predicting spans, vol. 8, pp. 64\u201377. MIT Press, Cambridge, MA (2020)","key":"7_CR6","DOI":"10.1162\/tacl_a_00300"},{"doi-asserted-by":"publisher","unstructured":"Kang, M., Baek, J., Hwang, S.J.: KALA: knowledge-augmented language model adaptation. In: Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp. 5144\u20135167. Association for Computational Linguistics, Seattle, United States (2022). https:\/\/doi.org\/10.18653\/v1\/2022.naacl-main.379, https:\/\/aclanthology.org\/2022.naacl-main.379","key":"7_CR7","DOI":"10.18653\/v1\/2022.naacl-main.379"},{"doi-asserted-by":"crossref","unstructured":"Lee, S., Kang, M., Lee, J., Hwang, S.J.: Learning to perturb word embeddings for out-of-distribution QA. In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pp. 5583\u20135595. Association for Computational Linguistics (2021)","key":"7_CR8","DOI":"10.18653\/v1\/2021.acl-long.434"},{"unstructured":"Liu, Y., et al.: RoBERTa: A robustly optimized BERT pretraining approach. ArXiv preprint abs\/1907.11692. (019)","key":"7_CR9"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-030-86383-8_29","volume-title":"Artificial Neural Networks and Machine Learning \u2013 ICANN 2021","author":"D Luo","year":"2021","unstructured":"Luo, D., et al.: Evidence augment for multiple-choice machine reading comprehension by weak supervision. In: Farka\u0161, I., Masulli, P., Otte, S., Wermter, S. (eds.) ICANN 2021. LNCS, vol. 12895, pp. 357\u2013368. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86383-8_29"},{"doi-asserted-by":"crossref","unstructured":"Ng, N., Cho, K., Ghassemi, M.: SSMBA: self-supervised manifold based data augmentation for improving out-of-domain robustness. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 1268\u20131283. Association for Computational Linguistics (2020)","key":"7_CR11","DOI":"10.18653\/v1\/2020.emnlp-main.97"},{"doi-asserted-by":"crossref","unstructured":"Seonwoo, Y., Kim, J.H., Ha, J.W., Oh, A.: Context-aware answer extraction in question answering. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 2418\u20132428. Association for Computational Linguistics (2020)","key":"7_CR12","DOI":"10.18653\/v1\/2020.emnlp-main.189"},{"issue":"56","key":"7_CR13","first-page":"1929","volume":"15","author":"N Srivastava","year":"2014","unstructured":"Srivastava, N., Hinton, G., Krizhevsky, A., Sutskever, I., Salakhutdinov, R.: Dropout: a simple way to prevent neural networks from overfitting. J. Mach. Learn. Res. 15(56), 1929\u20131958 (2014)","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"crossref","unstructured":"Sun, K., Yu, D., Yu, D., Cardie, C.: Improving machine reading comprehension with general reading strategies. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), pp. 2633\u20132643. Association for Computational Linguistics, Minneapolis, Minnesota (2019)","key":"7_CR14","DOI":"10.18653\/v1\/N19-1270"},{"doi-asserted-by":"publisher","unstructured":"Villani, C.: Optimal Transport Old and New. Grundlehren der mathematischen Wissenschaften, vol. 338. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-540-71050-9","key":"7_CR15","DOI":"10.1007\/978-3-540-71050-9"},{"doi-asserted-by":"crossref","unstructured":"Wang, R., et al.: K-Adapter: infusing knowledge into pre-trained models with adapters. In: Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021, pp. 1405\u20131418. Association for Computational Linguistics (2021)","key":"7_CR16","DOI":"10.18653\/v1\/2021.findings-acl.121"},{"doi-asserted-by":"crossref","unstructured":"Wei, J., Zou, K.: EDA: easy data augmentation techniques for boosting performance on text classification tasks. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pp. 6382\u20136388. Association for Computational Linguistics, Hong Kong, China (2019)","key":"7_CR17","DOI":"10.18653\/v1\/D19-1670"},{"doi-asserted-by":"crossref","unstructured":"Zhang, C., et al.: Read, attend, and exclude: multi-choice reading comprehension by mimicking human reasoning process. In: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2020, pp. 1945\u20131948. Association for Computing Machinery, New York (2020)","key":"7_CR18","DOI":"10.1145\/3397271.3401326"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-7254-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T15:09:07Z","timestamp":1730387347000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-7254-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819972531","9789819972548"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-7254-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wise-conferences.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"137","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}