<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-2213">
  <Title>A Method for Relating Multiple Newspaper Articles by Using Graphs, and Its Application to Webcasting</Title>
  <Section position="5" start_page="1311" end_page="1311" type="relat">
    <SectionTitle>
6 Related Work
</SectionTitle>
    <Paragraph position="0"> There have been several studies how to relate articles (McKeown et al., 1995; Yamamoto et al., 1995; Mani et al., 1997). McKeown et al. reported a method for summarizing news articles (McKeown et al., 1995). In their approach, templates, which have slots and their values (for example, incidentlocation=&amp;quot;New York&amp;quot;), are extracted from the articles. Summary sentences are constructed by combining the templates. Although this approach can capture topics contained in the articles, the relationships between articles are not visualized.</Paragraph>
    <Paragraph position="1"> Clustering techniques make it possible to visualize the contents of a set of documents. Hearst et al. proposed the scatter/gather approach for facilitating information retrieval (Hearst et al., 1995).</Paragraph>
    <Paragraph position="2"> Maarek et al. related documents by using an hierarchical clustering algorithm that interacts with the user. Although these clustering algorithms impose a procedure GetMaxtPath(A) //Get max path MaxPath\[i\] for di. A is a set of arcs.</Paragraph>
    <Paragraph position="3"> for i = 1 to n begin MaxPath\[i\] +- NULL end for j = 1 to n begin fori=j-ktoj- lbegin if (di, dj) E A then if Length(MaxPath\[j\]) &lt; Length(MaxPath\[i\]) + 1  returns the number of arcs in path.</Paragraph>
    <Paragraph position="4"> procedure Connect(path, arc) if path = (do,..., di) and arc = (di, dj), then return (do,..., di, dj).</Paragraph>
    <Paragraph position="5"> Figure 11: Procedure for Finding the Longest Path heavy computation cost, our threading algorithm is efficient, because it uses a chronological constraint.</Paragraph>
  </Section>
class="xml-element"></Paper>