Winograd Schema Challenge

The Winograd Schema Challenge (WSC) is a test of machine intelligence proposed by Hector Levesque, a computer scientist at the University of Toronto. Designed to be an improvement on the Turing test, it is a multiple-choice test that employs questions of a very specific structure: they are instances of what are called Winograd Schemas, named after Terry Winograd, a professor of computer science at Stanford University.[1]

On the surface, Winograd Schema questions simply require the resolution of anaphora: the machine must identify the antecedent of an ambiguous pronoun in a statement. This makes it a task of natural language processing, but Levesque argues that for Winograd Schemas, the task requires the use of knowledge and commonsense reasoning.[2]

Nuance Communications announced in July 2014 that it would sponsor an annual WSC competition, with a prize of $25,000 for the best system that could match human performance.[3]

History

The Winograd Schema Challenge was proposed in the spirit of the Turing Test. Proposed by Alan Turing in 1950, the Turing Test plays a central role in the philosophy of artificial intelligence. Turing proposed that instead of debating what intelligence is, the science of AI should be concerned with demonstrating intelligent behavior, which can be tested. But the exact nature of the test Turing proposed has come under scrutiny, especially since an AI chat box named Eugene was claimed to pass it in 2014. The Winograd Schema Challenge was proposed in part to ameliorate the problems that came to light with the nature of the programs that performed well on the test.[4]

Turing's original proposal was what he called the Imitation Game, which involves free-flowing, unrestricted conversations in English between human judges and computer programs over a text-only channel (such as teletype). In general, the machine passes the test if interrogators are not able to tell the difference between it and a human in a five-minute conversation.[5]

Eugene Goostman

On June 7, 2014, a computer program named Eugene Goostman was declared to be the first AI to have passed the Turing Test in a competition held by the University of Reading in England. In the competition Eugene was able to convince 33% of judges that they were talking with a 13-year-old Ukrainian boy.[6] The supposed victory of a machine that thinks aroused controversies about the Turing Test. Critics claimed that Eugene passed the test simply by fooling the judge and taking advantages of its purported identity. For example, it could easily skip some key questions by joking around and changing subjects. However, the judge would forgive its mistakes because Eugene identified as a teenager who spoke English as his second language.[7]

Weaknesses of the Turing Test

The performance of Eugene Goostman exhibited some of the Turing Test's problems. Levesque identifies several major issues,[2] summarized as follows:[8]

Winograd schemas

The key factor in the WSC is the special format of its questions, which are derived from Winograd Schemas. Questions of this form may be tailored to require knowledge and commonsense reasoning in a variety of domains. They must also be carefully written not to betray their answers by selectional restrictions or statistical information about the words in the sentence.

Origin

The first cited example of a Winograd Schema (and the reason for their namesake) is due to Terry Winograd:[9]

The city councilmen refused the demonstrators a permit because they [feared/advocated] violence.

The choices of "feared" and "advocated" turn the schema into its two instances. The question is whether the pronoun "they" refers to the city councilmen or the demonstrators, and switching between the two instances of the schema changes the answer. The answer is immediate for a human reader, but proves difficult to emulate in machines. Levesque[2] argues that knowledge plays a central role in these problems: the answer to this schema has to do with our understanding of the typical relationships between and behavior of councilmen and demonstrators.

Since the original proposition of the Winograd Schema Challenge, Ernest Davis, a professor at New York University, has compiled a list of over 140 Winograd Schemas from various sources as examples of the kinds of questions that should appear on the Winograd Schema Challenge.[10]

Formal Description

A Winograd Schema Challenge question consists of three parts:

  1. A sentence or brief discourse that contains the following:
    • Two noun phrases of the same semantic class (male, female, inanimate, or group of objects/people),
    • An ambiguous pronoun that may refer to either of the above noun phrases, and
    • A special word and alternate word, such that if the special word is replaced with the alternate word, the natural resolution of the pronoun changes.
  2. A question asking the identity of the ambiguous pronoun, and
  3. Two answer choices corresponding to the noun phrases in question.

A machine will be given the problem in a standardized form which includes the answer choices, thus making it a binary decision problem.

Advantages

The Winograd Schema Challenge has the following purported advantages:

Pitfalls

One difficulty with the Winograd Schema Challenge is the development of the questions. They need to be carefully tailored to ensure that they require commonsense reasoning to solve. For example, Levesque[4] gives the following example of a so-called Winograd Schema that is "too easy":

 "The women stopped taking pills because they were [pregnant/carcinogenic]. Which individuals were [pregnant/carcinogenic]?"

The answer to this question can be determined on the basis of selectional restrictions: in any situation, pills do not get pregnant, women do; women cannot be carcinogenic, but pills can. Thus this answer could be derived without the use of reasoning, or any understanding of the sentences' meaning—all that is necessary is data on the selectional restrictions of pregnant and carcinogenic.

Events

An annual competition sponsored by Nuance Communications, Inc. will be organized, administered, and evaluated by CommonsenseReasoning.org. The winner will receive a grand prize of $25,000.[11]

The Twelfth International Symposium on the Logical Formalizations of Commonsense Reasoning was held on March 23–25, 2015 at the AAAI Spring Symposium Series at Stanford University, with a special focus on the Winograd Schema Challenge. The organizing committee included Leora Morgenstern (Leidos), Theodore Patkos (The Foundation for Research & Technology Hellas), and Robert Sloan (University of Illinois at Chicago).[12]

References

  1. ↑ Ackerman, Evan. "Can Winograd Schemas Replace Turing Test for Defining Human-level AI". IEEE Spectrum. Retrieved 29 October 2014.
  2. 1 2 3 Levesque, H. J. (2014). "On our best behaviour". Artificial Intelligence. 212: 27. doi:10.1016/j.artint.2014.03.007.
  3. ↑ "Nuance announces the Winograd Schemas Challenge to Advance Artificial Intelligence Innovation". Business Wire. Retrieved 9 November 2014.
  4. 1 2 3 Levesque, Hector; Davis, Ernest; Morgenstern, Leora. "The Winograd Schema Challenge". Retrieved 29 October 2014.
  5. ↑ Turing, Alan. "Computing Machinery and Intelligence" (PDF). JSTOR. Retrieved 28 October 2014.
  6. ↑ Ackerman, Evan (Oct 2014). "A Better Test Than Turing". IEEE Spectrum. 51 (10): 20–1. doi:10.1109/mspec.2014.6905475.
  7. ↑ Lewis, Tanya. "Brainy Machines Need An Updated IQ Test, Expert Say". Live science. Retrieved 28 October 2014.
  8. ↑ Michael, Julian (18 May 2015). The Theory of Correlation Formulas and Their Application to Discourse Coherence. UT Digital Repository. p. 6. Retrieved 6 July 2015.
  9. ↑ Winograd, Terry. "Understand Natural Language" (PDF). Science direct. Retrieved 4 November 2014.
  10. ↑ Davis, Ernest. "A Collection of Winograd Schemas". cs.nyu.edu. NYU. Retrieved 30 October 2014.
  11. ↑ "Winograd Schema Challenge". CommonsenseReasoning.org. Retrieved 1 January 2015.
  12. ↑ "AAAI 2015 Spring Symposia". Association for the Advancement of Artificial Intelligence. Retrieved 1 January 2015.

External links

This article is issued from Wikipedia - version of the 5/15/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.