This paper aims to explain Chomsky``s (2013) Labeling Algorithm and to provide appropriate solutions to the problems it contains. Chomsky (2013) argues that the obligatory raising of subject to Spec-TP (i.e., EPP) is no longer driven by feature checking, but the Labeling Algorithm. However, it seems difficult to apply this algorithm to VS(O) constructions which license the postverbal subject in Spec-v*P, since the Labeling Algorithm forces the subject to move out of the base-generated position (i.e. Spec-v*P). In order to resolve this problem, we have proposed a revised Labeling Algorithm, which is different from Chomsky``s original one in that a minimal search operation is applied at the phase level and in ‘top to bottom’ fashion. It is also shown that the revised Labelling Algorithm is compatible not only with VS(O) constructions in Null Subject Languages, but also with SV(O) constructions in non-Null Subject Languages.