Chapter 18 Flashcards

1
Q

Threshold Models

A

Recognition memory depends on activation exceeding a threshold.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Two-Threshold Model

A

if activation is high → Recognized (“Yes”)

If activation is low → Rejected (“No”)

Some uncertainty exists between these states.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Generate-Recognize Model

A

A two-step recall model correcting for guessing.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Steps in the Generate-Recognize Model

A

Generate: Search memory for possible matches.

Recognize: Decide if a generated item is correct.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Recognition Failure

A

Sometimes an item can be recalled but not recognized due to different retrieval cues.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Recall vs. Recognition Cues

A

Recall: Uses external cues (e.g., a hint).

Recognition: Relies on the item itself.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Example of Recognition Failure

A

Forgetting a phone number when reading it but recalling it when dialling.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Multiple Trace Models (MINERVA 2)

A

Each memory trace is a set of numbers representing features (presence/absence).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Probe in MINERVA 2

A

A probe (e.g., “elephant”) activates similar traces, returning “echoes” with intensity and content.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Echoes in MINERVA 2

A

Echoes reflect memory strength and are a weighted average of active traces.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

MINERVA 2 and Schemas

A

Multiple echoes help narrow on specific traces and can also generate schemas.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Distributed Storage Models

A

Memories are stored across the same structure.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Examples of Distributed Storage Models

A

TODAM (Theory of Distributed Associative Memory)

CHARM (Composite Holographic Associative Retrieval Model)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Parallel Distributed Processing (PDP) Models

A

Memory is stored in networks of interconnected units, like neurons and axons.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Connectionist Networks in PDP

A

Learning occurs by shifting “weights” between interconnected units.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Dual-Process Models

A

Memory has two processes:

Familiarity (continuous strength)

Recollection (specific details, binary judgment)

17
Q

Familiarity vs. Recollection

A

Familiarity is faster, requiring less info (quantitative).

Recollection is effortful, conscious, and depends on specific details (qualitative).

18
Q

Brain Regions for Dual-Process Models

A

Familiarity: Temporal cortex

Recollection: Hippocampus & frontal lobes

19
Q

Remember-Know Judgment

A

Definition: A method to distinguish between:

“Remember” (specific details)

“Know” (general sense of familiarity)