In a word-naming experiment, word-body consistency was crossed with grapheme-to-phoneme regularity to test predictions of current models of word recognition. In the latency and error data, a clear effect of consistency was observed, with the influence of regularity somewhat weaker. In addition, simulation data from three contemporary models of word recognition were obtained for the stimuli used in the experiment in order to compare the models' latencies with those of humans. The simulations showed that the human latency data are most consistent with the parallel-distributed-processing model of Plaut, McClelland, Seidenberg, and Patterson (1996), less so with the dual-process model (Zorzi, Houghton, & Butterworth, 1998),and least so with the dual-route-cascaded model (Coltheart & Rastle, 1994).In experiments of reading aloud, irregular words (e.g., pint) take longer to name than regular words (e.g., punt). Usually, a word is considered to be irregular ifit violates grapheme-to-phoneme correspondence (GPC) rules, which typically correspond to the most frequent pronunciations of graphemes. For example, the rule for i is Itt, because this is the dominant pronunciation for i. Thus, according to this definition of regularity, pint is irregular because the i rule is violated. However,pint is also inconsistent. That is, there are similarly spelled words (e.g., mint, lint) with conflicting pronunciations of the word body (the vowel and following consonants). Many irregular words are also inconsistent, which has often led to a confounding ofthese variables, but they are separable dimensions. As a measure of consistency, we can examine the distribution of pronunciations associated with a particular word body. Words high on this measure ofconsistency are those that have many more friends (words that share the same body and a common pronunciation) than enemies (words containing the same body associated with a different pronunciation). For example, storm has worm as an enemy, but many more friends (form, norm, dorm, etc.). A word lower on this consistency dimension would be one with more enemies than friends, such as pint, which has the enemies mint, hint, lint, tint, and no friends.Several studies have demonstrated an effect of consistency that is independent of GPC regularity (Glushko, 1979;Jared, McRae, & Seidenberg, 1990). Words that are regular as defined by GPC rules, but have many enemies Special thanks go to Max Coltheart and Kathy Rastle, David Plaut, and Marco Zorzi. who provided simulation data from their respective models. We also thank Maura Pilotti, who provided useful comments on an earlier draft of this manuscript. Correspondence should be addressed to M. 1. Cortese, Department of Psychology, Morehead State University, 60 I Ginger Hall, Morehead, KY 40351 (e-mail:m.cortese@ morehead-st.edu).(e.g., mood) yield longer naming latencies than do regular consistent words (e.g., moon). In contrast, there is very little evidence that GPC regularity effects are independent of word-body consistency. However, in a recent...