<?xml version="1.0" standalone="yes"?>
<Paper uid="W06-1616">
  <Title>Sydney, July 2006. c(c)2006 Association for Computational Linguistics Incremental Integer Linear Programming for Non-projective Dependency Parsing</Title>
  <Section position="9" start_page="136" end_page="136" type="concl">
    <SectionTitle>
7 Conclusion
</SectionTitle>
    <Paragraph position="0"> In this paper we have presented a novel approach for inference using ILP. While previous approaches which use ILP for decoding have solved each integer linear program in one run, we incrementally add constraints and solve the resulting program until no more constraints are violated.</Paragraph>
    <Paragraph position="1"> This allows us to ef ciently use ILP for dependency parsing and add constraints which provide a signi cant improvement over the current state-of-the-art parser (McDonald et al., 2005b) on the Dutch Alpino corpus (see bl row in Table 1).</Paragraph>
    <Paragraph position="2"> Although slower than the baseline approach, our method can still parse large sentences (more than 50 tokens) in a reasonable amount of time (less than a minute). We have shown that parsing time can be signi cantly reduced using a simple approximation which only marginally degrades performance. Furthermore, we believe that the method has potential for further extensions and applications.</Paragraph>
  </Section>
class="xml-element"></Paper>