Semantic Memory Psychology 3717 Introduction l l l

  • Slides: 18
Download presentation
Semantic Memory Psychology 3717

Semantic Memory Psychology 3717

Introduction l l l This is our memory for facts about the world How

Introduction l l l This is our memory for facts about the world How do we know that the capital of Viet Nam is Hanoi How is this type of information stored? Is there any difference between ‘natural’ and ‘logical’ concepts? How the heck could we figure this out?

TLC No, not that lame TV channel ful of trading spaces and makeovers…. l

TLC No, not that lame TV channel ful of trading spaces and makeovers…. l The Teachable Language Comprehender l Hierarchical associative network of concepts that began as a computer simulation l

bacground Quinlan and his colleagues tried to make a computer program that would simulate

bacground Quinlan and his colleagues tried to make a computer program that would simulate how a person learns language l Realized that concepts, not words, were the building blocks of knowledge l Example ‘the policeman held up his hand the cars stopped (Collins & Quinlan, 1973) l

You know exactly what that phrase entails l Cop is directing traffic l People

You know exactly what that phrase entails l Cop is directing traffic l People push pedals etc l Tacit knowledge if you will l Three types of elements of semantic memory l

The three elements Units, properties and pointers l Unit is a thing (the cop,

The three elements Units, properties and pointers l Unit is a thing (the cop, his hand, the car etc) l Properties are conceptual (raising the hand that sort of thing) l Pointers denote specific associations l

So where does this get us? Semantic memory then is a HUGE hierarchical network

So where does this get us? Semantic memory then is a HUGE hierarchical network of relationships between elements l Is statements then are relationships between a superordinate element and a subordinate l A bird is a fish will not produce a yes l A fish is an animal and a bird is an animal will l

Collins and Quinlan (1969) A _____ is a ______ statements l Sentence verification l

Collins and Quinlan (1969) A _____ is a ______ statements l Sentence verification l RT longer when number of associative links was greater l Less relevant property relationships, longer RT l l (a canary is yellow is longer than a canary can breather)

However… Ok, by this theory, the satement ‘a bear is a mammal’ should be

However… Ok, by this theory, the satement ‘a bear is a mammal’ should be quicker than ‘a bear is an animal’ l Ummm, no…. l So the ‘semantic distance effect’ does not show up here l

More buts Does not deal with the typicality effect at all l Does not

More buts Does not deal with the typicality effect at all l Does not explain why ‘a robin is a shark’ is more quickly rejected than ‘a robin is a salmon’ l Conrad (1972) said that it is the typicality of the statement itself that is the issue l

Feature set theory Smith, Shoben and Rips (1974) l Concepts stored as sets of

Feature set theory Smith, Shoben and Rips (1974) l Concepts stored as sets of attributes l RT then depends on comparing features of exemplar with stored concept l Predicts the symbolic distance effect (very similar items take long RTs l Predicts the category size effect (concept to superordinate) l

But…. You knew there would be a but l What are the defining features

But…. You knew there would be a but l What are the defining features of a concept l What is a dog for example l Your idea is different than mine l But we gt the same effects with subjects l

Spreading activation Collins and Loftus (1975) l Network like TLC l NOT as rigidly

Spreading activation Collins and Loftus (1975) l Network like TLC l NOT as rigidly hierarchical l Still have units and properties, but not so hierarchical l Distance is important l

But. . This one sounds better but there is a but l Distantly related

But. . This one sounds better but there is a but l Distantly related concepts should give longer RTs l But ‘a canary is a shark’ takes like no time l

Propositional network theory Anderson (1983) l ACT and ACT* l For example ‘Kurt’s mother

Propositional network theory Anderson (1983) l ACT and ACT* l For example ‘Kurt’s mother sent him a package last week’ l Three propositions l More propositions, sentences take longer, even with fewer words l

Neural network models l l l l Units or nodes that are like neurons,

Neural network models l l l l Units or nodes that are like neurons, on and off But, units have a threshold and once acticavted past this threshold you get ‘firing’ Units are connected either excitatorily or inhibtorily There activation rules Output rules, how a unit sends info to next unit Learning rules Groups of units or modules, are devoted to specific cognitive functions

properties Content addressable memory l Network makes guesses l Network makes spontaneous generalizations l

properties Content addressable memory l Network makes guesses l Network makes spontaneous generalizations l

conclusions I don’t want to get too bogged down in this but, I think

conclusions I don’t want to get too bogged down in this but, I think that we can make a few statements l All theories are about connections l Probably NOT hierarchical, completely l Activation probably spreads l This stuff can get way hard…. l