File Information
File: 05-lr/acl_arc_1_sum/cleansed_text/xml_by_section/intro/95/p95-1056_intro.xml
Size: 1,812 bytes
Last Modified: 2025-10-06 14:06:00
<?xml version="1.0" standalone="yes"?> <Paper uid="P95-1056"> <Title>A Minimalist Head-Corner Parser</Title> <Section position="3" start_page="0" end_page="338" type="intro"> <SectionTitle> 2 GT and Move-c~ </SectionTitle> <Paragraph position="0"> The central operations of the Minimalist Program are Generalized Transformation (GT) and Move~. GT is a structure-building operation that builds trees in a bottom-up way as is illustrated in figure 2.</Paragraph> <Paragraph position="2"> Two phrase markers (V and DP) are combined into one. One of these two is called the target (V). A projection of the target (V) is added to the target. The projection of the target has two daughters: the target itself and an empty position. The empty position is substituted for by the second phrase marker (DP). This second phrase marker is itself built up in other applications of GT and/or Move-a.</Paragraph> <Paragraph position="3"> Move-(~ is a special kind of GT. It is an operation that combines a target with a moved phrase marker. It is assumed that movement is always leftward (Kayne, 1994) and that in the universal trees of the Minimalist Program heads and specifiers, which are the only positions to move to, are always to the left of the projection line. These two assumptions in combination with the fact that GT and Move-a are bottom-up operations, effect that the moved phrase marker has to be contained in the tree that was built so far 1 The tree in figure 1 illustrates different kinds of movement. In the Minimalist Program movement occurs to check features. Elements move from the lexical domain (VP) to the functional domain (e.g.</Paragraph> <Paragraph position="4"> AgrOP, AgrSP) to compare their features with the features that are present in the functional domain.</Paragraph> </Section> class="xml-element"></Paper>