<?xml version="1.0" standalone="yes"?>
<Paper uid="W99-0502">
  <Title>A Case Study on Inter-Annotator Agreement for Word Sense Disambiguation Hwee Tou Ng</Title>
  <Section position="9" start_page="10" end_page="10" type="relat">
    <SectionTitle>
8 Related Work
</SectionTitle>
    <Paragraph position="0"> Recently, both Bruce and Wmbe (1998) and Veroms (1998) have looked into algorithms to automancallv generate better sense classes m a corpus-based, data-driven manner However, the algorithms they used differ from ours Bruce and Wlebe (1998) made use of an EM algorithm ~la a latent class model to dense better sense classes Veroms (1998) performed a Muluple Correspondence Analyms on the table of annotatmns (a triple composed of a context, a judge and a sense) to reduce dlmensmnaht? follo~ed b? tree-clustering In contrast, our greedb search algorithm ~s a rumple but effecuve method that makes use of the Kappa statlsUC to search the space of possible sense groupings dlrecdy</Paragraph>
  </Section>
class="xml-element"></Paper>