Semantic and Associative Priming in a Distributed Attractor Network

David C. Plaut · 1995

A distributed attractor network is trained on an abstract version of the task of deriving the meanings of written words. When processing a word, the network starts from the final activity pattern of the previous word. Two words are semantically related if they overlap in their semantic features, whereas they are associatively related if one word follows the other frequently during training. After training, the network exhibits two empirical effects that have posed problems for distributed network theories: much stronger associative priming than semantic priming, and significant associative priming across an intervening unrelated item. It also reproduces the empirical findings of greater priming for low-frequency targets, degraded targets, and high-dominance category exemplars. Introduction In a variety of lexical tasks, including naming and lexical decision, subjects are faster and more accurate to process a word, such as BUTTER, when it is preceded by a semantically related word, suc...

Read the paper · More papers on PaperTik