Chapter 2: Computer models of language. Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 The ingredients By now we have encountered.

Slides:



Advertisements
Similar presentations
Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Advertisements

Chapter 4: Cognitive science and the integration challenge
Auto-Generation of Test Cases for Infinite States Reactive Systems Based on Symbolic Execution and Formula Rewriting Donghuo Chen School of Computer Science.
ARCHITECTURES FOR ARTIFICIAL INTELLIGENCE SYSTEMS
6-1 Chapter Goals Determine whether a problem is suitable for a computer solution Describe the computer problem-solving process and relate it to Polya’s.
Chapter 6: The physical symbol system hypothesis
Chapter 1: Information and Computation. Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Overview Review key ideas from last few.
A Brief History of Artificial Intelligence
WHAT IS ARTIFICIAL INTELLIGENCE?
Generation Miriam Butt January The Two Sides of Generation 1) Natural Language Generation (NLG) Systems which take information from some database.
Understanding Natural Language
Natural Language and Speech Processing Creation of computational models of the understanding and the generation of natural language. Different fields coming.
Class Discussion Chapter 2 Neural Networks. Top Down vs Bottom Up What are the differences between the approaches to AI in chapter one and chapter two?
References Kempen, Gerard & Harbusch, Karin (2002). Performance Grammar: A declarative definition. In: Nijholt, Anton, Theune, Mariët & Hondorp, Hendri.
Chapter 9 Compilers and Language Translation. The Compilation Process Phase I: Lexical analysis Phase I: Lexical analysis Phase II: Parsing Phase II:
Formal Aspects of Computer Science – Week 12 RECAP Lee McCluskey, room 2/07
Introduction & Overview CS4533 from Cooper & Torczon.
Models of Generative Grammar Smriti Singh. Generative Grammar  A Generative Grammar is a set of formal rules that can generate an infinite set of sentences.
1.3 Executing Programs. How is Computer Code Transformed into an Executable? Interpreters Compilers Hybrid systems.
Three Generative grammars
Chapter 2: Modeling mental imagery. Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 The ingredients Encountered some of the basic.
Lecture 1, 7/21/2005Natural Language Processing1 CS60057 Speech &Natural Language Processing Autumn 2005 Lecture 1 21 July 2005.
Intelligence & Artificial Intelligence You must have a pre-prepared sentence or two to spout about what is a description of intelligence.. And what is.
Grammars.
Artificial Intelligence Dr. Paul Wagner Department of Computer Science University of Wisconsin – Eau Claire.
CSCI 4410 Introduction to Artificial Intelligence.
Chapter 6: Objections to the Physical Symbol System Hypothesis.
Artificial Intelligence: Definition “... the branch of computer science that is concerned with the automation of intelligent behavior.” (Luger, 2009) “The.
Lecture 12: 22/6/1435 Natural language processing Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
INTRODUCTION TO COMPUTING CHAPTER NO. 06. Compilers and Language Translation Introduction The Compilation Process Phase 1 – Lexical Analysis Phase 2 –
Chapter 6: Applying the PSSH. Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Overview Explain why ID3 and SHAKEY both count.
Chapter 4: Global responses to the integration challenge.
Chapter 10: Compilers and Language Translation Invitation to Computer Science, Java Version, Third Edition.
Artificial Intelligence Introductory Lecture Jennifer J. Burg Department of Mathematics and Computer Science.
Artificial Intelligence
Natural Language Processing Introduction. 2 Natural Language Processing We’re going to study what goes into getting computers to perform useful and interesting.
LDK R Logics for Data and Knowledge Representation Modeling First version by Alessandro Agostini and Fausto Giunchiglia Second version by Fausto Giunchiglia.
Natural Language Processing Rogelio Dávila Pérez Profesor – Investigador
The Recursion Theorem Pages 217– ADVANCED TOPICS IN C O M P U T A B I L I T Y THEORY.
SYNTAX Lecture -1 SMRITI SINGH.
Cognitive Psychology: Thinking, Intelligence, and Language
Understanding Natural Language
Postgraduate Diploma in Translation Lecture 1 Computers and Language.
A Procedural Model of Language Understanding Terry Winograd in Schank and Colby, eds., Computer Models of Thought and Language, Freeman, 1973 발표자 : 소길자.
An Intelligent Analyzer and Understander of English Yorick Wilks 1975, ACM.
Introduction to CL & NLP CMSC April 1, 2003.
Problem Solving Techniques. Compiler n Is a computer program whose purpose is to take a description of a desired program coded in a programming language.
Research Topics CSC Parallel Computing & Compilers CSC 3990.
October 2005CSA3180 NLP1 CSA3180 Natural Language Processing Introduction and Course Overview.
CSA2050 Introduction to Computational Linguistics Lecture 1 What is Computational Linguistics?
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
1 Compiler Design (40-414)  Main Text Book: Compilers: Principles, Techniques & Tools, 2 nd ed., Aho, Lam, Sethi, and Ullman, 2007  Evaluation:  Midterm.
Artificial Intelligence: Natural Language
Artificial Intelligence, Expert Systems, and Neural Networks Group 10 Cameron Kinard Leaundre Zeno Heath Carley Megan Wiedmaier.
Course Overview  What is AI?  What are the Major Challenges?  What are the Main Techniques?  Where are we failing, and why?  Step back and look at.
NATURAL LANGUAGE PROCESSING
Formal grammars A formal grammar is a system for defining the syntax of a language by specifying sequences of symbols or sentences that are considered.
Advanced Computer Systems
Artificial intelligence (AI)
Chapter Eight Syntax.
Natural Language Understanding
Course Instructor: knza ch
Chapter Eight Syntax.
Natural Language - General
UNIT 3 CHAPTER 1 LESSON 4 Using Simple Commands.
Natural Language Understanding
Chapter 10: Compilers and Language Translation
Lecture One: Automata Theory Amjad Ali
Artificial Intelligence 2004 Speech & Natural Language Processing
Information Retrieval
Presentation transcript:

