Search (3 results, page 1 of 1)

0.0011258282 = product of:
  0.009006626 = sum of:
    0.009006626 = product of:
      0.027019877 = sum of:
        0.027019877 = weight(_text_:22 in 2421) [ClassicSimilarity], result of:
          0.027019877 = score(doc=2421,freq=2.0), product of:
            0.1163944 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03323817 = queryNorm
            0.23214069 = fieldWeight in 2421, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=2421)
      0.33333334 = coord(1/3)
  0.125 = coord(1/8)

Source

Research and advanced technology for digital libraries : 10th European conference, proceedings / ECDL 2006, Alicante, Spain, September 17 - 22, 2006

8.269935E-4 = product of:
  0.006615948 = sum of:
    0.006615948 = product of:
      0.03307974 = sum of:
        0.03307974 = weight(_text_:problem in 5049) [ClassicSimilarity], result of:
          0.03307974 = score(doc=5049,freq=2.0), product of:
            0.1410789 = queryWeight, product of:
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.03323817 = queryNorm
            0.23447686 = fieldWeight in 5049, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5049)
      0.2 = coord(1/5)
  0.125 = coord(1/8)

Abstract

Based on the salient features of the documents, automatic text summarization systems extract the key sentences from source documents. This process supports the users in evaluating the relevance of the extracted documents returned by information retrieval systems. Because of this tool, efficient filtering can be achieved. Indirectly, these systems help to resolve the problem of information overloading. Many automatic text summarization systems have been implemented for use with different languages. It has been established that the grammatical and lexical differences between languages have a significant effect on text processing. However, the impact of the language differences on the automatic text summarization systems has not yet been investigated. The authors provide an impact analysis of language difference on automatic text summarization. It includes the effect on the extraction processes, the scoring mechanisms, the performance, and the matching of the extracted sentences, using the parallel corpus in English and Chinese as the tested object. The analysis results provide a greater understanding of language differences and promote the future development of more advanced text summarization techniques.

6.615948E-4 = product of:
  0.0052927583 = sum of:
    0.0052927583 = product of:
      0.026463792 = sum of:
        0.026463792 = weight(_text_:problem in 2676) [ClassicSimilarity], result of:
          0.026463792 = score(doc=2676,freq=2.0), product of:
            0.1410789 = queryWeight, product of:
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.03323817 = queryNorm
            0.1875815 = fieldWeight in 2676, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.03125 = fieldNorm(doc=2676)
      0.2 = coord(1/5)
  0.125 = coord(1/8)

Content

1. Introduction This paper reports our initial effort to develop an automatic method for parsing the discourse structure of sociology dissertation abstracts. This study is part of a broader study to develop a method for multi-document summarization. Accurate discourse parsing will make it easier to perform automatic multi-document summarization of dissertation abstracts. In a previous study, we determined that the macro-level structure of dissertation abstracts typically has five sections (Khoo et al., 2002). In this study, we treated discourse parsing as a text categorization problem - assigning each sentence in a dissertation abstract to one of the five predefined sections or categories. Decision tree induction, a machine-learning method, was applied to word tokens found in the abstracts to construct a decision tree model for the categorization purpose. Decision tree induction was selected primarily because decision tree models are easy to interpret and can be converted to rules that can be incorporated in other computer programs. A well-known decision-tree induction program, C5.0 (Quinlan, 1993), was used in this study.