Hostname: page-component-8448b6f56d-42gr6 Total loading time: 0 Render date: 2024-04-23T08:37:36.754Z Has data issue: false hasContentIssue false
  • English
  • Français

Grossberg and colleagues solved the hyperonym problem over a decade ago

Published online by Cambridge University Press:  01 February 1999

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

Abstract

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.

Type
Open Peer Commentary
Information
Behavioral and Brain Sciences , Volume 22 , Issue 1 , February 1999 , pp. 38 - 39
Copyright
© 1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)