Search (100 results, page 5 of 5)

2.497293E-4 = product of:
  0.0049945856 = sum of:
    0.0049945856 = weight(_text_:in in 899) [ClassicSimilarity], result of:
      0.0049945856 = score(doc=899,freq=4.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.12752387 = fieldWeight in 899, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=899)
  0.05 = coord(1/20)

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.

2.497293E-4 = product of:
  0.0049945856 = sum of:
    0.0049945856 = weight(_text_:in in 953) [ClassicSimilarity], result of:
      0.0049945856 = score(doc=953,freq=4.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.12752387 = fieldWeight in 953, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=953)
  0.05 = coord(1/20)

Abstract

Due to a large variety of noisy information embedded in Web pages, Web-page classification is much more difficult than pure-text classification. In this paper, we propose to improve the Web-page classification performance by removing the noise through summarization techniques. We first give empirical evidence that ideal Web-page summaries generated by human editors can indeed improve the performance of Web-page classification algorithms. We then put forward a new Web-page summarization algorithm based on Web-page layout and evaluate it along with several other state-of-the-art text summarization algorithms on the LookSmart Web directory. Experimental results show that the classification algorithms (NB or SVM) augmented by any summarization approach can achieve an improvement by more than 5.0% as compared to pure-text-based classification algorithms. We further introduce an ensemble method to combine the different summarization algorithms. The ensemble summarization method achieves more than 12.0% improvement over pure-text based methods.

2.35447E-4 = product of:
  0.00470894 = sum of:
    0.00470894 = weight(_text_:in in 2929) [ClassicSimilarity], result of:
      0.00470894 = score(doc=2929,freq=2.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.120230645 = fieldWeight in 2929, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=2929)
  0.05 = coord(1/20)

Abstract

Description of a system that performs domain-independent automatic condensation of news from a large commercial news service encompassing 41 different publications. This system was evaluated against a system that condensed the same articles using only the first portions of the texts (the löead), up to the target length of the summaries. 3 lengths of articles were evaluated for 250 documents by both systems, totalling 1.500 suitability judgements in all. The lead-based summaries outperformed the 'intelligent' summaries significantly, achieving acceptability ratings of over 90%, compared to 74,7%

2.35447E-4 = product of:
  0.00470894 = sum of:
    0.00470894 = weight(_text_:in in 2931) [ClassicSimilarity], result of:
      0.00470894 = score(doc=2931,freq=2.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.120230645 = fieldWeight in 2931, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=2931)
  0.05 = coord(1/20)

Abstract

Automatic summarizing is a research topic whose time has come. The papers illustrate some of the relevant work already under way. Places these papers in their wider context: why research and development on automatic summarizing is timely, what areas of work and ideas it should draw on, how future investigations and experiments can be effectively framed

2.35447E-4 = product of:
  0.00470894 = sum of:
    0.00470894 = weight(_text_:in in 5121) [ClassicSimilarity], result of:
      0.00470894 = score(doc=5121,freq=2.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.120230645 = fieldWeight in 5121, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=5121)
  0.05 = coord(1/20)

Abstract

Reviews 4 software packages designed to provide accurate and indicative summaries of documents by taking the documents and creating distinctive abstracts from them. The products reviewed are: Oracle's ConText; InText's Object Analyzer; Iconovex's AnchorPage; and Software Scientific's Interrogator. Techniques used by the products include: the use of dictionaries of known words and phrases to interpret documents; and heuristic analysis involving weighting all the words in the document solely on their occurrence and position within the document

2.35447E-4 = product of:
  0.00470894 = sum of:
    0.00470894 = weight(_text_:in in 3243) [ClassicSimilarity], result of:
      0.00470894 = score(doc=3243,freq=2.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.120230645 = fieldWeight in 3243, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=3243)
  0.05 = coord(1/20)

Abstract

