The Winograd Schema Challenge

By Ernest Davis, Leora Morgenstern, and Charles Ortiz A Winograd schema is a pair of sentences that differ in only one or two words and that contain an ambiguity that is resolved in opposite ways in the two sentences and requires the use of world knowledge and reasoning for its resolution. The schema takes its name from a well-known example by Terry Winograd If the word is ``feared'', then ``they'' presumably refers to the city council; if it is ``advocated'' then ``they'' presumably refers to the demonstrators. In his paper, ``The Winograd Schema Challenge'' Hector Levesque (2011) proposes to assemble a set of such Winograd schemas that are The set would then be presented as a challenge for AI programs, along the lines of the Turing test. The strengths of the challenge are that it is clear-cut, in that the answer to each schema is a binary choice; vivid, in that it is obvious to non-experts that a program that fails to get the right answers clearly has serious gaps in ...

2 mentions: @MIT_CSAIL@fredbenenson
Date: 2019/06/10 17:15

Referring Tweets

@MIT_CSAIL #otd in 2012 computer scientists proposed an alternate Turing Test for language called the “Winograd Schema” that requires common-sense reasoning: (v/@NYU @UToronto)
@fredbenenson @pomeranian99 I was just explaining this to someone at a conference when they asked me about "strong AI"! I said they should be paying attention to the Winograd Schema: