<?xml version="1.0" standalone="yes"?>
<Paper uid="J02-4004">
  <Title>c(c) 2002 Association for Computational Linguistics Efficiently Computed Lexical Chains as an Intermediate Representation for Automatic Text Summarization</Title>
  <Section position="6" start_page="496" end_page="496" type="concl">
    <SectionTitle>
6. Conclusions
</SectionTitle>
    <Paragraph position="0"> In this article, we have outlined an efficient, linear-time algorithm for computing lexical chains as an intermediate representation for automatic machine text summarization.</Paragraph>
    <Paragraph position="1"> This algorithm is robust in that it uses the method proposed by Barzilay and Elhadad, but it is clearly O(n) in the number of nouns in the source document.</Paragraph>
    <Paragraph position="2"> The benefit of this linear-time algorithm is its ability to compute lexical chains in documents significantly larger than could be handled by Barzilay and Elhadad's implementation. Thus, our algorithm makes lexical chains a computationally feasible intermediate representation for summarization. In addition, we have presented a method for evaluating lexical chains as an intermediate representation and have evaluated the method using 24 documents that contain human-generated summaries. The results of these evaluations are promising.</Paragraph>
    <Paragraph position="3"> An operational sample of our algorithm is available on the Web; a search engine that uses our algorithm can be accessed there as well (available at &lt;http://www.eecis.</Paragraph>
    <Paragraph position="4"> udel.edu/[?]silber/research.htm&gt; ).</Paragraph>
  </Section>
class="xml-element"></Paper>