Semantic memory: Complexity or connectivity?

Abstract

The complexity hypothesis predicts that concept-feature verification times should be directly related to the number of features associated with a concept (the fan effect). Conversely, the connectivity hypothesis predicts that for interconnected semantic relationships, this verification time should be inversely related to the number of closely associated features (the reversed fan effect). In the present experiments, although the time required for episodic recognition memory decisions tended to be directly related to the number of features associated with a concept, semantic verification times were inversely related to the complexity of the concept. In addition, the concept's complexity was at least as good a predictor of performance in semantic tasks as was the strength of association between the concept and feature. Both of these results are interpreted in terms of the connectivity hypothesis.