<?xml version="1.0" standalone="yes"?>
<Paper uid="W06-3815">
  <Title>Context Comparison as a Minimum Cost Flow Problem</Title>
  <Section position="7" start_page="102" end_page="103" type="evalu">
    <SectionTitle>
6 Results and Analysis
</SectionTitle>
    <Paragraph position="0"> To compare the two variants of our method, we perform our name disambiguation experiment using 100 and 200 training instances per ambiguous name to create the gold standard profiles. See Table 1 for the results. Comparing the results using the full network and the transformed network, observe that there is very little performance degradation; in fact, in most cases, there is an increase in accuracy (the difference is significant, paired t-test with a11a13a12 a37a32a161a96a37a15a14 ).</Paragraph>
    <Paragraph position="1"> Distance Transformation In Jiang and Conrath's formulation, the network transformation replaces the term a2 a69a28a241 a5a8a242 a241a106a243 a5a30a146a137a9a66a245a32a13a68a13 with a2 a69a28a241a14a5a121a241a106a243 a5a30a146a137a9a66a245a32a13a68a13 , where a241a106a243 a5a30a146a12a9a66a245a138a13 is some common ancestor of a24 and 3Note that the complexity of this selection process is linear, since all profile nodes must be examined to ensure they have an ancestor in the junction; any profile node of which no junction node is an ancestor is added to the junction. This process can only be avoided by using junction nodes of zero depth exclusively. null  a79 , whose depth is small. Junction nodes with a small depth distort the distance more than those with a larger depth. Surprisingly, our experiment indicates that using such nodes produces equally good or better performance. This suggests that selecting a junction with a larger depth, at least for the data in this task, is not necessary.</Paragraph>
    <Paragraph position="2"> Speed Improvement In comparison to our reported running time on the pre-transformation network (120 comparisons running for 10 days), on the same machine, making 12,000 comparisons can now be accomplished within two hours. In terms of complexity, if we have a16 profile nodes and a79 junction nodes, the number of edges to be processed is a17 a5a5a16a18a0 a79a20a19a113a13 . Given that our junctions have significantly fewer nodes than the original profiles, the running time is significantly less than quadratic in the number of profile nodes.</Paragraph>
  </Section>
class="xml-element"></Paper>