Develops a cognitive model of expert summarization, using 54 working processes of 6 experts recorded by thinking-alound protocols. It comprises up to 140 working steps. Components of the model are a toolbox of empirically founded strategies, principles of process organization, and interpreted working steps where the interaction of cognitive strategies can be investigated. In the computerized simulation the SimSum (Simulation of Summarizing) system, cognitive strategies are represented by object-oriented agents grouped around dedicated blckboards

2.35447E-4 = product of:
  0.00470894 = sum of:
    0.00470894 = weight(_text_:in in 3532) [ClassicSimilarity], result of:
      0.00470894 = score(doc=3532,freq=2.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.120230645 = fieldWeight in 3532, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=3532)
  0.05 = coord(1/20)

Footnote

[In Chinesisch]

2.35447E-4 = product of:
  0.00470894 = sum of:
    0.00470894 = weight(_text_:in in 4059) [ClassicSimilarity], result of:
      0.00470894 = score(doc=4059,freq=2.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.120230645 = fieldWeight in 4059, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=4059)
  0.05 = coord(1/20)

Abstract

This paper introduces a hybrid method for abstracting Chinese text. It integrates the statistical approach with language understanding. Some linguistics heuristics and segmentation are also incorporated into the abstracting process. The prototype system is of a multipurpose type catering for various users with different reqirements. Initial responses show that the proposed method contributes much to the flexibility and accuracy of the automatic Chinese abstracting system. In practice, the present work provides a path to developing an intelligent Chinese system for automating the information

