Professional Documents
Culture Documents
1 Naming Experiments 3
1.1 Experiment 1a . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.1.1 Method . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.1.2 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
1.1.3 Discussion . . . . . . . . . . . . . . . . . . . . . . . . . 10
1.2 Experiment 1b . . . . . . . . . . . . . . . . . . . . . . . . . . 10
1.2.1 Method . . . . . . . . . . . . . . . . . . . . . . . . . . 10
1.2.2 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
1.2.3 Discussion . . . . . . . . . . . . . . . . . . . . . . . . . 12
2 Models 13
2.1 Predictions by the models . . . . . . . . . . . . . . . . . . . . 14
2.1.1 The preview model . . . . . . . . . . . . . . . . . . . . 21
2.1.2 The priming model . . . . . . . . . . . . . . . . . . . . 28
2.1.3 Predictions: Preview model . . . . . . . . . . . . . . . 29
2.1.4 Predictions: Priming Model . . . . . . . . . . . . . . . 34
2.1.5 Partial preview . . . . . . . . . . . . . . . . . . . . . . 37
A Derivations 42
A.1 PDF of a race between two processes . . . . . . . . . . . . . . 42
A.2 Probability of a process to win the race . . . . . . . . . . . . . 43
A.3 Loops within a state . . . . . . . . . . . . . . . . . . . . . . . 44
A.4 Expected value of the convolution of two geometric distributions 45
1
CONTENTS 2
B Tables 46
B.1 Experiment Materials . . . . . . . . . . . . . . . . . . . . . . . 46
C Figures 51
C.1 Number of refixations . . . . . . . . . . . . . . . . . . . . . . . 51
Chapter 1
Naming Experiments
1.1 Experiment 1a
1.1.1 Method
Participants
Materials
On each trial, participants were presented with two line drawings of objects,
which they named in a noun phrase coordination, like ’De stoel en de hark’.
The names of the objects were either high frequent, or low frequent, where
frequencies were determined by using the CELEX database. Twelve drawings
of objects with high frequent names and twelve with low frequent names were
used. The names of the objects are listed in Appendix A. From the two sets
of objects twenty-four object pairs were created, so that the frequency of
the object name was orthogonally varried. There were six pairs in which the
first object name was high frequent and the second object name low frequent.
3
CHAPTER 1. NAMING EXPERIMENTS 4
The other object pairs included six high-high frequent combinations, six low-
high, and six low-low combinations. Object names within pairs were not
phonologically neither semantically related. The object pairs are listed in
Appendix A, together with the six practice picture names.
Design
Each pair was presented eight times during the experiment, where each sec-
ond time a pair was presented its order of presentation was reversed. That
is, if first ’tree and house’ was presented, the second time ’house and tree’
was shown to the participant. Table 1.1 shows how the order of presentation
of objects was varried over participants.
The participants were presented with 8 times 24 equals 192 test trials to
which some practice trials at the beginning of each block were added. After
each two blocks there was a short break, which could be used to adjust the
eye tracker settings.
The presentation order of pairs within each pair of blocks was random-
ized accross participants, where the restriction was used that no picture was
allowed to appear in two succesive trials.
CHAPTER 1. NAMING EXPERIMENTS 5
Apparatus
Procedure
The participants were tested individually. They were seated in a quiet room
approximately 65 cm in front of a monitor. They first received a booklet
including drawings of the practice and experimental objects. The names of
the objects were printed next to them. In a written instruction that the par-
ticipants received together with the picture booklet, they were told that they
would later see pairs of objects which they should name, from left to right in
a utterance like ’stoel en boek’ (’chair and book’). The instructions included
a picture of an object pair and an example of the expected description.
After the participants had read the instruction and studied the picture
booklet, the head band of the eye-tracking system was mounted and the sys-
tem was calibrated. For the calibration, a grid of three by three positions had
been identified. During a calibration trial a fixation target appeared once,
in random order, on each of these positions for one second. The participants
were asked to fixate upon each target until the next target appeared. After
CHAPTER 1. NAMING EXPERIMENTS 6
Data Analysis
For the off-line analyses of the eye movements, graphical software was used
that displayed for each trial the locations of the speaker’s fixations as dots
superimposed upon the line drawing. The first step in the analyses was to
classify the fixations as falling on the left or right object or elsewhere. A
CHAPTER 1. NAMING EXPERIMENTS 7
1.1.2 Results
Trials in which the participant named one of the objects incorrectly, hesi-
tated, and trials in which the voice key was triggered incorrectly were re-
moved from the data analysis. Also the practice trials are left out from the
analysis.
The pattern in the speech onset latencies is illustrated in Figure 1.1 in which
a interaction plot of the mean reaction time is shown. The same kind of plot
for percentage correct is shown in Figure 1.2. It can be seen that the data
pattern is similar for both dependent variables, which is evidence against a
speed-accuracy-trade-off.
The interaction effect is highly significant (F1 (1, 13) = 57.80, p < 0.001; F2 (1, 22) =
31.69, p < 0.001). The simple effect of context within high frequency of the
first object is significant both for participants and items (t1 (13) = 2.90, p =
0.012; t2 (11) = 2.54, p = 0.027), as is the effect of context within low fre-
quency (t1 (13) = −6.37, p < 0.001; t2 (11) = −5.09, p < 0.001). The only
CHAPTER 1. NAMING EXPERIMENTS 8
780
760
740
Mean speech onset latency
720
700
Frequency 1st object
High
680 Low
High Low
Figure 1.1: Mean speech onset latencies for each of the conditions.
.98
.97
.96
.95
Mean proportion correct
.94
Frequency object 1
High
.93 Low
High Low
Frequency object 2
simple effect that is not significant is the effect of first object frequency within
a high frequency context (t1 (13) = −1.36, p = 0.198; t2 (22) = −0.61, p =
0.548). There is a significant effect of first object frequency within low fre-
quency context (t1 (13) = −6.48, p < 0.001; t2 (22) = −4.35, p < 0.001).
CHAPTER 1. NAMING EXPERIMENTS 9
Viewing times
460
450
440
430
Mean viewing time
420
Frequency 1st object
High
410 Low
High Low
As can be seen from the interaction plot, the pattern in the viewing
times data ressembles the speech onset data. There is an interaction effect
of frequency of the two objects, which is significant (F1 (1, 12) = 18.88, p =
0.001; F2 (1, 22) = 10.64, p = 0.004). Now only two simple effects are signif-
CHAPTER 1. NAMING EXPERIMENTS 10
icant, namely the effect of first object name frequency within low frequency
of the second object (t1 (12) = −3.13, p = 0.009; t2 (22) = −2.97, p = 0.007),
and the effect of second object frequency within high frequent first object
names (t1 (12) = 2.53, p = 0.026; t2 (11) = 3.25, p = 0.008). All the t-values
corresponding to the other simple effects tests are smaller than 1.5.
1.1.3 Discussion
A clear interaction effect of the frequencies of object names is found when
two objects presented together on a computer screen have to be named.
This effect also shows up in the viewing times of the first object, which
is additional evidence for the hypothesis that viewing times are related to
retrieval durations of words from the mental lexicon.
1.2 Experiment 1b
To be sure that the interaction effect is not the result of the particular pairs
of objects used in the experiment, a control experiment is run, in which the
same objects are used, but different pairs of objects are formed.
1.2.1 Method
Participants
Sixteen participants from the Max Planck Participants pool took part in the
experiment. None of the participants took part in Experiment 1a.
Materials, design, apparatus, procedure, and data analysis are the same as
in Experiment 1a, except for the pairs of objects that were used. Twelve new
pairs were formed from the twenty-four objects in the experiment, that did
not have semantically or phonologically related object names, and were not
used in Expeirment 1a. The pairs are presented in Appendix A.
CHAPTER 1. NAMING EXPERIMENTS 11
1.2.2 Results
Speech onset latencies
Trials in which an error occured are removed from the data analysis. Mean
speech onset latencies are shown in Figure 1.4.
840
830
820
810
800
Mean speech onset latency
790
780
760 Low
High Low
Figure 1.4: Mean speech onset latencies for each of the conditions.
Again the interaction effect is significant (F1 (1, 15) = 14.48, p = 0.002; F2 (1, 22) =
7.26, p = 0.013). Three simple effects are significant in the participant anal-
ysis and almost significant in the item analysis: The effect of right object
name frequency within high frequent left object names (t1 (15) = 2.67, p =
0.017; t2 (11) = 2.11, p = 0.058), the effect of right object name frequency
within low frequent left object names (t1 (15) = −3.30, p = 0.005; t2 (11) =
2.11, p = 0.09), and the effect of first object name frequency within low fre-
quent right objects (t1 (15) = −4.98, p < 0.001; t2 (11) = −3.28, p = 0.003).
The effect of first object name frequency within high frequent second object
names was not significant (t1 (15) = −1.66, p > 0.1; t2 (11) =< 1).
Viewing times
500
490
480
470
460
Mean viewing time
High
440 Low
High Low
1.2.3 Discussion
So the effect found in Experiment 1a is replicated in Experiment 1b from
which it can be concluded that the interaction effect is a quite stable effect.
Two possible explanations of the effect will be further investigated in the
forthcoming chapter in which it is discussed how to model these explanations.
The first explanation is the preview theory: because the second picture is
already perceived and processed while fixating the first object, processing
the second picture takes less time when fixating the second picture. The
second explanation is the priming theory: if the second picture is congruent
in frequency with the first picture, the second picture will be processed faster
while it is fixated. How to make these assumptions explicit is explained in
the following chapter.
Chapter 2
In the experiment the task of the participants was to name two objects
presented as line-drawings on a computer screen in a clause like ’de fiets
en het bot’ (’the bike and the bone’). The frequency of each object name
was either high or low, according to the celex database. The frequencies of
names within a pair could either be congruent (’high-high’ or ’low-low’) or
congruent (’high-low’ or ’low-high’). As described in the results section the
congruent frequency pairs were named faster than the incongruent frequency
pairs. Also viewing times of the first object for the congruent pairs were
shorter than for incongruent pairs.
Two models are proposed to explain the congruency effects. The first
model, which is named the preview model, illustrated in Figure 2.1. In this
model it is assumed that the second picture is processed too when the first
picture is fixated. The parafoveal processing, however, is slower than pro-
cessing during picture fixation. To explain the congruency effect it must be
assumed that parafoveal processing is more efficient in congruent conditions
than in uncongruent ones. Additionally, it can be assumed that the sec-
ond picture influences the processing of the first, during fixation of the first
object.
13
CHAPTER 2. MODELS 14
F: final state.
I: initial state.
m1: programming eye movement to object 1
F 5
m2: programming eye movement to object 2
1
1
m1 I
m1, l1, a*l2
S1
1: m1 is cancelled
2: m2 is cancelled
3: m2b is cancelled
F: final state.
I: initial state.
m1: programming eye movement to object 1
F 4
m2: programming eye movement to object 2
1
1
m1 m1, l1 I
S1
1: m1 is cancelled
2: m2b is cancelled
P (occurence) = λ · exp(−λ t)
CHAPTER 2. MODELS 16
1.4
1.2
Probability of an event
0.8
0.6
0.4
0.2
0
0 0.5 1 1.5 2 2.5 3 3.5 4
Time
λn · tn−1 exp(−λ t)
P (end of process) =
(n − 1)!
where λ denotes the rate of the processes that make up the gamma distribu-
tion, and n is the number of exponential components.
Why the gamma distribution is usefull, is illustrated by Figures 2.5 and
2.6 where histograms of response times from Experiment 1b are plotted for
two participants. Participant 1 shows an outlier at about 200 ms, where par-
ticipant has an outlier 13 at 1300 ms. Besides these outliers, the histograms
CHAPTER 2. MODELS 17
0.18
lambda=0.6
lambda=1.2
0.16 lambda=1.8
0.14
0.12
Probability of an event
0.1
0.08
0.06
0.04
0.02
0
0 0.5 1 1.5 2 2.5 3 3.5 4
Time
n
mean =
λ
n
variance =
λ2
1
Therefore the parameters of the gamma can be estimated by filling in the
1
The parameter estimation method in which moments of the distribution (as the mean
and the variance) are used is known as ’the method of moments’. There are methods (like
’maximum-likelihood’ that yield ’better’ estimations.
CHAPTER 2. MODELS 18
40
30
20
10
Response time
20
10
Response time
If the gamma distribution is used, then it is also assumed that all sub-
stages are equally fast. If durations of substages differ, the resulting distri-
bution will be general gamma, also called the Erlang distribution (see McGill
& Gibbon, 1965).
A usefull property of the exponential distribution, concerning the mod-
elling of race-models, is that the distribution of the minimum of two expo-
nential distributions (say, with rates λ1 , and λ2 ) equals:
CHAPTER 2. MODELS 20
Proces B
0 sec. # # # 1 sec.
Proces A en B samen
0 sec. 1 sec.
The first horizontal line of the figure represents process 1. Each time process
1 ends a * sign is printed. In the second line, each time process 2 finishes a
# is shown. The third line presents the times at which either process 1 or
process 2 ends. The rate at which one of both processes end equals the sum
of the rate of process 1 and the rate of process 2.
Another result that is needed to derive expected durations for the two
models is the following one:
λa
P (”A wins the race”) =
λa + λb
and therefore,
λb
P (”B wins the race”) =
λa + λb
The derivation of these equations is shown in Appendix A.
CHAPTER 2. MODELS 21
where E(T ) is the total expected time until reaching state five, Pij is the
probability of going from state i to j, Ei is the expected time spend in state
i, and Eij is the expected time needed to reach state j from state i.
Some of the values of this equation can now be filled in:
1 λl1 a λl2
E(T15 ) = + E(T25 ) + E(T35 )
λl1 + a λl2 λl1 + a λl2 λl1 + a λl2
The motor programming process is not taken into account in the compu-
tation of the expected duration of the stay in state one. The decision to leave
the motor programming time out of the equation is based on a derivation
presented in Appendix A3.
Expressions for E(T25 ) and E(T35 ) can be derived in a similar way:
1
E(T35 ) = E(T3 ) =
λl1
1
E(T45 ) = E(T4 ) =
λl2
Filling in these expressions into the expression of E(T ) gives:
!
1 λl1 1 λm2 1
E(T ) = + + +
λl1 + a λl2 λl1 + a λl2 λm2 + a λl2 λm2 + a λl2 λl2
a λl2 1
λl1 + a λl2 λl1
CHAPTER 2. MODELS 22
This means that E(T ) is a function of λl1 , λl2 , a, and λm2 . How E(T )
depends on each of the variables is illustrated in Figure 2.8. In the plot the
1
parameters that are not varied are fixed at the following values: λl1 = 400
,
1 1
λl2 = 300
, a = 0.3, and λm1 = 200
. The longer the retrieval of each of the
object names takes, the longer the speech onset latency will be. If parafoveal
processing is better (a is higher), speech onset will be faster. If the saccade
planning process takes more time, parafoveal processing will continue longer
and speech onset will be slower.
700 1100
1000
680
900
E(T)
E(T)
660
800
640
700
620 600
300 350 400 450 500 300 350 400 450 500
1/l1 1/l2
680 700
660 680
640
660
E(T)
E(T)
620
640
600
580 620
560 600
0.2 0.4 0.6 100 200 300 400
a m2
It can be assumed that λl1 , and λl2 are a function of frequency of the
object name. a is a number that must be smaller than 1 if parafoveal pro-
cessing is slower than foveal processing. λm2 is the time needed to plan an
eye movement to the second object.
From the model also the time until an eye movement is made to the
CHAPTER 2. MODELS 23
second object can be predicted. There is only one path in the diagram that
leads to an eye movement to the second object. Since participants look often
to the second object when naming both pictures, the probabilities of taking
one of the other paths must not be very big. The time needed to go from
state 1 to state 4 equals:
1 1
E(T14 |path 1, 2, 4 is taken) = +
λl1 + a · λl2 λm2
This means that the time until an eye movement to the second object
must be smaller than the time until speech onset. In cases in which this is
not the case, the second object was probably already processed parafoveally
and eye movements to the first object are continued. If viewing times happen
to be very often longer than speech onset latencies, this is an indication of
the model being incorrect. The viewing time depends on the parameters λl1 ,
λl2 , λm2 , and a. How the viewing time depends on each of the parameters is
illustrated in Figure 2.9. The dependencies are similar to those for speech on-
set latency, which is in agreement with observations in previous experiments
in which viewing times were measured together with speech onset latencies.
Another prediction that can be derived from the model is the expected
number of times that participants do not move their eyes to the second object.
That is the number of times the path via states 2 and 4 is not taken. This
probability equals:
540 510
520 500
500 490
E(T)
E(T)
480 480
460 470
440 460
420 450
300 350 400 450 500 200 250 300 350 400
1/l1 1/l2
560 600
540 550
520
500
E(T)
E(T)
500
450
480
460 400
440 350
0 0.2 0.4 0.6 100 150 200 250 300
a 1/m2
0.46 0.45
0.44
0.4
P(no saccade)
P(no saccade
0.42
0.4 0.35
0.38
0.3
0.36
0.34 0.25
300 350 400 450 500 300 350 400 450 500
1/l1 1/l2
0.7 0.5
0.6
P(no saccade)
P(no saccade)
0.45
0.5
0.4
0.4
0.3 0.35
0.2 0.4 0.6 100 200 300 400
a m2
!N !
λm1 λl1 + a · λl2
P (N refixations) = ·
λm1 + λl1 + a · λl2 λm1 + λl1 + a · λl2
f (N) = (1 − p)N · p
1−p
E(N) =
p
which implies that the expected number of refixations from the path via
states 1 and 2 equals:
CHAPTER 2. MODELS 26
λl1 + a · λl2
E(N) =
λm1
In the path via states 1 and 3, two states contribute to the number of
refixations, which leads to a convolution of two geometric distributions for
the PDF of the number of refixations there.
The PDF there is of the form:
N
(1 − p1 )t · (1 − p2 )(N −t)
X
P (N) = p1 · p2
t=0
where:
λm1
p1 =
λm1 + λl1 + a · λl2
λm1
p2 =
λm1 + λl1
What the geometric disribution and the convolution of two geometric
distributions look like is illustrated in Figure 2.11. The geometric distribution
is sometimes called the discrete version of the exponential distribution.
The expected number of refixations resulting from state 3, can be com-
puted using the expression derived in Appendix A4.
q1 + q2 − 2 q1 q2
E(Nstate 3 ) =
p1 p2
where
λm1
p1 = 1 − q1 =
λm1 + λl1 + a · λl2
λm1
p2 = 1 − q2 =
λm1 + λl1
Therefore, the total expected number of refixations equals:
λl1 1 − p1 a · λl2 q1 + q2 − 2 q1 q2
E(N) = · + ·
λl1 + a · λl2 p1 λl1 + a · λl2 p1 p2
CHAPTER 2. MODELS 27
p=0.3
0.3
0.2
P(N)
0.1
0
0 1 2 3 4 5 6 7 8 9 10
conv(p1=0.3, p2=0.5)
0.2
P(N)
0.1
0
0 1 2 3 4 5 6 7 8 9 10
The same recoding is used for the lemma retrieval rate of the second
object, λl2 .
CHAPTER 2. MODELS 28
1 1 1
E(T ) = + +
λl1 λm2 p · λl2
where λl1 and λl2 are the rates at which the two lemma’s are retrieved. Again
the predicted viewing time is shorter than the speech onset latency:
1 1
E(V T ) = +
λl1 λm1
This means that the priming parameter does not influence the viewing
time of the first object. However, the pattern in the viewing time data
suggest also priming effects. This presents at least some evidence against the
priming model.
The probability of making a saccade to the second object equals 1, where
the expected number of refixations equals:
! !
λm1 λm1 + λl1 λm1
E(N) = · =
λl1 + λm1 λl1 λl1
This means that the faster lemma retrieval is, the smaller the number of
refixations, and the faster motor programma to the first object, the larger
the expected number of refixations.
In Figures 2.12 to 2.14 an illustration is given of how the dependent
variables depend on each of the independent variables. The speech onset
time depends on each of the parameters. It increases with the lemma retrieval
times and motor planning time and decreases with the amount of priming.
Except for the exact shape of the functions this relationship between the
parameters and the speech onset latency is the same for both models. This
is not the case for the predictions of the viewing time. The priming model
predicts that the viewing time does not depend on the amount of priming and
CHAPTER 2. MODELS 29
the lexical retrieval time of the second object. Also the number of refixations
does not depend on properties of the second object and amount of priming,
where in the preview model all parameters have an effect.
950 1000
900
950
850
E(T)
E(T)
900
800
850
750
700 800
300 350 400 450 500 300 350 400 450 500
1/l1 1/l2
940 1050
920 1000
900 950
880 900
E(T)
E(T)
860 850
840 800
820 750
800 700
0.8 1 1.2 1.4 100 200 300 400
p 1/m2
Figure 2.12: Speech onset latency predicted by the priming model as function
of the parameters.
700 601
650 600.5
E(VT)
E(VT)
600 600
550 599.5
500 599
300 350 400 450 500 300 350 400 450 500
1/l1 1/l2
601 800
750
600.5
700
E(VT)
E(VT)
600 650
600
599.5
550
599 500
0.8 1 1.2 1.4 100 200 300 400
p 1/m2
Figure 2.13: Viewing time predicted by the priming model as function of the
parameters.
1
λH = 200
1
λL =
400
a = 0.3
1
λm2 =
200
The interaction plots predicted by the preview model for speech onset la-
tencies and viewing times are presented in Figures 2.15 and 2.16 respectively.
The model can describe the pattern in the speech onset quite accurately. The
fit of the viewing time data is not so good.
An attempt was made to estimate optimal parameter values for the data
of Experiment 1a by defining an error measure as follows:
CHAPTER 2. MODELS 31
2.5 3
2.5
E(N)
E(N)
2 2
1.5
1.5 1
300 350 400 450 500 300 350 400 450 500
1/l1 1/l2
3 4
3.5
2.5
3
E(N)
E(N)
2 2.5
2
1.5
1.5
1 1
0.8 1 1.2 1.4 100 200 300 400
p 1/m1
Figure 2.14: Number of refixations to the first object predicted by the priming
model as function of the parameters.
The error measure was minimized using a simplex search, where none
1
of the parameters was restricted. As starting values of the search λl1
=
1 1
200, λl2
= 300, a = 0.2, λm2
= 200 were used. This minimization resulted
in the following parameter estimations:
1 1 1
= 618, = 662, a = 3.2, = 444
λl1 λl2 λm2
were found, which results in the predicted and observed means plot shown
in Figure 2.17.
CHAPTER 2. MODELS 32
1100
1st Object: High
1st Object: Low
1000
900
800
RT
700
600
500
400
1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 2
Freq. 2nd Object
Figure 2.15: Pattern in the speech onset latencies predicted by the preview
model.
First of all, the parameter values raise some questions about the qualita-
tive fit of the model: retrieval of high frequent words is not much faster than
of low frequent words (618 vs 662 ms). Worse than this is that is it predicted
that parafoveal processing is faster than foveal processing (a = 3.2). Then
the predicted mean plot for reaction times show two parallel lines instead of
an interaction. Changing the initial values of the search does not result in
very different estimations. Finally, the predicted probability of not making
a saccade to the second object is far too high: P = 0.803, probably because
of the efficient preview caused by the high estimated value of a.
In an attempt to improve estimated parameter values, the preview pa-
rameter, a, is fixed to a value of 0.3. The resulting parameter values are:
1 1 1
λl1
= 325, λl2
= 331, a = 0.3, λm2
= 344, resulting in the predicted and
CHAPTER 2. MODELS 33
375
1st Object: High
1st Object: Low
370
365
VT
360
355
350
1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 2
Freq. 2nd Object
Figure 2.16: Pattern in the viewing times predicted by the preview model.
780 750
1st Object: High 1st Object: High
1st Object: Low 740 1st Object: Low
760
730
740
720
720
710
700 700
680 690
1 1.2 1.4 1.6 1.8 2 1 1.2 1.4 1.6 1.8 2
Predicted Means
602 602
1st Object: High 1st Object: High
600 1st Object: Low 600 1st Object: Low
598 598
VT
596 596
594 594
592 592
590 590
1 1.2 1.4 1.6 1.8 2 1 1.2 1.4 1.6 1.8 2
Freq. 2nd Object
Figure 2.17: Observed and predicted means for the parameter values esti-
mated for the preview model.
740
RT
RT
720
720
715
700
680 710
1 1.2 1.4 1.6 1.8 2 1 1.2 1.4 1.6 1.8 2
Freq. 2nd Object Freq. 2nd Object
VT
596
596
594
592 595
590 594
1 1.2 1.4 1.6 1.8 2 1 1.2 1.4 1.6 1.8 2
Freq. 2nd Object Freq. 2nd Object
Figure 2.18: Observed and predicted means for the parameter values esti-
mated for the preview model when the preview parameter is fixed to a value
of 0.3.
1200
1st Object: High
1st Object: Low
1100
1000
900
800
700
600
1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 2
Freq. 2nd Object
Figure 2.19: Pattern in the speech onset latencies predicted by the priming
model.
λl1
E(N) =
λm2
Therefore, the expected number of refixations equals 0.42. The observed
mean is twice as big: 0.89. This difference could be corrected by not assum-
ing that refixating the first object can still occur during planning the eye
movement to the second object.
Although the fit of the priming model is far from perfect, the model
describes the data better than the preview model, which suggests that no
preview takes place in naming two pictures. However, it could be the case
that only perceptual processing of the second picture occurs while fixating
the first object. This option is investigated in the following section.
CHAPTER 2. MODELS 37
700
1st Object: High
1st Object: Low
650
600
550
VT
500
450
400
350
300
1 2
Freq. 2nd Object
Figure 2.20: Pattern in the viewing times predicted by the priming model.
1
E(T17 ) = {1 + λl1 · E(T27 ) + a · λl2a · E(T37 )}
λl1 + a · λl2a
1
E(T27 ) = {1 + λm2 · E(T57 ) + λl2a · E(T47 )}
λm2 + a · λl2a
1
E(T37 ) = + E(T47 )
λl1
CHAPTER 2. MODELS 38
RT
720
720
710
700 700
680 690
1 1.2 1.4 1.6 1.8 2 1 1.2 1.4 1.6 1.8 2
Freq. 2nd Object Freq. 2nd Object
VT
596
590
594
585
592 580
590 575
1 1.2 1.4 1.6 1.8 2 1 1.2 1.4 1.6 1.8 2
Freq. 2nd Object Freq. 2nd Object
Figure 2.21: Observed and predicted means for the parameter values esti-
mated for the priming model.
1
E(T47 ) = + E(T67 )
λm2
1
E(T57 ) = + E(T67 )
λl2a
1
E(T67 ) =
λl2b
Substituting equations will not yield much extra insight, therefore this is
skipped. The following substitutions are used for each of the frequencies:
" #−1
1 1
λl2b = −
λi λl2a
where λi equals λH for high frequent words and λL for low frequent words.
CHAPTER 2. MODELS 39
F: final state.
I: initial state.
m1: programming eye movement to object 1
F 7
m2: programming eye movement to object 2
m1 l1, a*l2a, m1 I
S1
1: m1 is cancelled
2: m2 is cancelled
3: m2b is cancelled
Figure 2.23 shows the expected reaction times for the parameter values
1 1 1 1
λH = 200
, λL = 400
, λp = 150
, a = 0.15, λm2 = 200
together with the
probability of each path taken in the OP diagram. A small interaction is
found, but this is not enough to explain the pattern found in the data of
Experiments 1 and 2.
In deriving the viewing the viewing times for the partial priming model,
an OP diagram with two final states is obtained (states 4 and 5). The viewing
time can be determined by applying the usual set of equations:
1250 0.6
1st Object: High 2−5
1st Object: Low 2−4
1200 3−4
0.5
1150
1100
0.4
1050
Probability
RT
1000 0.3
950
0.2
900
850
0.1
800
750 0
1 1.2 1.4 1.6 1.8 2 1 2 3
Freq. 2nd Object
700
1st Object: High
1st Object: Low
650
600
550
RT
500
450
400
350
300
1 2
Freq. 2nd Object
Derivations
This equation can be derived in the following way. The probability that a
process has finished before t1 equals:
Z t1
P (process f inished bef ore t1 ) = λ · exp(−λ t)dt =
0
The probability that both processes are still running at time t1 equals:
42
APPENDIX A. DERIVATIONS 43
The probability of at least one process that have finished at time t, can be
found by differentiating:
∂ exp(−(λ1 + λ2 ) t
P (min(process 1, process 2)) = =
∂t
(λ1 + λ2 ) · exp(−(λ1 + λ2) t)
λa
P (”A wins”) =
λa + λb
where λa is the rate of process A, and λb the rate of process B.
This equation can be derived in the following way:
Z ∞
P (”A wins”) = P (ta < tb ) = P (ta < tb |ta = t) · P (ta = t) dt =
t=0
Z ∞ Z ∞
P (tb > t|ta = t) · P (ta |t)dt = P (tb > t) · P (ta = t)dt =
0 0
∞
∞ 1
Z
λa exp(−λb t) · exp(−λa t)dt = λa exp(−(λa + λb )t · − =
0 λa + λb 0
λa
λa + λb
One of the processes has to win the race, so
λa
P (”B wins”) = 1 − P (”A wins”) = 1 − =
λa + λb
λb
λa + λb
APPENDIX A. DERIVATIONS 44
D
B C
A, B, C, D,....
A
It can be shown that process A does not influence the expected duration
of the stay in the state. This result can be derived as follows. Here it is
assumed that the process that recurs has rate λr and that all other rates are
denoted λi . The expected duration of the stay in the state equals:
1 X
E(T ) = P · 1 + λr · E(T ) + λi · Ti
i λi i6=r
Therefore:
X X
λi E(T ) − λr E(T ) = 1 + λi Ti
i i6=r
Thus: " #
X X
λi − λr E(T ) = 1 + λi Ti
i i6=r
And thus:
1 X
E(T ) = P · 1 + λi
i6=r λi i6=r
This expression for the expected duration of the stay in the state doesn’t
contain the rate of the recurring process. A way to interpretet this equation
APPENDIX A. DERIVATIONS 45
is that the expected duration does not take into account properties of the
recurring process.
Because of independence of the processes in a state, the recurring process
doesn’t have an influence on the probability of a certain process to win the
race.
p
mx (t) =
1 − q · et
where q equals 1 − p.
The mgf of the convolution of two distributions equals the product of the
mgf of each distribution. Therefore:
p1 p2
mx+y = mx · my = · =
1 − q1 · e 1 − q2 · et
t
p1 p2
2t
1 + q1 q2 e − q1 et − q2 et
The expected value of a distribution can be computed by first taking the
derivative of the mgf with respect to t:
∂mx+y −p1 p2 n
t t 2t
o
= · −q1 e − q2 e + 2 q1 q2 e
∂t [(1 − q1 · et )((1 − q2 · et )]2
Tables
46
APPENDIX B. TABLES 47
Figures
51
APPENDIX C. FIGURES 52
2.5 2.5
2 2
E1(N)
E(N)
1.5 1.5
1 1
0.5 0.5
100 200 300 400 500 100 200 300 400 500
l1 l1
6 1.2
4 1
E2(N)
p1
2 0.8
0 0.6
100 200 300 400 500 100 200 300 400 500
l1 l1
0.4
0.3
p2
0.2
0.1
0
100 200 300 400 500
l1
1.4 1.2
1.2
1
E1(N)
E(N)
1
0.8
0.8
0.6 0.6
100 200 300 400 500 100 200 300 400 500
1/l2 1/l2
1.6
1
1.4
E2(N)
p1
1.2
0.5
1
100 200 300 400 500 100 200 300 400 500
1/l2 1/l2
0.6
0.4
p2
0.2
0
100 200 300 400 500
1/l2
1.2 0.9
0.8
1
E1(N)
E(N)
0.7
0.8
0.6
0.6 0.5
0 0.2 0.4 0.6 0 0.2 0.4 0.6
a a
1.6 0.9
1.4 0.8
E2(N)
p1
1.2 0.7
1 0.6
0 0.2 0.4 0.6 0 0.2 0.4 0.6
a a
0.4
0.3
p2
0.2
0.1
0 0.2 0.4 0.6
a
1.5 1.5
1 1
E1(N)
E(N)
0.5 0.5
0 0
100 150 200 250 300 100 150 200 250 300
1/m2 1/m2
2 2
1.5 1
E2(N)
p1
1 0
0.5 −1
100 150 200 250 300 100 150 200 250 300
1/m2 1/m2
2
1
p2
−1
100 150 200 250 300
1/m2