Recognizing head movement

Abstract. Previous studies have provided logical representations and eÆcient recognition algorithms for a simple kind of \minimalist gram-mars. " This paper extends these grammars with head movement (\incor-poration") and aÆx hopping. The recognition algorithms are elaborated for these grammars, and logical perspectives are brie y considered. Michaelis (1998) showed how the derivations of a simple kind of minimalist gram-mar (MG) (Stabler, 1997) correspond to derivations of exactly the same strings in a multiple context free grammar (MCFG) (Seki et al., 1991). MGs build structures by merging pairs of expressions, and simplifying single expressions by moving a subexpression in them. The basic idea behind the correspondence with MCFGs can be traced back to Pollard (1984) who noticed, in eect, that when a constituent is going to move, we should not regard its yield as included in the yield of the expression that contains it. Instead, the expression from which something will move is better regarded has having multiple yields, multiple com-ponents { the \moving " components have not yet reached their nal positions