<?xml version="1.0" standalone="yes"?>
<Paper uid="W04-3201">
  <Title>Max-Margin Parsing</Title>
  <Section position="9" start_page="2" end_page="2" type="concl">
    <SectionTitle>
7 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have presented a maximum-margin approach to parsing, which allows a discriminative SVM-like objective to be applied to the parsing problem. Our framework permits the use of a rich variety of input features, while still decomposing in a way that exploits the shared sub-structure of parse trees in the standard way. On a test set of [?] 15 word sentences, the feature-rich model outperforms both its own natural generative baseline and the Collins parser on F1. While like most discriminative models it is compute-intensive to train, it allows fast parsing, remaining cubic despite the incorporation of lexical features. This trade-off between the complexity, accuracy and efficiency of a parsing model is an important area of future research.</Paragraph>
  </Section>
class="xml-element"></Paper>