Above, we have summarized our results on
search time, but search efficiency is generally summarized as
search slope (Duncan & Humphreys,
1989): the rate at which search time increases as the set size increases. To obtain a search slope for each observer, we fitted simple least-squares regressions to their median search times plotted against the three set sizes. The average search slopes across all observers are shown in
Table 1A; the intercepts of the regressions (extrapolated “search time” for zero items) are also shown in
Table 1B. The search times for “low” and “high” discriminability arrays are consistent with the Duncan and Humphreys (
1989) rules: Slope is lower for homogeneous arrays than for heterogeneous, and it is higher for the “low” arrays (with low TD). For “high” discriminability homogeneous arrays, the search slope is near zero. The “metamer” arrays generally have the highest search slopes of all. We ran a linear mixed model on the data (using 60 data points with 12 slopes for each participant) with the
lme4 package (version 1.11-11; Bates, Mächler, Bolker, & Walker,
2014) and the
lmerTest package (version 2.0-30; Kuznetsova, Brockhoff, & Christensen,
2014) in R (version 3.2.3; Ihaka & Gentleman,
1996). The model contained picture family (cat vs. flower), distractor category (homogeneous vs. heterogeneous), and array type (“low,” “metamer,” or “high”) as fixed factors and subject as a random factor. Overall main effects were generated using the
car package (version 2.1-1; Fox & Weisberg,
2011). There was no effect of cat versus flower family,
χ2(1) = 0.151,
p > 0.05. There were effects on slope of whether distractors were homogeneous or heterogeneous,
χ2(1) = 21.700,
p < 0.001, and on discriminability class,
χ2(2) = 36.245,
p < 0.001; post hoc comparisons using Tukey tests in package
multcomp (version 1.4-3; Hothorn, Bretz, & Westfall,
2008) showed that the “metamer” arrays had significantly higher slopes than the “high” arrays (
Z = 6.020,
p < 0.001) and the “low” arrays (
Z = 2.976,
p = 0.008). The “low” arrays also had significantly higher slopes than the “high” arrays (
Z = 3.044,
p = 0.007). The “metamer” arrays therefore had the steepest slopes, followed by the “low” arrays, with the “high” arrays having the flattest slopes. It was not possible to examine all the interactions between the three factors because of the relatively small number of data points in each condition.