Winograd schema challenge - Wikipedia

The Winograd schema challenge (WSC) is a test of machine intelligence proposed in 2012 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, 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] However, the prize is no longer offered. The challenge is

Winograd schema challenge - Wikipedia Jump to content From Wikipedia, the free encyclopedia Test of machine intelligence The Winograd schema challenge ( WSC ) is a test of machine intelligence proposed in 2012 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 Winograd schemas , questions of a very specific structure named after Terry Winograd , a professor of computer science at Stanford University . [ 1 ] On the surface, Winograd schema questions simply require the resolution of

related reading

• [2201.02387] The Defeat of the Winograd Schema Challengearxiv.org
• What Does It Mean for AI to Understand? | Quanta Magazinequantamagazine.org
• The Turing Test (Stanford Encyclopedia of Philosophy)plato.stanford.edu
• Gwern visits BAIR – Yuxi on the Wiredyuxi.ml
• the-illusion-of-thinking.pdfml-site.cdn-apple.com
• Group | Sherry Tongshuang Wucs.cmu.edu
• Terry Winograd - Wikipediaen.wikipedia.org
• Language Models can Solve Computer Tasksarxiv.org
• [2406.02061] Alice in Wonderland: Simple Tasks Showing Complete Reasoning Breakdown in State-Of-the-Art Large Language Modelsarxiv.org
• GitHub - inverse-scaling/prize: A prize for finding tasks that cause large language models to show inverse scaling · GitHubgithub.com
• ML Contestsmlcontests.com
• Parsed | Custom, interpretable AI systems that continuously learnparsed.com