2.35447E-4 = product of:
  0.00470894 = sum of:
    0.00470894 = weight(_text_:in in 947) [ClassicSimilarity], result of:
      0.00470894 = score(doc=947,freq=8.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.120230645 = fieldWeight in 947, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.03125 = fieldNorm(doc=947)
  0.05 = coord(1/20)

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.

2.0810771E-4 = product of:
  0.004162154 = sum of:
    0.004162154 = weight(_text_:in in 1003) [ClassicSimilarity], result of:
      0.004162154 = score(doc=1003,freq=4.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.10626988 = fieldWeight in 1003, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1003)
  0.05 = coord(1/20)

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.

2.0601612E-4 = product of:
  0.0041203224 = sum of:
    0.0041203224 = weight(_text_:in in 145) [ClassicSimilarity], result of:
      0.0041203224 = score(doc=145,freq=2.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.10520181 = fieldWeight in 145, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0546875 = fieldNorm(doc=145)
  0.05 = coord(1/20)

Abstract

Applies the ideas from the automatic link generation research to automatic text summarisation. Using techniques for inter-document link generation, generates intra-document links between passages of a document. Based on the intra-document linkage pattern of a text, characterises the structure of the text. Applies the knowledge of text structure to do automatic text summarisation by passage extraction. Evaluates a set of 50 summaries generated using these techniques by comparing the to paragraph extracts constructed by humans. The automatic summarisation methods perform well, especially in view of the fact that the summaries generates by 2 humans for the same article are surprisingly dissimilar

2.0601612E-4 = product of:
  0.0041203224 = sum of:
    0.0041203224 = weight(_text_:in in 495) [ClassicSimilarity], result of:
      0.0041203224 = score(doc=495,freq=2.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.10520181 = fieldWeight in 495, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0546875 = fieldNorm(doc=495)
  0.05 = coord(1/20)

Abstract

The SALOMON project summarises Belgian criminal cases in order to improve access to the large number of existing and future cases. A double methodology was used when developing SALOMON: the cases are processed by employing additional knowledge to interpret structural patterns and features on the one hand and by way of occurrence statistics of index terms on the other. SALOMON performs an initial categorisation and structuring of the cases and subsequently extracts the most relevant text units of the alleged offences and of the opinion of the court. The SALOMON techniques do not themselves solve any legal questions, but they do guide the use effectively towards relevant texts

2.0601612E-4 = product of:
  0.0041203224 = sum of:
    0.0041203224 = weight(_text_:in in 2448) [ClassicSimilarity], result of:
      0.0041203224 = score(doc=2448,freq=2.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.10520181 = fieldWeight in 2448, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2448)
  0.05 = coord(1/20)

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.

1.7658525E-4 = product of:
  0.003531705 = sum of:
    0.003531705 = weight(_text_:in in 2349) [ClassicSimilarity], result of:
      0.003531705 = score(doc=2349,freq=2.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.09017298 = fieldWeight in 2349, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=2349)
  0.05 = coord(1/20)

Abstract

Summarization entails analysis of source material, selection of key information, condensation of this, and generation of a compct summary form. While there habe been many investigations into the automatic summarization of text, relatively little attention has been given to the summarization of information from structured information sources such as data of knowledge bases, despite this being a desirable capability for a number of application areas including report generation from databases (e.g. weather, financial, medical) and simulation (e.g. military, manufacturing, aconomic). After a brief introduction indicating the main elements of summarization and referring to some illustrative approaches to it, considers pecific issues in the generation of text summaries of event data, describes a system, SumGen, which selects key information from an event database by reasoning about event frequencies, frequencies of relations between events, and domain specific importance measures. Describes how Sum Gen then aggregates similar information and plans a summary presentations tailored to stereotypical users

1.7658525E-4 = product of:
  0.003531705 = sum of:
    0.003531705 = weight(_text_:in in 942) [ClassicSimilarity], result of:
      0.003531705 = score(doc=942,freq=2.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.09017298 = fieldWeight in 942, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=942)
  0.05 = coord(1/20)

Abstract

The high quality evaluation of generated summaries is needed if we are to improve automatic summarization systems. Although human evaluation provides better results than automatic evaluation methods, its cost is huge and it is difficult to reproduce the results. Therefore, we need an automatic method that simulates human evaluation if we are to improve our summarization system efficiently. Although automatic evaluation methods have been proposed, they are unreliable when used for individual summaries. To solve this problem, we propose a supervised automatic evaluation method based on a new regression model called the voted regression model (VRM). VRM has two characteristics: (1) model selection based on 'corrected AIC' to avoid multicollinearity, (2) voting by the selected models to alleviate the problem of overfitting. Evaluation results obtained for TSC3 and DUC2004 show that our method achieved error reductions of about 17-51% compared with conventional automatic evaluation methods. Moreover, our method obtained the highest correlation coefficients in several different experiments.

1.7658525E-4 = product of:
  0.003531705 = sum of:
    0.003531705 = weight(_text_:in in 2681) [ClassicSimilarity], result of:
      0.003531705 = score(doc=2681,freq=2.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.09017298 = fieldWeight in 2681, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=2681)
  0.05 = coord(1/20)

Abstract

Summary writing is a process for creating a short version of a source text. It can be used as a measure of understanding. As grading students' summaries is a very time-consuming task, computer-assisted assessment can help teachers perform the grading more effectively. Several techniques, such as BLEU, ROUGE, N-gram co-occurrence, Latent Semantic Analysis (LSA), LSA_Ngram and LSA_ERB, have been proposed to support the automatic assessment of students' summaries. Since these techniques are more suitable for long texts, their performance is not satisfactory for the evaluation of short summaries. This paper proposes a specialized method that works well in assessing short summaries. Our proposed method integrates the semantic relations between words, and their syntactic composition. As a result, the proposed method is able to obtain high accuracy and improve the performance compared with the current techniques. Experiments have displayed that it is to be preferred over the existing techniques. A summary evaluation system based on the proposed method has also been developed.

1.6648618E-4 = product of:
  0.0033297236 = sum of:
    0.0033297236 = weight(_text_:in in 2683) [ClassicSimilarity], result of:
      0.0033297236 = score(doc=2683,freq=4.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.08501591 = fieldWeight in 2683, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.03125 = fieldNorm(doc=2683)
  0.05 = coord(1/20)

Abstract

Video summarization aims at producing a compact version of a full-length video while preserving the significant content of the original video. Movie summarization condenses a full-length movie into a summary that still retains the most significant and interesting content of the original movie. In the past, several movie summarization systems have been proposed to generate a movie summary based on low-level video features such as color, motion, texture, etc. However, a generic summary, which is common to everyone and is produced based only on low-level video features will not satisfy every user. As users' preferences for the summary differ vastly for the same movie, there is a need for a personalized movie summarization system nowadays. To address this demand, this paper proposes a novel system to generate semantically meaningful video summaries for the same movie, which are tailored to the preferences and interests of a user. For a given movie, shots and scenes are automatically detected and their high-level features are semi-automatically annotated. Preferences over high-level movie features are explicitly collected from the user using a query interface. The user preferences are generated by means of a stored-query. Movie summaries are generated at shot level and scene level, where shots or scenes are selected for summary skim based on the similarity measured between shots and scenes, and the user's preferences. The proposed movie summarization system is evaluated subjectively using a sample of 20 subjects with eight movies in the English language. The quality of the generated summaries is assessed by informativeness, enjoyability, relevance, and acceptance metrics and Quality of Perception measures. Further, the usability of the proposed summarization system is subjectively evaluated by conducting a questionnaire survey. The experimental results on the performance of the proposed movie summarization approach show the potential of the proposed system.

1.4715438E-4 = product of:
  0.0029430876 = sum of:
    0.0029430876 = weight(_text_:in in 6601) [ClassicSimilarity], result of:
      0.0029430876 = score(doc=6601,freq=2.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.07514416 = fieldWeight in 6601, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6601)
  0.05 = coord(1/20)

Abstract

Describes the design and implementation of a text extraction tool, NEWS_EXT, which aztomatically produces summaries from news reports by extracting sentences to form indicative abstracts. Selection of sentences is based on sentence importance, measured by means of sentence scoring or simple linguistic analysis of sentence structure. Tests were conducted on 4 approaches for the functioning of the NEWS_EXT system; extraction by keyword frequency; extraction by title keywords; extraction by location; and extraction by indicative phrase. Reports results of a study to compare the results of the application of NEWS_EXT with manually produced extracts; using relevance as the criterion for effectiveness. 48 newspaper articles were assessed (The Straits Times, International Herald Tribune, Asian Wall Street Journal, and Financial Times). The evaluation was conducted in 2 stages: stage 1 involving abstracts produced manually by 2 human experts; stage 2 involving the generation of abstracts using NEWS_EXT. Results of each of the 4 approaches were compared with the human produced abstracts, where the title and location approaches were found to give the best results for both local and foreign news. Reports plans to refine and enhance NEWS_EXT and incorporate it as a module within a larger newspaper clipping system

1.4715438E-4 = product of:
  0.0029430876 = sum of:
    0.0029430876 = weight(_text_:in in 2685) [ClassicSimilarity], result of:
      0.0029430876 = score(doc=2685,freq=2.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.07514416 = fieldWeight in 2685, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2685)
  0.05 = coord(1/20)

Abstract

Automatic document summarization using citations is based on summarizing what others explicitly say about the document, by extracting a summary from text around the citations (citances). While this technique works quite well for summarizing the impact of scientific articles, other genres of documents as well as other types of summaries require different approaches. In this paper, we introduce a new family of methods that we developed for legal documents summarization to generate catchphrases for legal cases (where catchphrases are a form of legal summary). Our methods use both incoming and outgoing citations, and we show how citances can be combined with other elements of cited and citing documents, including the full text of the target document, and catchphrases of cited and citing cases. On a legal summarization corpus, our methods outperform competitive baselines. The combination of full text sentences and catchphrases from cited and citing cases is particularly successful. We also apply and evaluate the methods on scientific paper summarization, where they perform at the level of state-of-the-art techniques. Our family of citation-based summarization methods is powerful and flexible enough to target successfully a range of different domains and summarization tasks.

1.4715438E-4 = product of:
  0.0029430876 = sum of:
    0.0029430876 = weight(_text_:in in 5358) [ClassicSimilarity], result of:
      0.0029430876 = score(doc=5358,freq=2.0), product of:
        0.039165888 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02879306 = queryNorm
        0.07514416 = fieldWeight in 5358, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5358)
  0.05 = coord(1/20)

Footnote

Beitrag in einem 'Special issue on neuro-information science'.