Search (50 results, page 2 of 3)

9.327775E-4 = product of:
  0.00373111 = sum of:
    0.00373111 = product of:
      0.0111933295 = sum of:
        0.0111933295 = weight(_text_:a in 941) [ClassicSimilarity], result of:
          0.0111933295 = score(doc=941,freq=14.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.20223314 = fieldWeight in 941, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=941)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

We argue that the quality of a summary can be evaluated based on how many concepts in the original document(s) that can be preserved after summarization. Here, a concept refers to an abstract or concrete entity or its action often expressed by diverse terms in text. Summary generation can thus be considered as an optimization problem of selecting a set of sentences with minimal answer loss. In this paper, we propose a document concept lattice that indexes the hierarchy of local topics tied to a set of frequent concepts and the corresponding sentences containing these topics. The local topics will specify the promising sub-spaces related to the selected concepts and sentences. Based on this lattice, the summary is an optimized selection of a set of distinct and salient local topics that lead to maximal coverage of concepts with the given number of sentences. Our summarizer based on the concept lattice has demonstrated competitive performance in Document Understanding Conference 2005 and 2006 evaluations as well as follow-on tests.

Type

a

9.327775E-4 = product of:
  0.00373111 = sum of:
    0.00373111 = product of:
      0.0111933295 = sum of:
        0.0111933295 = weight(_text_:a in 945) [ClassicSimilarity], result of:
          0.0111933295 = score(doc=945,freq=14.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.20223314 = fieldWeight in 945, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=945)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

The paper focuses on a particular approach to automatic sentence compression which makes use of a discriminative sequence classifier known as Conditional Random Fields (CRF). We devise several features for CRF that allow it to incorporate information on nonlinear relations among words. Along with that, we address the issue of data paucity by collecting data from RSS feeds available on the Internet, and turning them into training data for use with CRF, drawing on techniques from biology and information retrieval. We also discuss a recursive application of CRF on the syntactic structure of a sentence as a way of improving the readability of the compression it generates. Experiments found that our approach works reasonably well compared to the state-of-the-art system [Knight, K., & Marcu, D. (2002). Summarization beyond sentence extraction: A probabilistic approach to sentence compression. Artificial Intelligence 139, 91-107.].

Type

a

9.19731E-4 = product of:
  0.003678924 = sum of:
    0.003678924 = product of:
      0.011036771 = sum of:
        0.011036771 = weight(_text_:a in 4540) [ClassicSimilarity], result of:
          0.011036771 = score(doc=4540,freq=10.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.19940455 = fieldWeight in 4540, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4540)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

Browsing a database of article abstracts is one way to select and buy relevant magazine articles online. Our research contributes to the design and development of text grammars for abstracting texts in unlimited subject domains. We developed a system that parses texts based on the text grammar of a specific text type and that extracts sentences and statements which are relevant for inclusion in the abstracts. The system employs knowledge of the discourse patterns that are typical of news stories. The results are encouraging and demonstrate the importance of discourse structures in text summarisation.

Type

a

9.19731E-4 = product of:
  0.003678924 = sum of:
    0.003678924 = product of:
      0.011036771 = sum of:
        0.011036771 = weight(_text_:a in 3748) [ClassicSimilarity], result of:
          0.011036771 = score(doc=3748,freq=10.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.19940455 = fieldWeight in 3748, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3748)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

After lying dormant for a few decades, the field of automated text summarization has experienced a tremendous resurgence of interest. Recently, many new algorithms and techniques have been proposed for identifying important information in single documents and document collections, and for mapping this information into grammatical, cohesive, and coherent abstracts. Since 1997, annual workshops, conferences, and large-scale comparative evaluations have provided a rich environment for exchanging ideas between researchers in Asia, Europe, and North America. This entry reviews the main developments in the field and provides a guiding map to those interested in understanding the strengths and weaknesses of an increasingly ubiquitous technology.

Type

a

