<?xml version="1.0" standalone="yes"?>
<Paper uid="W04-1503">
  <Title>A Simple String-Rewriting Formalism for Dependency Grammar</Title>
  <Section position="7" start_page="0" end_page="0" type="concl">
    <SectionTitle>
6 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have presented a generative string-rewriting system, Extended Context-Free Grammar, whose derivation trees are dependency trees with unbounded branching factor. We have shown how we can reuse the representation of shared parse forests well-known from CFGs for Extended Context-Free Grammar. The question arises whether we can represent the shared parse forest in a manner more directly in the spirit of dependency. This question was investigated by (Nasr, 2003). He shows that the factoring realized in the shared forest presented here and which is the key to the polynomial representation of a potentially exponential set, can be done directly on the dependency trees by introducing the notion of dependency sets.</Paragraph>
  </Section>
class="xml-element"></Paper>