A Google-Proof Collection of French Winograd Schemas - HAL Accéder directement au contenu
Communication dans un congrès Année : 2017

A Google-Proof Collection of French Winograd Schemas

Résumé

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.
Fichier principal
Vignette du fichier
Corbon2017Winograd_schemas.pdf ( 186.98 Ko ) Télécharger
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

halshs-01955086, version 1 (19-09-2022)

Identifiants

  • HAL Id : halshs-01955086 , version 1

Citer

Pascal Amsili, Olga Seminck. A Google-Proof Collection of French Winograd Schemas. The 2nd Workshop on Coreference Resolution Beyond OntoNotes (CORBON 2017), co-located with EACL 2017, Apr 2017, Valencia, Spain. pp.24-29. ⟨halshs-01955086⟩
94 Consultations
13 Téléchargements
Dernière date de mise à jour le 28/04/2024
comment ces indicateurs sont-ils produits

Partager

Gmail Facebook Twitter LinkedIn Plus