8.813918E-4 = product of:
  0.0035255672 = sum of:
    0.0035255672 = product of:
      0.010576702 = sum of:
        0.010576702 = weight(_text_:a in 522) [ClassicSimilarity], result of:
          0.010576702 = score(doc=522,freq=18.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.19109234 = fieldWeight in 522, product of:
              4.2426405 = tf(freq=18.0), with freq of:
                18.0 = termFreq=18.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=522)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

The purpose of this study was to develop a method for automatic construction of multidocument summaries of sets of research abstracts that may be retrieved by a digital library or search engine in response to a user query. Sociology dissertation abstracts were selected as the sample domain in this study. A variable-based framework was proposed for integrating and organizing research concepts and relationships as well as research methods and contextual relations extracted from different dissertation abstracts. Based on the framework, a new summarization method was developed, which parses the discourse structure of abstracts, extracts research concepts and relationships, integrates the information across different abstracts, and organizes and presents them in a Web-based interface. The focus of this article is on the user evaluation that was performed to assess the overall quality and usefulness of the summaries. Two types of variable-based summaries generated using the summarization method-with or without the use of a taxonomy-were compared against a sentence-based summary that lists only the research-objective sentences extracted from each abstract and another sentence-based summary generated using the MEAD system that extracts important sentences. The evaluation results indicate that the majority of sociological researchers (70%) and general users (64%) preferred the variable-based summaries generated with the use of the taxonomy.

Type

a

8.309842E-4 = product of:
  0.0033239368 = sum of:
    0.0033239368 = product of:
      0.0099718105 = sum of:
        0.0099718105 = weight(_text_:a in 1003) [ClassicSimilarity], result of:
          0.0099718105 = score(doc=1003,freq=16.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.18016359 = fieldWeight in 1003, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1003)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

This paper proposes two approaches to address text summarization: modified corpus-based approach (MCBA) and LSA-based T.R.M. approach (LSA + T.R.M.). The first is a trainable summarizer, which takes into account several features, including position, positive keyword, negative keyword, centrality, and the resemblance to the title, to generate summaries. Two new ideas are exploited: (1) sentence positions are ranked to emphasize the significances of different sentence positions, and (2) the score function is trained by the genetic algorithm (GA) to obtain a suitable combination of feature weights. The second uses latent semantic analysis (LSA) to derive the semantic matrix of a document or a corpus and uses semantic sentence representation to construct a semantic text relationship map. We evaluate LSA + T.R.M. both with single documents and at the corpus level to investigate the competence of LSA in text summarization. The two novel approaches were measured at several compression rates on a data corpus composed of 100 political articles. When the compression rate was 30%, an average f-measure of 49% for MCBA, 52% for MCBA + GA, 44% and 40% for LSA + T.R.M. in single-document and corpus level were achieved respectively.

Type

a

