Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-09T21:56:05.577Z Has data issue: false hasContentIssue false

Grossberg and colleagues solved the hyperonym problem over a decade ago

Published online by Cambridge University Press:  01 February 1999

Jeffrey S. Bowers
Affiliation:
Department of Experimental Psychology, University of Bristol, Bristol BS8 1TN, England j.bowers@bris.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Levelt et al. describe a model of speech production in which lemma access is achieved via input from nondecompositional conceptual representations. They claim that existing decompositional theories are unable to account for lexical retrieval because of the so-called hyperonym problem. However, existing decompositional models have solved a formally equivalent problem.

Information

Type
Open Peer Commentary
Copyright
© 1999 Cambridge University Press