Control properties of semantic coding in a lexical decision task
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Decisions about whether pairs of letter strings are both words or not are typically faster for pairs of semantically related words than unrelated words (Meyer & Schvaneveldt, Journal of Experimental Psychology, 1971, 90, 227–234). Previous studies used orthographically legal, pronounceable nonwords in this task. In two experiments it was shown that the semantic relatedness effect is greatly reduced when orthographically illegal, unpronounceable strings were used as negative items. This finding supports the conclusion that options may be exercised on which of the codes representing a letter string are used in making lexical decisions.
