-
Craven, T.C.: ¬A computer-aided abstracting tool kit (1993)
0.03
0.029327713 = product of:
0.11731085 = sum of:
0.04720799 = weight(_text_:computer in 6506) [ClassicSimilarity], result of:
0.04720799 = score(doc=6506,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.32301605 = fieldWeight in 6506, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.0625 = fieldNorm(doc=6506)
0.07010286 = weight(_text_:network in 6506) [ClassicSimilarity], result of:
0.07010286 = score(doc=6506,freq=2.0), product of:
0.17809492 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.039991006 = queryNorm
0.3936264 = fieldWeight in 6506, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0625 = fieldNorm(doc=6506)
0.25 = coord(2/8)
- Abstract
- Describes the abstracting assistance features being prototyped in the TEXNET text network management system. Sentence weighting methods include: weithing negatively or positively on the stems in a selected passage; weighting on general lists of cue words, adjusting weights of selected segments; and weighting of occurrence of frequent stems. The user may adjust a number of parameters: the minimum strength of extracts; the threshold for frequent word/stems and the amount sentence weight is to be adjusted for each weighting type
-
Jones, P.A.; Bradbeer, P.V.G.: Discovery of optimal weights in a concept selection system (1996)
0.02
0.017220227 = product of:
0.06888091 = sum of:
0.04720799 = weight(_text_:computer in 6974) [ClassicSimilarity], result of:
0.04720799 = score(doc=6974,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.32301605 = fieldWeight in 6974, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.0625 = fieldNorm(doc=6974)
0.021672918 = product of:
0.043345835 = sum of:
0.043345835 = weight(_text_:22 in 6974) [ClassicSimilarity], result of:
0.043345835 = score(doc=6974,freq=2.0), product of:
0.1400417 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.039991006 = queryNorm
0.30952093 = fieldWeight in 6974, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=6974)
0.5 = coord(1/2)
0.25 = coord(2/8)
- Source
- Information retrieval: new systems and current research. Proceedings of the 16th Research Colloquium of the British Computer Society Information Retrieval Specialist Group, Drymen, Scotland, 22-23 Mar 94. Ed.: R. Leon
-
Marcu, D.: Automatic abstracting and summarization (2009)
0.01
0.014343816 = product of:
0.11475053 = sum of:
0.11475053 = weight(_text_:europe in 3748) [ClassicSimilarity], result of:
0.11475053 = score(doc=3748,freq=2.0), product of:
0.24358861 = queryWeight, product of:
6.091085 = idf(docFreq=271, maxDocs=44218)
0.039991006 = queryNorm
0.4710833 = fieldWeight in 3748, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
6.091085 = idf(docFreq=271, maxDocs=44218)
0.0546875 = fieldNorm(doc=3748)
0.125 = coord(1/8)
- 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.
-
Xu, D.; Cheng, G.; Qu, Y.: Preferences in Wikipedia abstracts : empirical findings and implications for automatic entity summarization (2014)
0.01
0.013301588 = product of:
0.1064127 = sum of:
0.1064127 = weight(_text_:property in 2700) [ClassicSimilarity], result of:
0.1064127 = score(doc=2700,freq=2.0), product of:
0.25336683 = queryWeight, product of:
6.335595 = idf(docFreq=212, maxDocs=44218)
0.039991006 = queryNorm
0.4199946 = fieldWeight in 2700, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
6.335595 = idf(docFreq=212, maxDocs=44218)
0.046875 = fieldNorm(doc=2700)
0.125 = coord(1/8)
- Abstract
- The volume of entity-centric structured data grows rapidly on the Web. The description of an entity, composed of property-value pairs (a.k.a. features), has become very large in many applications. To avoid information overload, efforts have been made to automatically select a limited number of features to be shown to the user based on certain criteria, which is called automatic entity summarization. However, to the best of our knowledge, there is a lack of extensive studies on how humans rank and select features in practice, which can provide empirical support and inspire future research. In this article, we present a large-scale statistical analysis of the descriptions of entities provided by DBpedia and the abstracts of their corresponding Wikipedia articles, to empirically study, along several different dimensions, which kinds of features are preferable when humans summarize. Implications for automatic entity summarization are drawn from the findings.
-
Wei, F.; Li, W.; Lu, Q.; He, Y.: Applying two-level reinforcement ranking in query-oriented multidocument summarization (2009)
0.01
0.011084656 = product of:
0.08867725 = sum of:
0.08867725 = weight(_text_:property in 3120) [ClassicSimilarity], result of:
0.08867725 = score(doc=3120,freq=2.0), product of:
0.25336683 = queryWeight, product of:
6.335595 = idf(docFreq=212, maxDocs=44218)
0.039991006 = queryNorm
0.3499955 = fieldWeight in 3120, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
6.335595 = idf(docFreq=212, maxDocs=44218)
0.0390625 = fieldNorm(doc=3120)
0.125 = coord(1/8)
- 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.
-
McKeown, K.; Robin, J.; Kukich, K.: Generating concise natural language summaries (1995)
0.01
0.010953573 = product of:
0.08762858 = sum of:
0.08762858 = weight(_text_:network in 2932) [ClassicSimilarity], result of:
0.08762858 = score(doc=2932,freq=2.0), product of:
0.17809492 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.039991006 = queryNorm
0.492033 = fieldWeight in 2932, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.078125 = fieldNorm(doc=2932)
0.125 = coord(1/8)
- Abstract
- Description of the problems for summary generation, the applications developed (for basket ball games - STREAK and for telephone network planning activity - PLANDOC), the linguistic constructions that the systems use to convey information concisely and the textual constraints that determine what information gets included
-
Jiang, Y.; Meng, R.; Huang, Y.; Lu, W.; Liu, J.: Generating keyphrases for readers : a controllable keyphrase generation framework (2023)
0.01
0.010762642 = product of:
0.04305057 = sum of:
0.029504994 = weight(_text_:computer in 1012) [ClassicSimilarity], result of:
0.029504994 = score(doc=1012,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.20188503 = fieldWeight in 1012, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.0390625 = fieldNorm(doc=1012)
0.013545574 = product of:
0.027091147 = sum of:
0.027091147 = weight(_text_:22 in 1012) [ClassicSimilarity], result of:
0.027091147 = score(doc=1012,freq=2.0), product of:
0.1400417 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.039991006 = queryNorm
0.19345059 = fieldWeight in 1012, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=1012)
0.5 = coord(1/2)
0.25 = coord(2/8)
- Abstract
- With the wide application of keyphrases in many Information Retrieval (IR) and Natural Language Processing (NLP) tasks, automatic keyphrase prediction has been emerging. However, these statistically important phrases are contributing increasingly less to the related tasks because the end-to-end learning mechanism enables models to learn the important semantic information of the text directly. Similarly, keyphrases are of little help for readers to quickly grasp the paper's main idea because the relationship between the keyphrase and the paper is not explicit to readers. Therefore, we propose to generate keyphrases with specific functions for readers to bridge the semantic gap between them and the information producers, and verify the effectiveness of the keyphrase function for assisting users' comprehension with a user experiment. A controllable keyphrase generation framework (the CKPG) that uses the keyphrase function as a control code to generate categorized keyphrases is proposed and implemented based on Transformer, BART, and T5, respectively. For the Computer Science domain, the Macro-avgs of , , and on the Paper with Code dataset are up to 0.680, 0.535, and 0.558, respectively. Our experimental results indicate the effectiveness of the CKPG models.
- Date
- 22. 6.2023 14:55:20
-
Craven, T.C.: Presentation of repeated phrases in a computer-assisted abstracting tool kit (2001)
0.01
0.010326747 = product of:
0.082613975 = sum of:
0.082613975 = weight(_text_:computer in 3667) [ClassicSimilarity], result of:
0.082613975 = score(doc=3667,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.56527805 = fieldWeight in 3667, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.109375 = fieldNorm(doc=3667)
0.125 = coord(1/8)
-
Moens, M.-F.; Uyttendaele, C.: Automatic text structuring and categorization as a first step in summarizing legal cases (1997)
0.01
0.006572143 = product of:
0.052577145 = sum of:
0.052577145 = weight(_text_:network in 2256) [ClassicSimilarity], result of:
0.052577145 = score(doc=2256,freq=2.0), product of:
0.17809492 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.039991006 = queryNorm
0.29521978 = fieldWeight in 2256, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.046875 = fieldNorm(doc=2256)
0.125 = coord(1/8)
- Abstract
- The SALOMON system automatically summarizes Belgian criminal cases in order to improve access to the large number of existing and future court decisions. SALOMON extracts relevant text units from the case text to form a case summary. Such a case profile facilitates the rapid determination of the relevance of the case or may be employed in text search. In a first important abstracting step SALOMON performs an initial categorization of legal criminal cases and structures the case text into separate legally relevant and irrelevant components. A text grammar represented as a semantic network is used to automatically determine the category of the case and its components. Extracts from the case general data and identifies text portions relevant for further abstracting. Prior knowledge of the text structure and its indicative cues may support automatic abstracting. A text grammar is a promising form for representing the knowledge involved
-
Craven, T.C.: ¬A phrase flipper for the assistance of writers of abstracts and other text (1995)
0.01
0.0059009986 = product of:
0.04720799 = sum of:
0.04720799 = weight(_text_:computer in 4897) [ClassicSimilarity], result of:
0.04720799 = score(doc=4897,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.32301605 = fieldWeight in 4897, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.0625 = fieldNorm(doc=4897)
0.125 = coord(1/8)
- Abstract
- Describes computerized tools for computer assisted abstracting. FlipPhr is a Microsoft Windows application program that rearranges (flips) phrases or other expressions in accordance with rules in a grammar. The flipping may be invoked with a single keystroke from within various Windows application programs that allow cutting and pasting of text. The user may modify the grammar to provide for different kinds of flipping
-
Kim, H.H.; Kim, Y.H.: Video summarization using event-related potential responses to shot boundaries in real-time video watching (2019)
0.01
0.0054767863 = product of:
0.04381429 = sum of:
0.04381429 = weight(_text_:network in 4685) [ClassicSimilarity], result of:
0.04381429 = score(doc=4685,freq=2.0), product of:
0.17809492 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.039991006 = queryNorm
0.2460165 = fieldWeight in 4685, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0390625 = fieldNorm(doc=4685)
0.125 = coord(1/8)
- Abstract
- Our aim was to develop an event-related potential (ERP)-based method to construct a video skim consisting of key shots to bridge the semantic gap between the topic inferred from a whole video and that from its summary. Mayer's cognitive model was examined, wherein the topic integration process of a user evoked by a visual stimulus can be associated with long-latency ERP components. We determined that long-latency ERP components are suitable for measuring a user's neuronal response through a literature review. We hypothesized that N300 is specific to the categorization of all shots regardless of topic relevance, N400 is specific for the semantic mismatching process for topic-irrelevant shots, and P600 is specific for the context updating process for topic-relevant shots. In our experiment, the N400 component led to more negative ERP signals in response to topic-irrelevant shots than to topic-relevant shots and showed a fronto-central scalp pattern. P600 elicited more positive ERP signals for topic-relevant shots than for topic-irrelevant shots and showed a fronto-central scalp pattern. We used discriminant and artificial neural network (ANN) analyses to decode video shot relevance and observed that the ANN produced particularly high success rates: 91.3% from the training set and 100% from the test set.
-
Saggion, H.; Lapalme, G.: Selective analysis for the automatic generation of summaries (2000)
0.01
0.0051633734 = product of:
0.041306987 = sum of:
0.041306987 = weight(_text_:computer in 132) [ClassicSimilarity], result of:
0.041306987 = score(doc=132,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.28263903 = fieldWeight in 132, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.0546875 = fieldNorm(doc=132)
0.125 = coord(1/8)
- 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
-
Craven, T.C.: ¬An experiment in the use of tools for computer-assisted abstracting (1996)
0.00
0.004425749 = product of:
0.035405993 = sum of:
0.035405993 = weight(_text_:computer in 7426) [ClassicSimilarity], result of:
0.035405993 = score(doc=7426,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.24226204 = fieldWeight in 7426, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.046875 = fieldNorm(doc=7426)
0.125 = coord(1/8)
-
Craven, T.C.: Abstracts produced using computer assistance (2000)
0.00
0.004425749 = product of:
0.035405993 = sum of:
0.035405993 = weight(_text_:computer in 4809) [ClassicSimilarity], result of:
0.035405993 = score(doc=4809,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.24226204 = fieldWeight in 4809, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.046875 = fieldNorm(doc=4809)
0.125 = coord(1/8)
-
Abdi, A.; Idris, N.; Alguliev, R.M.; Aliguliyev, R.M.: Automatic summarization assessment through a combination of semantic and syntactic information for intelligent educational systems (2015)
0.00
0.004425749 = product of:
0.035405993 = sum of:
0.035405993 = weight(_text_:computer in 2681) [ClassicSimilarity], result of:
0.035405993 = score(doc=2681,freq=2.0), product of:
0.1461475 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.039991006 = queryNorm
0.24226204 = fieldWeight in 2681, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.046875 = fieldNorm(doc=2681)
0.125 = coord(1/8)
- 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.
-
Goh, A.; Hui, S.C.: TES: a text extraction system (1996)
0.00
0.0027091147 = product of:
0.021672918 = sum of:
0.021672918 = product of:
0.043345835 = sum of:
0.043345835 = weight(_text_:22 in 6599) [ClassicSimilarity], result of:
0.043345835 = score(doc=6599,freq=2.0), product of:
0.1400417 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.039991006 = queryNorm
0.30952093 = fieldWeight in 6599, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=6599)
0.5 = coord(1/2)
0.125 = coord(1/8)
- Date
- 26. 2.1997 10:22:43
-
Robin, J.; McKeown, K.: Empirically designing and evaluating a new revision-based model for summary generation (1996)
0.00
0.0027091147 = product of:
0.021672918 = sum of:
0.021672918 = product of:
0.043345835 = sum of:
0.043345835 = weight(_text_:22 in 6751) [ClassicSimilarity], result of:
0.043345835 = score(doc=6751,freq=2.0), product of:
0.1400417 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.039991006 = queryNorm
0.30952093 = fieldWeight in 6751, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=6751)
0.5 = coord(1/2)
0.125 = coord(1/8)
- Date
- 6. 3.1997 16:22:15
-
Vanderwende, L.; Suzuki, H.; Brockett, J.M.; Nenkova, A.: Beyond SumBasic : task-focused summarization with sentence simplification and lexical expansion (2007)
0.00
0.002031836 = product of:
0.016254688 = sum of:
0.016254688 = product of:
0.032509375 = sum of:
0.032509375 = weight(_text_:22 in 948) [ClassicSimilarity], result of:
0.032509375 = score(doc=948,freq=2.0), product of:
0.1400417 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.039991006 = queryNorm
0.23214069 = fieldWeight in 948, 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=948)
0.5 = coord(1/2)
0.125 = coord(1/8)
- Abstract
- In recent years, there has been increased interest in topic-focused multi-document summarization. In this task, automatic summaries are produced in response to a specific information request, or topic, stated by the user. The system we have designed to accomplish this task comprises four main components: a generic extractive summarization system, a topic-focusing component, sentence simplification, and lexical expansion of topic words. This paper details each of these components, together with experiments designed to quantify their individual contributions. We include an analysis of our results on two large datasets commonly used to evaluate task-focused summarization, the DUC2005 and DUC2006 datasets, using automatic metrics. Additionally, we include an analysis of our results on the DUC2006 task according to human evaluation metrics. In the human evaluation of system summaries compared to human summaries, i.e., the Pyramid method, our system ranked first out of 22 systems in terms of overall mean Pyramid score; and in the human evaluation of summary responsiveness to the topic, our system ranked third out of 35 systems.
-
Reeve, L.H.; Han, H.; Brooks, A.D.: ¬The use of domain-specific concepts in biomedical text summarization (2007)
0.00
0.0018398546 = product of:
0.014718837 = sum of:
0.014718837 = product of:
0.029437674 = sum of:
0.029437674 = weight(_text_:resources in 955) [ClassicSimilarity], result of:
0.029437674 = score(doc=955,freq=2.0), product of:
0.14598069 = queryWeight, product of:
3.650338 = idf(docFreq=3122, maxDocs=44218)
0.039991006 = queryNorm
0.20165458 = fieldWeight in 955, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.650338 = idf(docFreq=3122, maxDocs=44218)
0.0390625 = fieldNorm(doc=955)
0.5 = coord(1/2)
0.125 = coord(1/8)
- 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.
-
Wu, Y.-f.B.; Li, Q.; Bot, R.S.; Chen, X.: Finding nuggets in documents : a machine learning approach (2006)
0.00
0.0016931967 = product of:
0.013545574 = sum of:
0.013545574 = product of:
0.027091147 = sum of:
0.027091147 = weight(_text_:22 in 5290) [ClassicSimilarity], result of:
0.027091147 = score(doc=5290,freq=2.0), product of:
0.1400417 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.039991006 = queryNorm
0.19345059 = fieldWeight in 5290, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=5290)
0.5 = coord(1/2)
0.125 = coord(1/8)
- Date
- 22. 7.2006 17:25:48