8.2263234E-4 = product of:
  0.0032905294 = sum of:
    0.0032905294 = product of:
      0.009871588 = sum of:
        0.009871588 = weight(_text_:a in 3343) [ClassicSimilarity], result of:
          0.009871588 = score(doc=3343,freq=2.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.17835285 = fieldWeight in 3343, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.109375 = fieldNorm(doc=3343)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Type

a

8.2263234E-4 = product of:
  0.0032905294 = sum of:
    0.0032905294 = product of:
      0.009871588 = sum of:
        0.009871588 = weight(_text_:a in 4667) [ClassicSimilarity], result of:
          0.009871588 = score(doc=4667,freq=2.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.17835285 = fieldWeight in 4667, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.109375 = fieldNorm(doc=4667)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Type

a

8.2263234E-4 = product of:
  0.0032905294 = sum of:
    0.0032905294 = product of:
      0.009871588 = sum of:
        0.009871588 = weight(_text_:a in 132) [ClassicSimilarity], result of:
          0.009871588 = score(doc=132,freq=8.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.17835285 = fieldWeight in 132, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=132)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

Selective Analysis is a new method for text summarization of technical articles whose design is based on the study of a corpus of professional abstracts and technical documents The method emphasizes the selection of particular types of information and its elaboration exploring the issue of dynamical summarization. A computer prototype was developed to demonstrate the viability of the approach and the automatic abstracts were evaluated using human informants. The results so far obtained indicate that the summaries are acceptable in content and text quality

Type

a

8.2263234E-4 = product of:
  0.0032905294 = sum of:
    0.0032905294 = product of:
      0.009871588 = sum of:
        0.009871588 = weight(_text_:a in 943) [ClassicSimilarity], result of:
          0.009871588 = score(doc=943,freq=8.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.17835285 = fieldWeight in 943, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=943)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

We present a new paradigm for the automatic creation of document headlines that is based on direct transformation of relevant textual information into well-formed textual output. Starting from an input document, we automatically create compact representations of weighted finite sets of strings, called WIDL-expressions, which encode the most important topics in the document. A generic natural language generation engine performs the headline generation task, driven by both statistical knowledge encapsulated in WIDL-expressions (representing topic biases induced by the input document) and statistical knowledge encapsulated in language models (representing biases induced by the target language). Our evaluation shows similar performance in quality with a state-of-the-art, extractive approach to headline generation, and significant improvements in quality over previously proposed solutions to abstractive headline generation.

Type

a

8.141949E-4 = product of:
  0.0032567796 = sum of:
    0.0032567796 = product of:
      0.009770338 = sum of:
        0.009770338 = weight(_text_:a in 939) [ClassicSimilarity], result of:
          0.009770338 = score(doc=939,freq=6.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.17652355 = fieldWeight in 939, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0625 = fieldNorm(doc=939)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

Generating summaries that meet the information needs of a user relies on (1) several forms of question decomposition; (2) different summarization approaches; and (3) textual inference for combining the summarization strategies. This novel framework for summarization has the advantage of producing highly responsive summaries, as indicated by the evaluation results.

Type

a

8.141949E-4 = product of:
  0.0032567796 = sum of:
    0.0032567796 = product of:
      0.009770338 = sum of:
        0.009770338 = weight(_text_:a in 947) [ClassicSimilarity], result of:
          0.009770338 = score(doc=947,freq=24.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.17652355 = fieldWeight in 947, product of:
              4.8989797 = tf(freq=24.0), with freq of:
                24.0 = termFreq=24.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.03125 = fieldNorm(doc=947)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

Information retrieval systems consist of many complicated components. Research and development of such systems is often hampered by the difficulty in evaluating how each particular component would behave across multiple systems. We present a novel integrated information retrieval system-the Query, Cluster, Summarize (QCS) system-which is portable, modular, and permits experimentation with different instantiations of each of the constituent text analysis components. Most importantly, the combination of the three types of methods in the QCS design improves retrievals by providing users more focused information organized by topic. We demonstrate the improved performance by a series of experiments using standard test sets from the Document Understanding Conferences (DUC) as measured by the best known automatic metric for summarization system evaluation, ROUGE. Although the DUC data and evaluations were originally designed to test multidocument summarization, we developed a framework to extend it to the task of evaluation for each of the three components: query, clustering, and summarization. Under this framework, we then demonstrate that the QCS system (end-to-end) achieves performance as good as or better than the best summarization engines. Given a query, QCS retrieves relevant documents, separates the retrieved documents into topic clusters, and creates a single summary for each cluster. In the current implementation, Latent Semantic Indexing is used for retrieval, generalized spherical k-means is used for the document clustering, and a method coupling sentence "trimming" and a hidden Markov model, followed by a pivoted QR decomposition, is used to create a single extract summary for each cluster. The user interface is designed to provide access to detailed information in a compact and useful format. Our system demonstrates the feasibility of assembling an effective IR system from existing software libraries, the usefulness of the modularity of the design, and the value of this particular combination of modules.

Type

a

7.883408E-4 = product of:
  0.0031533632 = sum of:
    0.0031533632 = product of:
      0.00946009 = sum of:
        0.00946009 = weight(_text_:a in 2115) [ClassicSimilarity], result of:
          0.00946009 = score(doc=2115,freq=10.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.1709182 = fieldWeight in 2115, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=2115)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

This article proposes a summarization system for multiple documents. It employs not only named entities and other signatures to cluster news from different sources, but also employs punctuation marks, linking elements, and topic chains to identify the meaningful units (MUs). Using nouns and verbs to identify the similar MUs, focusing and browsing models are applied to represent the summarization results. To reduce information loss during summarization, informative words in a document are introduced. For the evaluation, a question answering system (QA system) is proposed to substitute the human assessors. In large-scale experiments containing 140 questions to 17,877 documents, the results show that those models using informative words outperform pure heuristic voting-only strategy by news reporters. This model can be easily further applied to summarize multilingual news from multiple sources.

Type

a

7.883408E-4 = product of:
  0.0031533632 = sum of:
    0.0031533632 = product of:
      0.00946009 = sum of:
        0.00946009 = weight(_text_:a in 899) [ClassicSimilarity], result of:
          0.00946009 = score(doc=899,freq=10.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.1709182 = fieldWeight in 899, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=899)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

The work described here initially formed part of a triangulation exercise to establish the effectiveness of the Query Term Order algorithm. It subsequently proved to be a reliable indicator for summarising English web documents. We utilised the human summaries from the Document Understanding Conference data, and generated queries automatically for testing the QTO algorithm. Six sentence weighting schemes that made use of Query Term Frequency and QTO were constructed to produce system summaries, and this paper explains the process of combining and balancing the weighting components. The summaries produced were evaluated by the ROUGE-1 metric, and the results showed that using QTO in a weighting combination resulted in the best performance. We also found that using a combination of more weighting components always produced improved performance compared to any single weighting component.

Type

a

7.7731453E-4 = product of:
  0.0031092581 = sum of:
    0.0031092581 = product of:
      0.009327774 = sum of:
        0.009327774 = weight(_text_:a in 1719) [ClassicSimilarity], result of:
          0.009327774 = score(doc=1719,freq=14.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.1685276 = fieldWeight in 1719, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1719)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

Many automatic text summarization models have been developed in the last decades. Related research in information science has shown that human abstractors extract sentences for summaries based on the hierarchical structure of documents; however, the existing automatic summarization models do not take into account the human abstractor's behavior of sentence extraction and only consider the document as a sequence of sentences during the process of extraction of sentences as a summary. In general, a document exhibits a well-defined hierarchical structure that can be described as fractals - mathematical objects with a high degree of redundancy. In this article, we introduce the fractal summarization model based on the fractal theory. The important information is captured from the source document by exploring the hierarchical structure and salient features of the document. A condensed version of the document that is informatively close to the source document is produced iteratively using the contractive transformation in the fractal theory. The fractal summarization model is the first attempt to apply fractal theory to document summarization. It significantly improves the divergence of information coverage of summary and the precision of summary. User evaluations have been conducted. Results have indicated that fractal summarization is promising and outperforms current summarization techniques that do not consider the hierarchical structure of documents.

Type

a

7.196534E-4 = product of:
  0.0028786135 = sum of:
    0.0028786135 = product of:
      0.00863584 = sum of:
        0.00863584 = weight(_text_:a in 3120) [ClassicSimilarity], result of:
          0.00863584 = score(doc=3120,freq=12.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.15602624 = fieldWeight in 3120, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3120)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

Sentence ranking is the issue of most concern in document summarization today. While traditional feature-based approaches evaluate sentence significance and rank the sentences relying on the features that are particularly designed to characterize the different aspects of the individual sentences, the newly emerging graph-based ranking algorithms (such as the PageRank-like algorithms) recursively compute sentence significance using the global information in a text graph that links sentences together. In general, the existing PageRank-like algorithms can model well the phenomena that a sentence is important if it is linked by many other important sentences. Or they are capable of modeling the mutual reinforcement among the sentences in the text graph. However, when dealing with multidocument summarization these algorithms often assemble a set of documents into one large file. The document dimension is totally ignored. In this article we present a framework to model the two-level mutual reinforcement among sentences as well as documents. Under this framework we design and develop a novel ranking algorithm such that the document reinforcement is taken into account in the process of sentence ranking. The convergence issue is examined. We also explore an interesting and important property of the proposed algorithm. When evaluated on the DUC 2005 and 2006 query-oriented multidocument summarization datasets, significant results are achieved.

Type

a

7.1242056E-4 = product of:
  0.0028496822 = sum of:
    0.0028496822 = product of:
      0.008549047 = sum of:
        0.008549047 = weight(_text_:a in 2448) [ClassicSimilarity], result of:
          0.008549047 = score(doc=2448,freq=6.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.1544581 = fieldWeight in 2448, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2448)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

In existing unsupervised methods, Latent Semantic Analysis (LSA) is used for sentence selection. However, the obtained results are less meaningful, because singular vectors are used as the bases for sentence selection from given documents, and singular vector components can have negative values. We propose a new unsupervised method using Non-negative Matrix Factorization (NMF) to select sentences for automatic generic document summarization. The proposed method uses non-negative constraints, which are more similar to the human cognition process. As a result, the method selects more meaningful sentences for generic document summarization than those selected using LSA.

Type

a

7.051135E-4 = product of:
  0.002820454 = sum of:
    0.002820454 = product of:
      0.008461362 = sum of:
        0.008461362 = weight(_text_:a in 5662) [ClassicSimilarity], result of:
          0.008461362 = score(doc=5662,freq=2.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.15287387 = fieldWeight in 5662, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.09375 = fieldNorm(doc=5662)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Type

a

6.6478737E-4 = product of:
  0.0026591495 = sum of:
    0.0026591495 = product of:
      0.007977448 = sum of:
        0.007977448 = weight(_text_:a in 934) [ClassicSimilarity], result of:
          0.007977448 = score(doc=934,freq=4.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.14413087 = fieldWeight in 934, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0625 = fieldNorm(doc=934)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

Recent years have seen increased interest in text summarization with emphasis on evaluation of prototype systems. Many factors can affect the design of such evaluations, requiring choices among competing alternatives. This paper examines several major themes running through three evaluations: SUMMAC, NTCIR, and DUC, with a concentration on DUC. The themes are extrinsic and intrinsic evaluation, evaluation procedures and methods, generic versus focused summaries, single- and multi-document summaries, length and compression issues, extracts versus abstracts, and issues with genre.

Type

a

6.569507E-4 = product of:
  0.0026278028 = sum of:
    0.0026278028 = product of:
      0.007883408 = sum of:
        0.007883408 = weight(_text_:a in 955) [ClassicSimilarity], result of:
          0.007883408 = score(doc=955,freq=10.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.14243183 = fieldWeight in 955, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=955)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

Text summarization is a method for data reduction. The use of text summarization enables users to reduce the amount of text that must be read while still assimilating the core information. The data reduction offered by text summarization is particularly useful in the biomedical domain, where physicians must continuously find clinical trial study information to incorporate into their patient treatment efforts. Such efforts are often hampered by the high-volume of publications. This paper presents two independent methods (BioChain and FreqDist) for identifying salient sentences in biomedical texts using concepts derived from domain-specific resources. Our semantic-based method (BioChain) is effective at identifying thematic sentences, while our frequency-distribution method (FreqDist) removes information redundancy. The two methods are then combined to form a hybrid method (ChainFreq). An evaluation of each method is performed using the ROUGE system to compare system-generated summaries against a set of manually-generated summaries. The BioChain and FreqDist methods outperform some common summarization systems, while the ChainFreq method improves upon the base approaches. Our work shows that the best performance is achieved when the two methods are combined. The paper also presents a brief physician's evaluation of three randomly-selected papers from an evaluation corpus to show that the author's abstract does not always reflect the entire contents of the full-text.

Type

a