<?xml version="1.0" standalone="yes"?>
<Paper uid="W04-2417">
  <Title>A transformation-based approach to argument labeling</Title>
  <Section position="5" start_page="0" end_page="0" type="evalu">
    <SectionTitle>
4 Results
</SectionTitle>
    <Paragraph position="0"> The results on the test section of the CoNLL 2004 data are presented in Table 1 below. The overall result, an f-score of 60:66, is considerably below results reported for systems using a parser on a comparable data set. However, it is a reasonable result given the simplicity of our system, which does not make use of the additional information found in the PropBank frames themselves.</Paragraph>
    <Paragraph position="1"> It is an interesting question to what extent our results depend on the use of the Path feature (which Pradhan et al. (2003) found to be essential to their models' performance). Since this Path feature is also likely to be one of the model's most brittle features, depending heavily on the accuracy of the syntactic analysis, we might hope that the system does not depend too heavily on it. In fact, the overall f-score on the development set drops from 62:75 to 61:33 when the Path feature is removed, suggestig that it is not essential to our model, though it does help performance to some extent.</Paragraph>
  </Section>
class="xml-element"></Paper>