Abstract

Visual search data were collected from six Ss on three target set sizes on each of 30 days. Error level was low, and items assigned to memory sets were nonnested and changed from session tosession. For each S. the same item sometimes required a positive and sometimes a negative response (response inconsistency). Combining data over Ss and over successive 6-day blocks, visual search rates as a function of target set size were found to be linear for each of the five 6-day blocks. The slopes of the above functions (memory search time) did not differ significantly over the final four 6-day blocks, and averaged approximately.500 sec per six-character item. These results are qualitatively very similar to results obtained from item recognition studies when error level, memory set structure, degree of response’_ consistency, and practice are handled in the same way in that task. The significantly lower slope obtained on the first 6-day block is shown to be consistent with a speed-accuracy trade off interpretation when error rate is expressed per unit of processing time (percent errors/set size). Over the final three 6-day blocks, where all important parameters ofthe data were highly stable, the intercepts of the memory search functions were found to closely approximate zero, averaging .0068 sec. From this finding, along with the finding that the memory search functions are linear, it is inferred that visual search time is determined entirely by memory search time, or by memory search time and other processes which increase linearly with set size, under the conditions of this experiment. The estimate of memory search time (approximately 83 msec/character) obtained using this visual search procedure is much slower than that obtained using the item recognition procedure (approximately 35\2-40 msec/character). An explanation for this difference is proposed.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.