Chapter 2: Computer models of language

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 The ingredients By now we have encountered some of the basic ideas feeding into cognitive science move away from associationist models of learning and behavior information theory as a tool for exploring the nature and limits of cognitive abilities development of “boxological” accounts of how cognitive tasks can be performed theory of computation as a model for information-processing

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Putting them together: 3 case studies Terry Winograd and SHRDLU[TODAY] The imagery debate[MONDAY] Marr’s theory of vision[WEDNESDAY]

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Background to SHRDLU Idea of language as: hierarchically organized planned rule-governed Computational approach to information-processing

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Connections Direct analogy between formal languages and natural languages + Hierarchical organization Recursion PlansPrograms RulesAlgorithms

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Recursion Basic idea in logic and computer science recursive definition recursive procedures Recursion is a tool for understanding the relation between complex structures and the simple elements from which they are composed

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Recursive definition of wffs Well-formed formula in propositional logic: contains infinitely many propositional symbols P 0, P 1,..., together with connectives ‘  ’, ‘  ’, ‘  ’, and ‘  ’ For all i, ‘P i ’ is a wff If ‘Q’ is a wff, then ‘  Q’ is a wff If ‘Q’ and ‘R’ are wffs, then ‘Q  R’ is a wff Etc Etc Generates an algorithmic procedure for checking whether a given formula is a wff

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Recursion in natural language –The mouse the cat bit ran away –The mouse the cat the dog chased bit ran away –The mouse the cat the dog the man frightened chased bit ran away Exploit the recursive rule allowing center-embedding Problematic for associationist models – because agreement between nouns and verbs depends upon what comes later in the sentence

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Natural language processing Branch of AI tackling the challenge of building a machine that can speak and understand natural languages Engineering dimension – computers that can use language to interact with people CogSci dimension – understand the computational basis of human linguistic abilities

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Early examples Chatterbots (e.g. ELIZA) typically use canned reponses to simulate conversation Machine translation wave of enthusiasm in the 1950’s fundamental problems with ambiguity tried to deal with them using statistical semantics ("a word is characterized by the company it keeps”)

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Winograd’s SHRDLU Narrowed down the computational challenge by restricting communication to a micro-world Interaction with the micro-world introduced a semantic dimension – allowed the application of language to the world Built on a procedural model of information-processing Constructed according to basic boxological principles (with a twist)

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Micro-worlds Microworlds are artificial domains where all the possible objects, properties and events are defined in advance Many (all?) of the successes in AI have taken place in microworlds (chess, data-mining, logistics planning, credit card fraud detection...) Microworlds narrow down the task domain – But they also make the program more general

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 SHRDLU’s (virtual) microworld

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 What SHRDLU can do 1)Answer questions about the block-world 2)Resolve ambiguities 3)Carry out instructions via a (simulated) robot hand 4)Develop plans for carrying out complex instructions 5) Incorporate new words into its vocabulary

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Limitations 1)Purely reactive – has no goals except those introduced in the “conversation” 2)No sensitivity to the pragmatics of the conversation 3)Only capable of questions and declarative sentences 4)No need for context-sensitivity 5)Highly simplified grammar and vocabulary

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Haugeland on SHRDLU SHRDLU performs so glibly only because his domain has been stripped of anything that could ever require genuine wit or understanding. Neglecting the tangled intricacies of everyday life while pursuing a theory of common sense is not like ignoring friction while pursuing the laws of motion; its like throwing the baby out with the bathwater. A round frictionless wheel is a good approximation of a real wheel because the deviations are comparatively small and theoretically localized: the blocks-world “approximates” a playroom more as a paper plane approximates a duck. (Artificial Intelligence: The Very Idea p. 190)

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Is Haugeland being unfair? SHRDLU isn’t part of a theory of common sense - nor is it intended as a complete model of natural language understanding SHRDLU shows how far we can get in modeling language understanding using certain basic tools (quasi-)hierarchical architecture procedural/algorithmic semantics

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 (Quasi-)hierarchical architecture SHRDLU is heterarchically organized composed of 12 separate sub-systems each sub-system has a specific task to perform But there is no overall “controller” & the sub-systems do not work in sequence  cross-talk allows sub-systems to recruit outputs of other sub-systems Sub-systems are made up of sets of procedures (algorithmic routines for solving specific problems)

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Overall architecture Group 1 sub-systemsSyntactic analysis Group 2 sub-systemsSemantic analysis Group 3 sub-systemsIntegrating and using information/planning responses to commands

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 The SENTENCE routine algorithmic calls upon other procedures not independent of semantics

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Syntax and semantics Separation of syntax and semantics is a basic principle of much theoretical linguistics and cognitive science Chomskyan generative grammar is a purely syntactic theory Cognitive scientists often assume that there is a dedicated “syntactic parsing system” But Winograd’s heterarchical approach rejects the separation

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 “Put the blue pyramid on the block in the box” Ambiguous: Is the blue pyramid already on the block? Is the block already in the box? This ambiguity cannot be resolved purely syntactically In fact, the syntactic sentence parser cannot run until the ambiguity is resolved But the semantic analysis also requires syntactic input

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Stages in parsing sentence 1)The parser produces “the blue pyramid on the block” as candidate NP  calls semantic analysis procedure 2)SHRDLU checks whether there is a block with a blue pyramid on it. 3)There isn’t. So SHRDLU backtracks to the parser, which suggests “the blue pyramid” 4)This works. So SHRDLU takes “the block in the box” as the object of the imperative “put” 5)Calls semantic analysis procedure to check that there is a block in the box

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Take-home messages SHRDLU avoids many of the problems of “real-life” language comprehension (due to the way the block-world is built up) But it shows what can be done with quasi-hierarchically organized and algorithmic routines Illustrates how we can understand a complex cognitive ability as the product of a set of computational processes