Skip to Main content Skip to Navigation
Journal articles

A Google-Proof Collection of French Winograd Schemas

Abstract : This article presents the first collection of French Winograd Schemas. Winograd Schemas form anaphora resolution problems that can only be resolved with extensive world knowledge. For this reason the Winograd Schema Challenge has been proposed as an alternative to the Turing Test. A very important feature of Winograd Schemas is that it should be impossible to resolve them with statistical information about word co-occurrences: they should be Google-proof. We propose a measure of Google-proofness based on Mutual Information, and demonstrate the method on our collection of French Winograd Schemas.
Document type :
Journal articles
Complete list of metadata
Contributor : Alexandre Roulois Connect in order to contact the contributor
Submitted on : Friday, December 14, 2018 - 10:43:53 AM
Last modification on : Thursday, March 17, 2022 - 10:08:22 AM


  • HAL Id : halshs-01955086, version 1


Pascal Amsili, Olga Seminck. A Google-Proof Collection of French Winograd Schemas. Proceedings of the 2nd Workshop on Coreference Resolution Beyond OntoNotes (CORBON 2017), co-located with EACL 2017, 2017, pp.24-29. ⟨halshs-01955086⟩



Record views