go-v.orgdoi

Phase, Remnant Movement, and Computation : Remarks on Stabler (1999, 2010)

Dongwoo Park · Studies in Linguistics · 2019

  • DOI 10.17002/sil..50.201901.171
  • Publisher The Joongwon Linguistic Society of Korea
  • Type article
  • Issued 2019

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

Studies in Linguistics · The Joongwon Linguistic Society of Korea · article · 2019

Abstract

In order to explain how people can generate grammatical sentences, Stabler (2010) proposes a computational mechanism on minimalism, based on Chomsky’s (2000) syntactic theory. This computational system suggests the operation called pair feature cancelling, in order to capture the tenet of minimalist syntax that every type of movement is feature-driven (Chomsky, 1995; Van Urk and Richards, 2015 inter alia), and that A̅-moving elements move through edges of phases. Using this mechanism, Stabler (1999) proposes a way of accounting for the derivation of remnant movement.

In this paper, however, I argue that Stabler’s (1999, 2010) system has two non-trivial problems: First, pair feature deletion increases the burden in the computation, and thus, it is not intuitive at all. Second, Stabler’s system cannot account for why remnant movement is permitted in some environments, but not in the others. This indicates that Stabler’s computational system is insufficient to capture all kinds of phase-based operations. In order to resolve these problems, I briefly present possible solutions, which is more compatible with Chomsky’s syntactic theories, partially maintaining Stabler’s computational notations.

Open the resolved locator · 10.17002/sil..50.201901.171

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-20 03:31 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://www.dbpia.co.kr:443/journal/articleDetail
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.