. 2013 Sep 12;13(11):10. doi: 10.1167/13.11.10

Table 3.

Performance of various models relating complex search to simple search. Notes: For each model, we used simple search times to predict complex search time (Models 1 through 3) or simple search distance to predict complex search distance (Models 4 through 6). All correlations were statistically significant (p < 0.005).

Model type	#	Model interpretation	Correlation with data (n = 96)	Model coefficients
Model type	#	Model interpretation	Correlation with data (n = 96)	a	b	c	d
Models based on search times (RT)	1	Complex search time is determined entirely by the search time for the harder distracter.	0.76	-	-	-	-
	1	RT(T, D₁D₂) = max RT(T, D₁), RT(T, D₂)	0.76	-	-	-	-
	2	Complex search time depends on both the easy and hard distracters.	0.79	0.88	0.94	–0.11	-
	2	RT(T, D₁D₂) = a × RT(T, D₁) + b × RT(T, D₂) + c	0.79	0.88	0.94	–0.11	-
	3	Complex search time depends on the easy and hard distracters as well as on distracter-distracter similarity.	0.82	0.81	1.29	–0.39	0.07
	3	RT(T, D₁D₂) = a × RT(T, D₁) + b × RT(T, D₂) + c × RT(D₁, D₂) + d	0.82	0.81	1.29	–0.39	0.07
Models based on search distance (1/RT)	4	Complex search distance is determined entirely by the hard (nearer) distracter.	0.84	-	-	-	-
	4	d(T, D₁D₂) = 1/RT(T, D₁D₂) = min (1/RT(T, D₁), 1/RT(T, D₂))	0.84	-	-	-	-
	5	Complex search distance depends on both the hard and easy distracters.	0.85	0.73	0.16	–0.22	-
	5	d(T, D₁D₂) = 1/RT(T, D₁D₂) = a × d(T, D₁) + b × d(T, D₂) + c	0.85	0.73	0.16	–0.22	-
	6	Complex search distance depends on hard and easy distracters as well as on distracter-distracter dissimilarity.	0.91	0.60	0.45	–0.35	–0.05
	6	d(T, D₁D₂) = 1/RT(T, D₁D₂) = a × d(T, D₁) + b × d(T, D₂) + c × d(D₁, D₂) + d	0.91	0.60	0.45	–0.35	–0.05