{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:10:00Z","timestamp":1742962200655,"version":"3.40.3"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031453915"},{"type":"electronic","value":"9783031453922"}],"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-3-031-45392-2_14","type":"book-chapter","created":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T20:17:29Z","timestamp":1697055449000},"page":"211-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Who Killed the\u00a0Winograd Schema Challenge?"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Neri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio G.","family":"Cozman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,12]]},"reference":[{"key":"14_CR1","unstructured":"Open AI. GPT4 Technical Report. arXiv:2303.08774, 2023"},{"key":"14_CR2","unstructured":"Bailey, D., Harrison, A., Lierler, Y., Lifschitz, V., Michael, J.: The winograd schema challenge and reasoning about correlation. In: Working Notes of the Symposium on Logical Formalizations of Commonsense Reasoning (2015)"},{"key":"14_CR3","unstructured":"Bender, D.: Establishing a human baseline for the Winograd schema challenge. In: Modern AI and Cognitive Science Conference, pp. 39\u201345 (2015)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Bobrow, D.: Precision-focussed textual inference. In: Proceedings of the Workshop on Textual Entailment and Paraphrasing ACL, Prague (2007)","DOI":"10.3115\/1654536.1654541"},{"key":"14_CR5","unstructured":"Brown, T.B., et al.: Language models are few-shot learners. arXiv:2005.14165 (2020)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.ijar.2021.06.003","volume":"136","author":"FG Cozman","year":"2020","unstructured":"Cozman, F.G., Neri, H.: Some thoughts on knowledge-enhanced machine learning. Int. J. Approximate Reasoning 136, 308\u2013324 (2020)","journal-title":"Int. J. Approximate Reasoning"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Dagan, I.: Recognizing textual entailment: Rational, evaluation and approaches. Natural Lang. Eng. 15(4), i-xvii (2009)","DOI":"10.1017\/S1351324909990209"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/11736790_9","volume-title":"Machine Learning Challenges. Evaluating Predictive Uncertainty, Visual Object Classification, and Recognising Tectual Entailment","author":"I Dagan","year":"2006","unstructured":"Dagan, I., Glickman, O., Magnini, B.: The PASCAL Recognising Textual Entailment Challenge. In: Qui\u00f1onero-Candela, J., Dagan, I., Magnini, B., d\u2019Alch\u00e9-Buc, F. (eds.) MLCW 2005. LNCS (LNAI), vol. 3944, pp. 177\u2013190. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11736790_9"},{"key":"14_CR9","unstructured":"Dai, A.M., Le, V.Q.: Semi-supervised sequence learning. In: C. Cortes, N. Lawrence, D. Lee, M. Sugiyama, and R. Garnett, eds, Advances in Neural Information Processing Systems, vol. 28. Curran Associates Inc (2015)"},{"key":"14_CR10","unstructured":"Davies, E.: Winograd schemas and machine translation. arXiv:1608.01884 (2016)"},{"issue":"3","key":"14_CR11","first-page":"97","volume":"38","author":"E Davis","year":"2017","unstructured":"Davis, E., Morgenstern, L., Ortiz, C.L.: The first Winograd Schema Challenge at IJCAI-16. AI Mag. 38(3), 97\u201398 (2017)","journal-title":"AI Mag."},{"key":"14_CR12","unstructured":"Devlin, J., Chang, M.-W., Lee, K., Toutanova, K.: BERT: pre-training of deep bidirectional transformers for language understanding. arXiv:1810.04805v2 (2019)"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Elazar, Y., Zhang, H., Goldberg, Y., Roth, D.: Back to square one: artifact detection, training and commonsense disentanglement in the Winograd schema. In: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, pages 10486\u201310500. Association for Computational Linguistics (2021)","DOI":"10.18653\/v1\/2021.emnlp-main.819"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Emami, A., et al.: The KnowRef coreference corpus: removing gender and number cues for difficult pronominal anaphora resolution. In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pp. 3952\u20133961, Florence, Italy, July 2019. Association for Computational Linguistics (2019)","DOI":"10.18653\/v1\/P19-1386"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Emami, A., Trischler, A., Suleman, K., Chi, J., Cheung, K.: A generalized knowledge hunting framework for the Winograd Schema Challenge. In: NAACL-HLT 2018: Student Research Workshop, pp. 25\u201331 (2018)","DOI":"10.18653\/v1\/N18-4004"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Frege, G.: Sense and reference. Philos. Rev. 57 (1948)","DOI":"10.2307\/2181485"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Joshi, B., Shah, N., Barbieri, F., Leonardo Neves, L.: The devil is in the details: evaluating limitations of transformer-based methods for granular tasks. In: Proceedings of the 28th International Conference on Computational Linguistics, pp. 3652\u20133659, Barcelona, Spain (Online). International Committee on Computational Linguistics (2020)","DOI":"10.18653\/v1\/2020.coling-main.326"},{"key":"14_CR18","unstructured":"Jurafsky, D., Martin, J.H.: Speech and Language Processing (3rd ed. draft) (2023)"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Kavumba, P., Inoue, N., Heinzerling, B., Singh, K., Reisert, P., Kentaro Inui, K.: When choosing plausible alternatives, Clever Hans can be clever. In: Proceedings of the First Workshop on Commonsense Inference in Natural Language Processing, pp. 33\u201342, Hong Kong, China. Association for Computational Linguistics (2019)","DOI":"10.18653\/v1\/D19-6004"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Kocijan, V., Cretu, A.-M., Camburu, O.-M., Yordanov, Y., Lukasiewicz, T.: A surprisingly robust trick for the Winograd scheme challenge. In: Annual Meeting of the Association for Computational Linguistics, pp. 4837\u20134842 (2019)","DOI":"10.18653\/v1\/P19-1478"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Kocijan, V., Davis, E., Lukasiewicz, T., Marcus, G., Leora Morgenstern, L.: The defeat of the Winograd Schema Challenge. arXiv:2201.02387 (2023)","DOI":"10.1016\/j.artint.2023.103971"},{"key":"14_CR22","unstructured":"Kocijan, V., Lukasiewicz, T., Davis, E., Marcus, G.: A review of Winograd Schema Challenge datasets and approaches. arXiv:2004.13831v1 (2020)"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Korman, D.: Defining textual entailment. J. Assoc. Inf. Sci. Technol. 69 (2018)","DOI":"10.1002\/asi.24007"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Levesque, H.: The winograd schema challenge. In: AAAI (2011)","DOI":"10.1007\/978-1-4419-1695-2_596"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Levesque, H.: On our best behaviour. In: IJCAI (2013)","DOI":"10.1016\/j.artint.2014.03.007"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Levesque, H.: Common Sense, the Turing Test, and the Quest for Real AI. The MIT Press (2017)","DOI":"10.7551\/mitpress\/10909.001.0001"},{"key":"14_CR27","unstructured":"Levesque, H., Davis, E., Morgenstern, L.: The Winograd Schema Challenge. Knowledge Representation (2012)"},{"key":"14_CR28","unstructured":"Liu, Q., Jiang, H., Ling, H.-Z., Zhu, X,. Wei, S., Hu, Y.: Commonsense knowledge enhanced embeddings for solving pronoun disambiguation problems in Winograd schemes challenge. arXiv:1611.04146 (2016)"},{"key":"14_CR29","unstructured":"Yinhan Liu, Y., et al.: RoBERTa: a robustly optimized BERT pretraining approach. arXiv:1907.11692 (2019)"},{"key":"14_CR30","unstructured":"Marcus, G., Davis, E.: Rebooting AI: Building Artificial Intelligence We Can Trust. Pantheon (2019)"},{"key":"14_CR31","volume-title":"M\u00fcller","author":"A George","year":"1951","unstructured":"George, A.: M\u00fcller. Language and Communication, McGraw-Hili (1951)"},{"key":"14_CR32","unstructured":"Nicos, I., Michael Loizos, M.: Tackling the Winograd schema Challenge through machine logical inferences. STAIRS 75 (2016)"},{"key":"14_CR33","unstructured":"Nicos, I., Michael Loizos, M.: How the availability of training material affects performance in the Winograd Schema Challenge (2017)"},{"key":"14_CR34","unstructured":"Nicos, I., Michael Loizos, M.: A data-driven metric of hardness for WSC sentences. GCAI-2018 (EPiC Series in Computing) 55, 107\u2013120 (2018)"},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Judea Pearl, J.: Causality: Models, Reasoning, and Inference. Cambridge University Press, 2$${}^{\\underline{\\rm a}}$$ edition (2009)","DOI":"10.1017\/CBO9780511803161"},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Peters, M.E., Neumann, M., Iyyer, M, Gardner, M., Kenton Lee, K., Luke Zettlemoyer, L.: Deep contextualized word representations, Christopher Clark (2018)","DOI":"10.18653\/v1\/N18-1202"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"Quine. Two dogmas of empiricism. Philos. Rev. 60 (1951)","DOI":"10.2307\/2181906"},{"key":"14_CR38","unstructured":"Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., Sutskever, I.: Language models are unsupervised multitask learners. Technical Report 8, OpenAI Blog (2019)"},{"key":"14_CR39","unstructured":"Rahman, A., Ng, V.: Resolving complex cases of definite pronouns: The Winograd schema challenge. In: Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, pp. 777\u2013789, Jeju Island, Korea (2012). Association for Computational Linguistics"},{"key":"14_CR40","unstructured":"Ruan, Y.-P., Zhu, X., Ling, Z.-H., Shi, Z., Liu, Q., Wei, S.: Exploring unsupervised pretraining and sentence structure modelling for Winograd schemes challenge. arXiv:1904.09705 (2019)"},{"key":"14_CR41","doi-asserted-by":"crossref","unstructured":"Rus, V.: A study of textual entailment. Int. J. Art. Intell. Tools 17 (2007)","DOI":"10.1142\/S0218213008004096"},{"key":"14_CR42","unstructured":"Sakaguchi, K., Bras, R.L., Bhagavatula, C., Choi, Y.: Winogrande: an adversarial Winograd Schema Challenge at scale. arXiv:1907.10641v2 (2019)"},{"key":"14_CR43","doi-asserted-by":"crossref","unstructured":"Sakaguchi, K., Bras, R.L., Bhagavatula, C., Choi, Y.: Winogrande: an adversarial Winograd Schema Challenge at scale. AAAI-20 Technical Tracks 34(05) (2019)","DOI":"10.1609\/aaai.v34i05.6399"},{"key":"14_CR44","unstructured":"Sakaguchi, K., Bras, R.L., Bhagavatula, C., Yejin Choi, Y.: Winogrande: an adversarial Winograd Schema Challenge at scale. arXiv:1907.10641v1 (2019)"},{"key":"14_CR45","doi-asserted-by":"crossref","unstructured":"Taylor, W.: Cloze procedure: a new tool for measuring readability. J. Quartely Fall (1953)","DOI":"10.1177\/107769905303000401"},{"key":"14_CR46","unstructured":"Hugo Touvron, H., et al.: LLaMA: open and efficient foundation language models. Technical report, arXiv:2302.13971 (2023)"},{"key":"14_CR47","unstructured":"Trichelair, P., et al.: On the evaluation of common-sense reasoning in natural language understanding. arXiv preprint arXiv:1811.01778 (20180"},{"key":"14_CR48","unstructured":"Trinh, T., Quoc Le, Q.: A simple method for commonsense reasoning. arXiv:1806.02847 (2018)"},{"key":"14_CR49","doi-asserted-by":"crossref","unstructured":"van Aken, B., Winter, B., L\u00f6ser, A., Felix, A.: Gers. How does BERT answer questions? a layer-wise analysis of transformer representations. In: Association for Computing Machinery, editor, Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM \u201919, pp. 1823\u20131832 (2019)","DOI":"10.1145\/3357384.3358028"},{"key":"14_CR50","unstructured":"Vaswani, A., et al.: Attention is all you need. In: 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA (2017)"},{"key":"14_CR51","doi-asserted-by":"crossref","unstructured":"Zhang, H., Song, Y.: A distributed solution for Winograd Schema Challenge. In: ICMLC2018 (2018)","DOI":"10.1145\/3195106.3195127"},{"key":"14_CR52","doi-asserted-by":"crossref","unstructured":"Zhu, Y, et al.: Aligning books and movies: towards story-like visual explanations by watching movies and reading books. In: The IEEE International Conference on Computer Vision (ICCV) (2015)","DOI":"10.1109\/ICCV.2015.11"}],"container-title":["Lecture Notes in Computer Science","Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45392-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:49:03Z","timestamp":1710348543000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45392-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031453915","9783031453922"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45392-2_14","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":"12 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BRACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Conference on Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belo Horizonte","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","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 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bracis2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.bracis.dcc.ufmg.br","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":"JEMS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"242","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":"90","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":"0","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":"37% - 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":"4","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":"5","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)"}}]}}