This paper concerns ifself with the problem of the label <φ,φ>, which is suggested by Chomsky (2013) as the label of the syntactic object constructed by Merge of TP with the subject DP. To solve Adger’s (2012) specifier problem, Chomsky (2013) assumes that features can be the label of {XP, YP} when they are shared by the two phrases. The typical case for this labeling involves the syntactic object {Subject, TP}, which has <φ,φ> as its label. Considering that this labeling algorithm induces some conceptual problems, we would like to suggest in this paper that another mechanism be hired to solve the problems to the effect that the phi-phrase is eliminated. Adapting Uriagereka’s (1999) multiple spell-out and Takita, Goto, and Shibata’s (2016) visibility hypothesis for transferred elements, this paper can successfully solve the problem of phi-phrase.

The approach to the study of language has recently changed in a way to accommodate the findings from its neighboring research fields. Evidence from evolutionary anthropology, genetics and biology has the FL restricted to recursion only, leaving all other mechanisms to the conditions on interfaces. Given that Merge is the most fundamental operation of FL, the labeling has been the target of research on the syntactic objects created by Merge. LA is an algorithm that searches the head property in the minimal domain and names it as a label. LA is part of Transfer and becomes complete at interfaces. This paper re-examines the algorithm of labeling in Chomsky (2013, 2015) to see how it works with the facts provided from areas other than linguistics. It also pursues the possibility that LA can derive coordination, double object constructions, and particle constructions. F-sharing is considered to be subject to parameterization in the minimalist frame though its role is not clear at interfaces except externalization.

Yong-Ha Kim. 2017. On the Problem of the Timing of Labeling: A Reply to Bošković (2016). Studies in Modern Grammar 96, 51-66. In this study, we critically discuss Bošković’s (2016) recent proposal about the labeling algorithm as proposed by Chomsky (2013, 2015). Bošković’s (2016) main claim is that the timing of labelling should be considered a crucial issue in Chomsky’s labeling algorithm. According to him, whatever its formulation, the labeling algorithm is taken to apply when the derivation reaches the interface. This means that there can, and should, be phrases without labels until the derivation enters the interface. Bošković (2016) further assumes that the label-less phrases trigger antilocality effects though the relevant movement would be sufficiently long if they had their own labels. With this assumption about the timing of labeling, Bošković is apparently successful in accounting for many interesting grammatical phenomena in a unique fashion.

This paper proposes a revised conception of labeling algorithm, which provides a redefined way of determining a label of syntactic objects(SO). It is shown that this revised labeling algorithm gains several theoretical and empirical consequences, eliminating certain obscure complications in Chomsky's (2013, 2014) framework. We point out in the revised labeling algorithm that first, given SO={Root, XP}, minimal search which only searches the categorial feature of the head unambiguously selects the root as the label of the SO containing it. Second, given SO={XP, YP}, where the label of the SO cannot be straightforwardly determined, a feature sharing is undergone via the categorial feature of C and T. Third, given SO={NP, vP}, in order to determine the label of the SO, NP moves out of the SO in which vP can not be feature-shared with NP due to the fact the head R of vP is unspecified in the category. Thus the revised labeling algorithm that makes use of specific notions such as the root, specified/unspecified categorial features removes some unnecessary complications of Chomsky(2013, 2014) but also can give a novel answer to an unanswered question concerning CHL's phase recognition in the syntax.