Скачать книгу

tode. This shows that written words can activate their meaning through assembled phonology (tode – toad – FROG).

      In summary, there is good evidence that phonological information is activated during word reading, and that the activation can be in the form of assembled phonology as well as addressed phonology.

       Phonology in words with inconsistent mappings

      English has inconsistencies in the mappings from orthography to phonology. The grapheme ea can refer to the phoneme /i/ (as in bead) or /ε/ (as in head). Which of these is activated by assembled phonology?

      One assumption might be that that there is a set of grapheme‐phoneme correspondence rules and only one phoneme is activated (see Rastle & Coltheart, 1999, for a set of rules). In the example of ea, the grapheme‐phoneme conversion rule would be ea ‐> /i/, on the basis that this is the most frequent conversion in English monosyllabic words containing the grapheme ea. On the basis of assembled phonology, the word head would be pronounced /hid/. Words with a conflict between assembled and addressed phonology are called irregular words (because they do not follow the rules).

      The word‐naming task has been used to investigate conflicts between assembled and addressed phonology. Participants are presented with printed words and asked to name them aloud as rapidly as possible. As predicted, Rastle and Coltheart (1999) observed longer naming times for irregular words (hearts) than for regular words (hounds). In addition, the effect was stronger when the irregularity was at the beginning of the word (aisle) than toward the end (swap). Rastle and Coltheart interpreted this as evidence for the hypothesis that assembled phonology is a serial process going from word beginning to word end.

      The assumption that there is a set of grapheme‐phoneme correspondence rules has been contested, however. Glushko (1979) observed that participants took longer to name the word wave than wade, even though both contained the same vowel grapheme and both followed the ae ‐> /ā/ rule. Glushko argued that the difference arose because all words ending on –ade are pronounced in the same way, whereas this is not true for the words ending on –ave (think of have). According to Glushko, what is important is not whether a grapheme‐phoneme conversion follows a rule, but the extent to which the conversion is consistent across words.

      Further research found that in words with inconsistent mappings, not one but all possible phonemes become activated to some extent. This would mean that the written word bead activates both the phonology /bid/ and /bεd/; similarly, the assembled phonology of head includes both /hid/ and /hεd/. Evidence comes from Lesch and Pollatsek (1993) who observed that participants often erroneously indicate that the written words PILLOW and BEAD are semantically related. This is only possible if the visual word bead also activates the phonological code /bεd/.

      More evidence for the automatic activation of several possible phonological codes from orthography comes from research with bilinguals. If assembled phonology is computed automatically (Xu & Perfetti, 1999), the question then arises as to which phonology is computed in bilinguals who have mastered several alphabetic languages. Take a Dutch‐English bilingual for whom the Dutch word meel (flower) sounds like male and the English word male has the same Dutch rhyme pronunciation as the word finale. Which phonological forms are activated when the bilingual person reads a text? The phonology of the first language (Dutch)? Or the phonology of the language being read, in which case the activation of assembled phonology cannot be automatic but is under strategic control?

      All in all, there is strong evidence that in alphabetic writing systems, phonology is assembled automatically in the early stages of visual word recognition, and that various possible phonological codes are co‐assembled that can in turn contribute to visual word recognition and reading.

       Is there need for an orthographic code in visual word recognition?

      In the previous section, we discussed issues related to inconsistencies in grapheme‐phoneme mappings in English. But what happens when words are fully consistent (as in kiss)? Or in languages without inconsistencies? If the written code is fully transparent, is there still a need for speakers to store information about visual word forms in the brain, or is it more economical to assemble phonology and then access stored representations of spoken words?

      The idea that visual word recognition may be fully mediated by assembled phonology was defended by Frost (1998) in the strong phonological theory. Frost gave a list of arguments why such an organization would be likely in transparent languages, and might even apply to English, despite the inconsistent mappings for some words. In a way, the strong phonological theory returned to the original question asked by Huey (1908).

      A second problem for the strong phonological theory is that phonological effects in visual word recognition tend to be small (Brysbaert, 2003; Rastle & Brysbaert, 2006; Vasilev et al., 2019). Powerful experiments are needed to observe phonological priming, whereas orthographic priming is more robust.

      A final problem for the strong phonological view is that transposing letters in written words does not affect word processing much, even if the transposition results in large changes to phonology (Perea & Carreiras, 2006; Perea et al., 2011). A striking example comes from Perea and Lupker (2003) who reported that in masked priming, the target word ALWAYS is primed almost as much by neevr as by never, despite the large difference in assembled phonology. This is difficult to explain in a model relying on phonology alone.

      In summary, the empirical evidence points to the involvement of both orthography and assembled phonology in the processing of visual words, at least in alphabetic scripts. This view is called the weak phonological theory.

Скачать книгу