| Abstract: | This study addressed two basic questions about the detection of multi-letter patterns: (a) How is the detection of a multi-letter pattern related to the detection of its individual components? (b) How is the detection of a sequence of letters influenced by the observer's familiarity with that sequence? In three experiments observers searched for one-, two-, or three letter patterns embedded in a rapid series of multiple six-letter frames. In Experiment 1, unfamiliar two-letter patterns were detected more accurately than their one-letter components. This two-letter advantage reflects the fact that in an array of fixed size, larger target stimuli contain more information and are easier to discriminate from nontarget alternatives. Quantitative analyses indicated that observers combine information not decisions, about the component letters in a pattern. In Experiment 2, with statistical and physical properties equated, a familiar three-letter pattern (i.e., CAT) was detected more accurately than its unfamiliar anagram (i.e., TCA). This word advantage in word (not letter) detection persisted even after extensive practice and was uninfluenced by the lexical character of distractor items. In Experiment 3, words (e.g., FIB), pronounceable non words (e.g., FIF(, and familiar acronyms (e.g., FBI) were detected more readily than unfamiliar items (e.g., IBF). Thus both orthographic knowledge and familiarity with specific sequences can facilitate perceptual processing in "word" detection. |
