<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="amsili-seminck-2017-google">
    <titleInfo>
        <title>A Google-Proof Collection of French Winograd Schemas</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Pascal</namePart>
        <namePart type="family">Amsili</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Olga</namePart>
        <namePart type="family">Seminck</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2017-apr</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 2nd Workshop on Coreference Resolution Beyond OntoNotes (CORBON 2017)</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Valencia, Spain</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <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.</abstract>
    <identifier type="citekey">amsili-seminck-2017-google</identifier>
    <identifier type="doi">10.18653/v1/W17-1504</identifier>
    <location>
        <url>https://aclanthology.org/W17-1504</url>
    </location>
    <part>
        <date>2017-apr</date>
        <extent unit="page">
            <start>24</start>
            <end>29</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T A Google-Proof Collection of French Winograd Schemas
%A Amsili, Pascal
%A Seminck, Olga
%S Proceedings of the 2nd Workshop on Coreference Resolution Beyond OntoNotes (CORBON 2017)
%D 2017
%8 apr
%I Association for Computational Linguistics
%C Valencia, Spain
%F amsili-seminck-2017-google
%X 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.
%R 10.18653/v1/W17-1504
%U https://aclanthology.org/W17-1504
%U https://doi.org/10.18653/v1/W17-1504
%P 24-29

Markdown (Informal)

[A Google-Proof Collection of French Winograd Schemas](https://aclanthology.org/W17-1504) (Amsili & Seminck, 2017)

• A Google-Proof Collection of French Winograd Schemas (Amsili & Seminck, 2017)

ACL

• Pascal Amsili and Olga Seminck. 2017. A Google-Proof Collection of French Winograd Schemas. In Proceedings of the 2nd Workshop on Coreference Resolution Beyond OntoNotes (CORBON 2017), pages 24–29, Valencia, Spain. Association for Computational Linguistics.