Topics Beyond the imitation game Reading the web Turing test

Slides:



Advertisements
Similar presentations
Critical Reading Strategies: Overview of Research Process
Advertisements

Why are computers so stupid and what can be done about it? Artificial intelligence and commonsense knowledge.
LAST LECTURE. Functionalism Functionalism in philosophy of mind is the view that mental states should be identified with and differentiated in terms of.
1 If we modify the machine for the language from F12 p. 47 we can easily construct a machine for the language Observation Turing machine for the language.
Philosophy and Cogsci The Turing Test Joe Lau. Alan Turing ( ) n Famous British mathematician / logician n Mathematical theory of computation.
Sum it Up and Point the Way Forward Conclusions: Ending on a Strong Note.
Heidi Newton Peter Andreae Artificial Intelligence.
A Brief History of Artificial Intelligence
WHAT IS ARTIFICIAL INTELLIGENCE?
CS440/ECE448: Artificial Intelligence
Artificial Intelligence Austin Luczak, Katie Regin, John Trawinski.
Approaches to AI. Robotics Versus Artificial Intelligence.
Acting Humanly: The Turing test (1950) “Computing machinery and intelligence”:   Can machine’s think? or Can machines behave intelligently? An operational.
Classroom Assessment FOUN 3100 Fall Assessment is an integral part of teaching.
CIS 197 Computers in Society Professor John Peterson Philosophy Week!
Artificial Intelligence. Agenda StartEnd Introduction AI Future Recent Developments Turing Test Turing Test Evaluation.
Semantic Web Technologies Lecture # 2 Faculty of Computer Science, IBA.
Common Sense Computing MIT Media Lab Interaction Challenges for Agents with Common Sense Henry Lieberman MIT Media Lab Cambridge, Mass. USA
Essay Writing in Philosophy
Proofreading & Revising
Alan Turing In 1950 asked - Can Machines Think? Turing changed that into the Turing Test “Can Computers Understand Language?” would have been.
CIS 197 Computers in Society Professor John Peterson Philosophy Week!
Artificial Intelligence CIS 342 The College of Saint Rose David Goldschmidt, Ph.D.
Introduction to Artificial Intelligence Artificial Intelligence Section 4 Mr. Sciame.
The AI Challenge: Who are we? Images Copyright Twentieth Century Fox, Paramount, Sony;
Artificial Intelligence
Steps Toward an AGI Roadmap Włodek Duch ( Google: W. Duch) AGI, Memphis, 1-2 March 2007 Roadmaps: A Ten Year Roadmap to Machines with Common Sense (Push.
Philosophy 4610 Philosophy of Mind Week 9: AI in the Real World.
What is Artificial Intelligence? Abbas Mehrabian Teacher: Dr. M. Raei Sharif Saturday, 6 Esfand 1384.
Artificial Intelligence Bodies of animals are nothing more than complex machines - Rene Descartes.
Artificial Intelligence (AI) is the science known for making intelligent machines. In this context intelligence means the ability of machines to simulate.
1 CS 2710, ISSP 2610 Foundations of Artificial Intelligence introduction.
Close Reading Intermediate 2. Time The Close Reading exam paper lasts for one hour. (Date and time for 2011: Friday 13 May, 1.00pm to 2.00pm.) NAB: Friday.
The Turing Test Minds & Machines. Alan Turing British mathematician known for: –Turing Machines (1936) –Breaking German Enigma (WWII) –Turing Test (1950)
1 The main topics in AI Artificial intelligence can be considered under a number of headings: –Search (includes Game Playing). –Representing Knowledge.
Exploring Computer Science – Lesson 1-8
A Brief History of AI Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
The Turing Test ● Who was Alan Turing? ● Turings paper first claims that thinking is computable. Why is this so important? ● What is the imitation game?
By: Azka Josephine Abdul George TURING TEST PRESENTATION.
TURING TEST GROUP PRESENTATION REZA AHMADI ID: RAZZAK SIKDAR ID: EMEKA MOLOKWU ID: Timothy Lam ID: Yasien Siad ID:
Decision Support and Business Intelligence Systems (9 th Ed., Prentice Hall) Chapter 12: Artificial Intelligence and Expert Systems.
CS440/ECE448: Artificial Intelligence. Section Q course website:
CS440/ECE448: Artificial Intelligence
Reading and Writing to Succeed on the EAS (Educating All Students) Exam: Beating the Clock & Answering the Question A Student Workshop by Writing Across.
CS440/ECE448: Artificial Intelligence Lecture 1: What is AI?
Using Winograd Schemas for Evaluation of Implicit Information Extraction Systems Ivan Rygaev, Dialogue 2017 Laboratory of Computational Linguistics Institute.
What is a CAT? What is a CAT?.
Introduction to Corpus Linguistics
PSYCHOMETRIC TESTS.
HW: due Tuesday 10th Oct Take a revision booklet and write your name on the cover. Download the information slides from the VLE:
Intro to AI Ariel Rosenfeld.
EDU 385 Session 8 Writing Selection items
Philosophy Essay Writing
New Key Stage 3 Assessment
Course Instructor: knza ch
Artificial Intelligence introduction(2)
Artificial Intelligence (Lecture 1)
Style Sentence Variation and Passive Voice.
Scholastic Aptitude Test Developing Critical Reading Skills
The Turing Test Minds & Machines.
A User study on Conversational Software
Exploring Computer Science – Lesson 1-8
Can a monitoring tool pass the turning test
COMP3710 Artificial Intelligence Thompson Rivers University
Asking the Right Questions
The Winograd Schema Challenge Hector J. Levesque AAAI, 2011
Discrete Mathematics and Its Applications
Information Retrieval
9th Literature EOC Review
Presentation transcript:

Topics Beyond the imitation game Reading the web Turing test Winograd schema challenge Reading the web NELL

TURING Alan Turing is the father of both theoretical computer science and of AI He was the first to imagine machines able of intelligent behavior Devised an intelligence test, the TURING TEST: replace the question “Can a machine be endowed with intelligence” with the question: Can a machine display such human-like behavior to convince a human observer that it is a human being?

THE TURING TEST Alan M. Turing, “Computing Machinery and Intelligence”, 1950 (in Boden, Philosophy of AI) The question: what does it mean for a machine to be intelligent?

Turing Test

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]  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 event of Eugene Goostman exhibited some of the problems of the Turing Test. Levesque[2]identifies three major issues: Deception: The machine is forced to construct a false identity, which is not part of intelligence. Conversation: A lot of interaction may qualify as "legitimate conversation"—jokes, clever asides, points of order—without requiring intelligent reasoning. Evaluation: Humans make mistakes and judges often would disagree on the results.

