Raising and Transparency  

Oleh:

Langacker, Ronald W.

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: Language (ada di JSTOR) vol. 71 no. 1 (1995), page 1-62.
Fulltext: Vol. 71, No. 1, pp. 1-62.pdf (1.28MB)

Isi artikel

The phenomena that classic transformational syntax handled by means of 'raising' rules pose an interesting challenge to theories that do not posit movement or derivation from underlying structures. An account of these phenomena is formulated in the context of COGNITIVE GRAMMAR. Raising is analyzed as a special case of the metonymy that virtually all relational expressions exhibit in regard to their choice of overtly coded argu- ments. The transparency of these constructions-the fact that the main clause imposes no restrictions on the 'raised' NP-is explained with reference to the semantics of the governing predicates.*

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali