GRAPHEME-PHONEME CORRESPONDENCE (GPC) RULES
المؤلف:
John Field
المصدر:
Psycholinguistics
الجزء والصفحة:
P124
2025-08-26
613
GRAPHEME-PHONEME CORRESPONDENCE (GPC) RULES
Rules which specify the relationship between a written letter and the phoneme which it conventionally represents. In a dual route model of reading, a lexical route permits the reader to match known words on a ‘whole word’ basis; but a second (sub-lexical) route is also available which draws upon the reader’s knowledge of GPC rules. The two routes appear to operate in parallel and the ability to apply GPC rules rapidly has been shown to be a characteristic of a skilled reader. The particular advantage of the sub-lexical route is that it enables the reader to process unknown words. The latter might be words never encountered in visual form, new coinages or proper nouns.
GPC rules have a more limited value with an opaque alphabetic system like that of English than with a more transparent one like that of Spanish. Indeed, if the rules were applied on the strict basis of one letter-one sound, up to 50 per cent of English words would be characterised as ‘irregular’. In an opaque system, GPC rules are therefore often taken to extend to clusters of letters (including digraphs such as SH- or-EA-). Alternatively, they are regarded as operating in conjunction with analogy effects which permit parallels to be drawn between, for example, RIGHT, FIGHT and MIGHT.
A connectionist view suggests that we interpret written words by means of a set of distributed representations based upon three-letter clusters: so an interpretation of the sequence HEAT would be the outcome of activation produced by the phoneme values for-HE, HEA, EATand AT-. Simulations of this process, however, have been restricted to four-letter words.
See also: Dual route, Reading: decoding, Reading: development
Further reading: Goswami and Bryant (1990); Oakhill and Garnham (1988); Rayner and Pollatsek (1989)
الاكثر قراءة في Linguistics fields
اخر الاخبار
اخبار العتبة العباسية المقدسة
