{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T10:15:15Z","timestamp":1695118515387},"reference-count":29,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Addressing Answer Selection (AS) tasks with complex neural networks typically requires a large amount of annotated data to increase the accuracy of the models. In this work, we are interested in simple models that can potentially give good performance on datasets with no or few annotations. First, we propose new unsupervised baselines that leverage distributed word and sentence representations. Second, we compare the ability of our neural architectures to learn from few annotated examples in a weakly supervised scheme and we demonstrate how these methods can benefit from a pre-training on an external dataset. With an emphasis on results reproducibility, we show that our simple methods can reach or approach state-of-the-art performances on four common AS datasets.<\/jats:p>","DOI":"10.1515\/comp-2019-0008","type":"journal-article","created":{"date-parts":[[2019,8,3]],"date-time":"2019-08-03T09:04:55Z","timestamp":1564823095000},"page":"136-144","source":"Crossref","is-referenced-by-count":0,"title":["Unsupervised and weakly supervised approaches for answer selection tasks with scarce annotations"],"prefix":"10.1515","volume":"9","author":[{"given":"Emmanuel","family":"Vallee","sequence":"first","affiliation":[{"name":"Orange Labs , Paris , France"}]},{"given":"Delphine","family":"Charlet","sequence":"additional","affiliation":[{"name":"Orange Labs , Paris , France"}]},{"given":"Francesca","family":"Galassi","sequence":"additional","affiliation":[{"name":"INRIA , Paris , France"}]},{"given":"Gabriel","family":"Marzinotto","sequence":"additional","affiliation":[{"name":"Aix Marseille Univ , Paris , France"}]},{"given":"Fabrice","family":"Cl\u00e9rot","sequence":"additional","affiliation":[{"name":"Orange Labs , Paris , France"}]},{"given":"Frank","family":"Meyer","sequence":"additional","affiliation":[{"name":"Orange Labs , Paris , France"}]}],"member":"374","published-online":{"date-parts":[[2019,7,30]]},"reference":[{"key":"2022042707443479601_j_comp-2019-0008_ref_001_w2aab3b7b7b1b6b1ab1ab1Aa","doi-asserted-by":"crossref","unstructured":"[1] Rajpurkar P., Zhang J., Lopyrev K., Liang P., SQuAD: 100,000+ Questions for Machine Comprehension of Text, 2016, arXiv: 1606.05250 [cs]10.18653\/v1\/D16-1264","DOI":"10.18653\/v1\/D16-1264"},{"key":"2022042707443479601_j_comp-2019-0008_ref_002_w2aab3b7b7b1b6b1ab1ab2Aa","doi-asserted-by":"crossref","unstructured":"[2] Yin W., Sch\u00fctze H., Xiang B., Zhou B., ABCNN: Attention-Based Convolutional Neural Network for Modeling Sentence, Pairs, 2015, arXiv: 1512.05193 [cs]10.1162\/tacl_a_00097","DOI":"10.1162\/tacl_a_00244"},{"key":"2022042707443479601_j_comp-2019-0008_ref_003_w2aab3b7b7b1b6b1ab1ab3Aa","unstructured":"[3] Wang S., Jiang J., A Compare-Aggregate Model for Matching Text Sequences, 2016, arXiv: 1611.01747 [cs]"},{"key":"2022042707443479601_j_comp-2019-0008_ref_004_w2aab3b7b7b1b6b1ab1ab4Aa","doi-asserted-by":"crossref","unstructured":"[4] Tran N. K., Niedere\u00e9e C., Multihop Attention Networks for Question Answer Matching, in The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, SIGIR \u201918, ACM, New York, NY, USA, 2018, 325\u2013334, 10.1145\/3209978.321000910.1145\/3209978.3210009","DOI":"10.1145\/3209978.3210009"},{"key":"2022042707443479601_j_comp-2019-0008_ref_005_w2aab3b7b7b1b6b1ab1ab5Aa","doi-asserted-by":"crossref","unstructured":"[5] Shen D., Wang G., Wang W., Min M.R., Su Q., Zhang Y., Li C., Henao R., Carin L., Baseline Needs More Love: On Simple Word-Embedding-Based Models and Associated Pooling Mechanisms, arXiv:1805.09843 [cs], 2018, arXiv: 1805.09843 [cs]10.18653\/v1\/P18-1041","DOI":"10.18653\/v1\/P18-1041"},{"key":"2022042707443479601_j_comp-2019-0008_ref_006_w2aab3b7b7b1b6b1ab1ab6Aa","unstructured":"[6] Bogdanova D., Foster J., This is how we do it: Answer Reranking for Open-domain How Questions with Paragraph Vectors and Minimal Feature Engineering, in HLT-NAACL, 201610.18653\/v1\/N16-1154"},{"key":"2022042707443479601_j_comp-2019-0008_ref_007_w2aab3b7b7b1b6b1ab1ab7Aa","doi-asserted-by":"crossref","unstructured":"[7] Yadav V., Sharp R., Surdeanu M., Sanity Check: A Strong Alignment and Information Retrieval Baseline for Question Answering, 2018, arXiv: 1807.01836 [cs]10.1145\/3209978.3210142","DOI":"10.1145\/3209978.3210142"},{"key":"2022042707443479601_j_comp-2019-0008_ref_008_w2aab3b7b7b1b6b1ab1ab8Aa","unstructured":"[8] Seo M., Kembhavi A., Farhadi A., Hajishirzi H., Bidirectional Attention Flow for Machine Comprehension, 2016, arXiv: 1611.01603 [cs]"},{"key":"2022042707443479601_j_comp-2019-0008_ref_009_w2aab3b7b7b1b6b1ab1ab9Aa","doi-asserted-by":"crossref","unstructured":"[9] Min S., Seo M., Hajishirzi H., Question Answering through Transfer Learning from Large Fine-grained Supervision Data, 2017, arXiv: 1702.02171 [cs]10.18653\/v1\/P17-2081","DOI":"10.18653\/v1\/P17-2081"},{"key":"2022042707443479601_j_comp-2019-0008_ref_010_w2aab3b7b7b1b6b1ab1ac10Aa","doi-asserted-by":"crossref","unstructured":"[10] Zhang P., Hou Y., Su Z., Su Y., Two-Step Multi-factor Attention Neural Network for Answer Selection, in PRICAI 2018: Trends in Artificial Intelligence, Springer, Cham, 2018, 658\u2013670, 10.1007\/978-3-319-97304-3_5010.1007\/978-3-319-97304-3_50","DOI":"10.1007\/978-3-319-97304-3_50"},{"key":"2022042707443479601_j_comp-2019-0008_ref_011_w2aab3b7b7b1b6b1ab1ac11Aa","doi-asserted-by":"crossref","unstructured":"[11] Kuhn H. W., The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, 1955, 2(1-2), 83-97, 10.1002\/nav.380002010910.1002\/nav.3800020109","DOI":"10.1002\/nav.3800020109"},{"key":"2022042707443479601_j_comp-2019-0008_ref_012_w2aab3b7b7b1b6b1ab1ac12Aa","unstructured":"[12] Mikolov T., Sutskever I., Chen K., Corrado G.S., Dean J., Distributed Representations of Words and Phrases and their Compositionality, in C.J.C. Burges, L. Bottou, M. Welling, Z. Ghahramani, K.Q. Weinberger, eds., Advances in Neural Information Processing Systems 26, Curran Associates, Inc., 2013, 3111\u20133119"},{"key":"2022042707443479601_j_comp-2019-0008_ref_013_w2aab3b7b7b1b6b1ab1ac13Aa","doi-asserted-by":"crossref","unstructured":"[13] Cer D., Yang., Kong S. Y., Hua N., Limtiaco N., John R.S., Constant N., Guajardo-Cespedes M., Yuan S., Tar C., Sung Y.H., Strope B., Kurzweil R., Universal Sentence Encoder, 2018, arXiv: 1803.11175 [cs]10.18653\/v1\/D18-2029","DOI":"10.18653\/v1\/D18-2029"},{"key":"2022042707443479601_j_comp-2019-0008_ref_014_w2aab3b7b7b1b6b1ab1ac14Aa","doi-asserted-by":"crossref","unstructured":"[14] Crane M., Questionable Answers in Question Answering Research: Reproducibility and Variability of Published Results, Transactions of the Association for Computational Linguistics, 2018, 6(0), 241\u201325210.1162\/tacl_a_00018","DOI":"10.1162\/tacl_a_00018"},{"key":"2022042707443479601_j_comp-2019-0008_ref_015_w2aab3b7b7b1b6b1ab1ac15Aa","unstructured":"[15] Vaswani A., Shazeer N., Parmar N., Uszkoreit J., Jones L., Gomez A.N., Kaiser L., Polosukhin I., Attention Is All You Need, 2017, arXiv: 1706.03762 [cs]"},{"key":"2022042707443479601_j_comp-2019-0008_ref_016_w2aab3b7b7b1b6b1ab1ac16Aa","doi-asserted-by":"crossref","unstructured":"[16] Robertson S. E., Jones K. S., Relevance weighting of search terms, Journal of the American Society for Information Science, 1976, 27(3), 129\u2013146, 10.1002\/asi.463027030210.1002\/asi.4630270302","DOI":"10.1002\/asi.4630270302"},{"key":"2022042707443479601_j_comp-2019-0008_ref_017_w2aab3b7b7b1b6b1ab1ac17Aa","unstructured":"[17] Lai T. M., Bui T., Li S., A Review on Deep Learning Techniques Applied to Answer Selection, in Proceedings of the 27th International Conference on Computational Linguistics, Association for Computational Linguistics, Santa Fe, New Mexico, USA, 2018, 2132\u20132144"},{"key":"2022042707443479601_j_comp-2019-0008_ref_018_w2aab3b7b7b1b6b1ab1ac18Aa","unstructured":"[18] Wang M., Smith N. A., Mitamura T., What is the Jeopardy Model? A Quasi-Synchronous Grammar for QA, in Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL), 2007"},{"key":"2022042707443479601_j_comp-2019-0008_ref_019_w2aab3b7b7b1b6b1ab1ac19Aa","doi-asserted-by":"crossref","unstructured":"[19] Wang D., Nyberg E., A Long Short-Term Memory Model for Answer Sentence Selection in Question Answering, in Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 2: Short Papers), Association for Computational Linguistics, 2015, 707\u2013712, 10.3115\/v1\/P15-2116, event-place: Beijing, China10.3115\/v1\/P15-2116","DOI":"10.3115\/v1\/P15-2116"},{"key":"2022042707443479601_j_comp-2019-0008_ref_020_w2aab3b7b7b1b6b1ab1ac20Aa","doi-asserted-by":"crossref","unstructured":"[20] Nakov P., M\u00e0rquez L., Moschitti A., Magdy W., Mubarak H., Freihat a.A., Glass J., Randeree B., SemEval-2016 Task 3: Community Question Answering, in Proceedings of the 10th International Workshop on Semantic Evaluation, Association for Computational Linguistics, San Diego, California, 2016, 525\u2013545, 10.18653\/v1\/S16-108310.18653\/v1\/S16-1083","DOI":"10.18653\/v1\/S16-1083"},{"key":"2022042707443479601_j_comp-2019-0008_ref_021_w2aab3b7b7b1b6b1ab1ac21Aa","doi-asserted-by":"crossref","unstructured":"[21] Jansen P., Surdeanu M., Clark P., Discourse Complements Lexical Semantics for Non-factoid Answer Reranking, in Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), Association for Computational Linguistics, Baltimore, Maryland, 2014, 977\u2013986, 10.3115\/v1\/P14-109210.3115\/v1\/P14-1092","DOI":"10.3115\/v1\/P14-1092"},{"key":"2022042707443479601_j_comp-2019-0008_ref_022_w2aab3b7b7b1b6b1ab1ac22Aa","unstructured":"[22] Kingma D.P., Ba J., Adam: A Method for Stochastic Optimization, 2014, arXiv: 1412.6980 [cs]"},{"key":"2022042707443479601_j_comp-2019-0008_ref_023_w2aab3b7b7b1b6b1ab1ac23Aa","doi-asserted-by":"crossref","unstructured":"[23] Liu Y., Rong W., Xiong Z., Improved Text Matching by Enhancing Mutual Information, in AAAI, 2018","DOI":"10.1609\/aaai.v32i1.11948"},{"key":"2022042707443479601_j_comp-2019-0008_ref_024_w2aab3b7b7b1b6b1ab1ac24Aa","unstructured":"[24] Tayyar Madabushi H., Lee M., Barnden J., Integrating Question Classification and Deep Learning for improved Answer Selection, in Proceedings of the 27th International Conference on Computational Linguistics, Association for Computational Linguistics, Santa Fe, New Mexico, USA, 2018, 3283\u20133294"},{"key":"2022042707443479601_j_comp-2019-0008_ref_025_w2aab3b7b7b1b6b1ab1ac25Aa","doi-asserted-by":"crossref","unstructured":"[25] Zhang H., Rao J., Lin J., Smucker M.D., Automatically Extracting High-Quality Negative Examples for Answer Selection in Question Answering, in Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR \u201917, ACM, New York, NY, USA, 2017, 797\u201380010.1145\/3077136.3080645","DOI":"10.1145\/3077136.3080645"},{"key":"2022042707443479601_j_comp-2019-0008_ref_026_w2aab3b7b7b1b6b1ab1ac26Aa","doi-asserted-by":"crossref","unstructured":"[26] Bogdanova D., Foster J., Dzendzik D., Liu Q., If You Can\u2019t Beat Them Join Them: Handcrafted Features Complement Neural Nets for Non-Factoid Answer Reranking, in HLT-EACL, Association for Computational Linguistics, Valencia, Spain, 2017, 121\u201313110.18653\/v1\/E17-1012","DOI":"10.18653\/v1\/E17-1012"},{"key":"2022042707443479601_j_comp-2019-0008_ref_027_w2aab3b7b7b1b6b1ab1ac27Aa","doi-asserted-by":"crossref","unstructured":"[27] Cohen D., Mitra B., Hofmann K., Croft W. B., Cross Domain Regularization for Neural Ranking Models Using Adversarial Learning, 2018, arXiv: 1805.03403 [cs]10.1145\/3209978.3210141","DOI":"10.1145\/3209978.3210141"},{"key":"2022042707443479601_j_comp-2019-0008_ref_028_w2aab3b7b7b1b6b1ab1ac28Aa","doi-asserted-by":"crossref","unstructured":"[28] Seo M., Kwiatkowski T., Parikh A. P., Farhadi A., Hajishirzi H., Phrase-Indexed Question Answering: A New Challenge for Scalable Document Comprehension, 2018, arXiv: 1804.07726 [cs]10.18653\/v1\/D18-1052","DOI":"10.18653\/v1\/D18-1052"},{"key":"2022042707443479601_j_comp-2019-0008_ref_029_w2aab3b7b7b1b6b1ab1ac29Aa","unstructured":"[29] R\u00fcckl\u00e9 A., Gurevych I., Representation Learning for Answer Selection with LSTM-Based Importance Weighting, IWCS 2017 \u2014 12th International Conference on Computational Semantics \u2014 Short papers, 2017"}],"container-title":["Open Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/comp\/9\/1\/article-p136.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2019-0008\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2019-0008\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T20:28:05Z","timestamp":1695068885000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2019-0008\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":29,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,9,26]]},"published-print":{"date-parts":[[2019,1,1]]}},"alternative-id":["10.1515\/comp-2019-0008"],"URL":"https:\/\/doi.org\/10.1515\/comp-2019-0008","relation":{},"ISSN":["2299-1093"],"issn-type":[{"value":"2299-1093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,1]]}}}