Hostname: page-component-6766d58669-vgfm9 Total loading time: 0 Render date: 2026-05-24T01:16:55.643Z Has data issue: false hasContentIssue false

Raising and Transparency

Published online by Cambridge University Press:  19 February 2026

Ronald W. Langacker*
Affiliation:
University of California, San Diego
*
Department of Linguistics, 0108, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA 92093-0108

Abstract

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 arguments. 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.

Information

Type
Research Article
Copyright
Copyright © 1995 by the Linguistic Society of America

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.)

Article purchase

Temporarily unavailable