<?xml version="1.0" standalone="yes"?>
<Paper uid="W06-2936">
  <Title>Maximum Spanning Tree Algorithm for Non-projective Labeled Dependency Parsing</Title>
  <Section position="9" start_page="238" end_page="238" type="concl">
    <SectionTitle>
7 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have extended non-projective unlabeled dependency parsing (McDonald et al., 2005) to a very simple non-projective labeled dependency and showed that the parser performs reasonably well with small number of features and just one iteration of training. Based on the analysis of the Arabic parsing results, we have proposed a bottom-up non-projective labeled dependency parsing algorithm that allows us to use features dependent on more than one edge, with very little disadvantage compared to the original algorithm.</Paragraph>
  </Section>
class="xml-element"></Paper>