-
Jones, P.A.; Bradbeer, P.V.G.: Discovery of optimal weights in a concept selection system (1996)
0.11
0.113588974 = product of:
0.17038345 = sum of:
0.14345708 = weight(_text_:systematic in 6974) [ClassicSimilarity], result of:
0.14345708 = score(doc=6974,freq=2.0), product of:
0.28397155 = queryWeight, product of:
5.715473 = idf(docFreq=395, maxDocs=44218)
0.049684696 = queryNorm
0.5051812 = fieldWeight in 6974, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.715473 = idf(docFreq=395, maxDocs=44218)
0.0625 = fieldNorm(doc=6974)
0.026926363 = product of:
0.053852726 = sum of:
0.053852726 = weight(_text_:22 in 6974) [ClassicSimilarity], result of:
0.053852726 = score(doc=6974,freq=2.0), product of:
0.17398734 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049684696 = 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.6666667 = coord(2/3)
- Abstract
- Describes the application of weighting strategies to model uncertainties and probabilities in automatic abstracting systems, particularly in the concept selection phase. The weights were originally assigned in an ad hoc manner and were then refined by manual analysis of the results. The new method attempts to derive a more systematic methods and performs this using a genetic algorithm
- 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
-
Moens, M.F.: Automatic indexing and abstracting of document texts (2000)
0.02
0.018958557 = product of:
0.05687567 = sum of:
0.05687567 = product of:
0.11375134 = sum of:
0.11375134 = weight(_text_:indexing in 6892) [ClassicSimilarity], result of:
0.11375134 = score(doc=6892,freq=4.0), product of:
0.19018644 = queryWeight, product of:
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.049684696 = queryNorm
0.59810436 = fieldWeight in 6892, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.078125 = fieldNorm(doc=6892)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Content
- Need for indexing and abstracting texts; attributes of texts; text representations and their use; selection of natural language index terms; assignment of controlled language index texts; automatic abstracting; applications
-
Yusuff, A.: Automatisches Indexing and Abstracting : Grundlagen und Beispiele (2002)
0.02
0.018768014 = product of:
0.05630404 = sum of:
0.05630404 = product of:
0.11260808 = sum of:
0.11260808 = weight(_text_:indexing in 1577) [ClassicSimilarity], result of:
0.11260808 = score(doc=1577,freq=2.0), product of:
0.19018644 = queryWeight, product of:
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.049684696 = queryNorm
0.5920931 = fieldWeight in 1577, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.109375 = fieldNorm(doc=1577)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
-
Goh, A.; Hui, S.C.: TES: a text extraction system (1996)
0.01
0.008975455 = product of:
0.026926363 = sum of:
0.026926363 = product of:
0.053852726 = sum of:
0.053852726 = weight(_text_:22 in 6599) [ClassicSimilarity], result of:
0.053852726 = score(doc=6599,freq=2.0), product of:
0.17398734 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049684696 = 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.33333334 = coord(1/3)
- 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.01
0.008975455 = product of:
0.026926363 = sum of:
0.026926363 = product of:
0.053852726 = sum of:
0.053852726 = weight(_text_:22 in 6751) [ClassicSimilarity], result of:
0.053852726 = score(doc=6751,freq=2.0), product of:
0.17398734 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049684696 = 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.33333334 = coord(1/3)
- Date
- 6. 3.1997 16:22:15
-
Moens, M.-F.; Uyttendaele, C.; Dumotier, J.: Abstracting of legal cases : the potential of clustering based on the selection of representative objects (1999)
0.01
0.0080434345 = product of:
0.024130303 = sum of:
0.024130303 = product of:
0.048260607 = sum of:
0.048260607 = weight(_text_:indexing in 2944) [ClassicSimilarity], result of:
0.048260607 = score(doc=2944,freq=2.0), product of:
0.19018644 = queryWeight, product of:
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.049684696 = queryNorm
0.2537542 = fieldWeight in 2944, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.046875 = fieldNorm(doc=2944)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- The SALOMON project automatically summarizes Belgian criminal cases in order to improve access to the large number of existing and future court decisions. SALOMON extracts text units from the case text to form a case summary. Such a case summary facilitates the rapid determination of the relevance of the case or may be employed in text search. an important part of the research concerns the development of techniques for automatic recognition of representative text paragraphs (or sentences) in texts of unrestricted domains. these techniques are employed to eliminate redundant material in the case texts, and to identify informative text paragraphs which are relevant to include in the case summary. An evaluation of a test set of 700 criminal cases demonstrates that the algorithms have an application potential for automatic indexing, abstracting, and text linkage
-
Vanderwende, L.; Suzuki, H.; Brockett, J.M.; Nenkova, A.: Beyond SumBasic : task-focused summarization with sentence simplification and lexical expansion (2007)
0.01
0.0067315903 = product of:
0.02019477 = sum of:
0.02019477 = product of:
0.04038954 = sum of:
0.04038954 = weight(_text_:22 in 948) [ClassicSimilarity], result of:
0.04038954 = score(doc=948,freq=2.0), product of:
0.17398734 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049684696 = 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.33333334 = coord(1/3)
- 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.
-
Yeh, J.-Y.; Ke, H.-R.; Yang, W.-P.; Meng, I.-H.: Text summarization using a trainable summarizer and latent semantic analysis (2005)
0.01
0.0067028617 = product of:
0.020108584 = sum of:
0.020108584 = product of:
0.04021717 = sum of:
0.04021717 = weight(_text_:indexing in 1003) [ClassicSimilarity], result of:
0.04021717 = score(doc=1003,freq=2.0), product of:
0.19018644 = queryWeight, product of:
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.049684696 = queryNorm
0.21146181 = fieldWeight in 1003, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.0390625 = fieldNorm(doc=1003)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Object
- Latent Semantic Indexing
-
Wang, S.; Koopman, R.: Embed first, then predict (2019)
0.01
0.0067028617 = product of:
0.020108584 = sum of:
0.020108584 = product of:
0.04021717 = sum of:
0.04021717 = weight(_text_:indexing in 5400) [ClassicSimilarity], result of:
0.04021717 = score(doc=5400,freq=2.0), product of:
0.19018644 = queryWeight, product of:
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.049684696 = queryNorm
0.21146181 = fieldWeight in 5400, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.0390625 = fieldNorm(doc=5400)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- Automatic subject prediction is a desirable feature for modern digital library systems, as manual indexing can no longer cope with the rapid growth of digital collections. It is also desirable to be able to identify a small set of entities (e.g., authors, citations, bibliographic records) which are most relevant to a query. This gets more difficult when the amount of data increases dramatically. Data sparsity and model scalability are the major challenges to solving this type of extreme multilabel classification problem automatically. In this paper, we propose to address this problem in two steps: we first embed different types of entities into the same semantic space, where similarity could be computed easily; second, we propose a novel non-parametric method to identify the most relevant entities in addition to direct semantic similarities. We show how effectively this approach predicts even very specialised subjects, which are associated with few documents in the training set and are more problematic for a classifier.
-
Wu, Y.-f.B.; Li, Q.; Bot, R.S.; Chen, X.: Finding nuggets in documents : a machine learning approach (2006)
0.01
0.005609659 = product of:
0.016828977 = sum of:
0.016828977 = product of:
0.033657953 = sum of:
0.033657953 = weight(_text_:22 in 5290) [ClassicSimilarity], result of:
0.033657953 = score(doc=5290,freq=2.0), product of:
0.17398734 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049684696 = 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.33333334 = coord(1/3)
- Date
- 22. 7.2006 17:25:48
-
Kim, H.H.; Kim, Y.H.: Generic speech summarization of transcribed lecture videos : using tags and their semantic relations (2016)
0.01
0.005609659 = product of:
0.016828977 = sum of:
0.016828977 = product of:
0.033657953 = sum of:
0.033657953 = weight(_text_:22 in 2640) [ClassicSimilarity], result of:
0.033657953 = score(doc=2640,freq=2.0), product of:
0.17398734 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049684696 = queryNorm
0.19345059 = fieldWeight in 2640, 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=2640)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Date
- 22. 1.2016 12:29:41
-
Oh, H.; Nam, S.; Zhu, Y.: Structured abstract summarization of scientific articles : summarization using full-text section information (2023)
0.01
0.005609659 = product of:
0.016828977 = sum of:
0.016828977 = product of:
0.033657953 = sum of:
0.033657953 = weight(_text_:22 in 889) [ClassicSimilarity], result of:
0.033657953 = score(doc=889,freq=2.0), product of:
0.17398734 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049684696 = queryNorm
0.19345059 = fieldWeight in 889, 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=889)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Date
- 22. 1.2023 18:57:12
-
Jiang, Y.; Meng, R.; Huang, Y.; Lu, W.; Liu, J.: Generating keyphrases for readers : a controllable keyphrase generation framework (2023)
0.01
0.005609659 = product of:
0.016828977 = sum of:
0.016828977 = product of:
0.033657953 = sum of:
0.033657953 = weight(_text_:22 in 1012) [ClassicSimilarity], result of:
0.033657953 = score(doc=1012,freq=2.0), product of:
0.17398734 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.049684696 = 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.33333334 = coord(1/3)
- Date
- 22. 6.2023 14:55:20
-
Dunlavy, D.M.; O'Leary, D.P.; Conroy, J.M.; Schlesinger, J.D.: QCS: A system for querying, clustering and summarizing documents (2007)
0.01
0.00536229 = product of:
0.016086869 = sum of:
0.016086869 = product of:
0.032173738 = sum of:
0.032173738 = weight(_text_:indexing in 947) [ClassicSimilarity], result of:
0.032173738 = score(doc=947,freq=2.0), product of:
0.19018644 = queryWeight, product of:
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.049684696 = queryNorm
0.16916946 = fieldWeight in 947, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.03125 = fieldNorm(doc=947)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- 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.
