<?xml version="1.0" standalone="yes"?>
<Paper uid="P90-1015">
  <Title>LICENSING AND TREE ADJOINING GRAMMAR IN GOVERNMENT BINDING PARSING</Title>
  <Section position="9" start_page="116" end_page="117" type="concl">
    <SectionTitle>
6 Conclusion
</SectionTitle>
    <Paragraph position="0"> In this paper, I have sketched a psychologically plausible model for the use of GB grammars. The currently implemented parser is a bit too simple to be truly robust, but the general approach presented here seems promising.</Paragraph>
    <Paragraph position="1"> Particularly interesting is that the computationally motivated use of TAG to constrain processing locality provides us with insight on the nature of the meta-grammar of possible grammatical constraints. Thus, if grammatical principles are stated over such a bounded domain, we can guarantee the existence of a perspicuous model for their use, thereby lending credence to the cognitive reality of this competence grammar.</Paragraph>
  </Section>
class="xml-element"></Paper>