DARTMOUTH In 1956 a group of researchers including J. McCarthy, M. Minsky, C. Shannon, N. Rochester organized a workshop at Dartmouth to study the possibility of developing machine intelligence

The Winograd Schema Challenge Hector Levesque Commonsense 2011 Winograd schema: A pair of sentences, differing in one or two words, with an ambiguity that is resolved oppositely.

Winograd Schema Challenge an alternative to the Turing Test that provides a more accurate measure of genuine machine intelligence Rather than base the test on the sort of short free-form conversation suggested by the Turing Test the Winograd Schema Challenge poses a set of multiple-choice questions that have a form where the answers are expected to be fairly obvious to a layperson, but ambiguous for a machine without human-like reasoning or intelligence.

COMMONSENSE KNOWLEDGE IN LANGUAGE UNDERSTANDING Winograd (1974): The city council refused the women a permit because they feared violence. The city council refused the women a permit because they advocated violence

The trophy would not fit in the brown suitcase because it was too big The trophy would not fit in the brown suitcase because it was too big. What was too big? The trophy would not fit in the brown suitcase because it was too small. What was too small?

Joan made sure to thank Susan for all the help she had given Joan made sure to thank Susan for all the help she had given. Who had given the help? Joan made sure to thank Susan for all the help she had received. Who had received the help?

Winograd Schema Challenge Collecting corpus of schemas that are effortlessly disambiguated by human readers sound natural. can’t be solved using selectional restrictions are not easily Googlable. Challenge for AI. Less far-reaching than the Turing Test, but less problematic.

Winograd Schema Challenge provides us with a tool for concretely measuring research progress in commonsense reasoning, an essential element of our intelligent systems. 

Advantages The Winograd Schema Challenge has the following purported advantages: Knowledge and commonsense reasoning are required to solve them. Winograd Schemas of varying difficulty may be designed, involving anything from simple cause-and-effect relationships to complex narratives of events. They may be constructed to test reasoning ability in specific domains (e.g., social/psychological or spatial reasoning). There is no need for human judges.[4]

Various ‘reference resolution’ levels in the Winograd Schema

Examples The Syntactic/Data Level The Semantic/Information Level This is the level at which only one of the two noun phrases is the correct referent and where simple syntactic data is enough to resolve the reference. Here are some typical examples:(6)   John  informed Mary  that he passed the exam.  (reference here can be easily resolved by gender data) The Semantic/Information Level semantic information (usually type information that might be available in a strongly-typed ontology) are enough to resolve the reference. Here is a typical example:(7) Our graduate students  published 20 papers  this year and, apparently, few of them also authored books