Minimal search as a restriction on Merge

Abstract

In this paper I argue that a stricture in which Merge between a root and another element must take place across the smallest search domain possible. Only when the smallest search domain is exhausted or otherwise inapplicable are wider search domains open to Merge. This in effect results in internal Merge being the first option, external Merge being the second, and sideward movement being the last. The results of this minimal search condition are that Merge as an explanation for displacement is made more explicit, ungrammatical phase-escape is ruled-out as a possibility (as opposed to ungrammatical, yet possible), sideward movement is effectively ruled-out as movement option, and the generalization the displacement result in a c-command configuration is enforced without need of explicit encoding. These results obtain due to a plausible implementation of the notion that some of human language is shaped by so-called third factor constraints like minimal search.