Search (13 results, page 1 of 1)

0.013989557 = product of:
  0.027979113 = sum of:
    0.016359208 = product of:
      0.06543683 = sum of:
        0.06543683 = weight(_text_:learning in 5290) [ClassicSimilarity], result of:
          0.06543683 = score(doc=5290,freq=6.0), product of:
            0.15317118 = queryWeight, product of:
              4.464877 = idf(docFreq=1382, maxDocs=44218)
              0.0343058 = queryNorm
            0.42721373 = fieldWeight in 5290, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.464877 = idf(docFreq=1382, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5290)
      0.25 = coord(1/4)
    0.011619906 = product of:
      0.023239812 = sum of:
        0.023239812 = weight(_text_:22 in 5290) [ClassicSimilarity], result of:
          0.023239812 = score(doc=5290,freq=2.0), product of:
            0.120133065 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0343058 = 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.5 = coord(2/4)

Abstract

Document keyphrases provide a concise summary of a document's content, offering semantic metadata summarizing a document. They can be used in many applications related to knowledge management and text mining, such as automatic text summarization, development of search engines, document clustering, document classification, thesaurus construction, and browsing interfaces. Because only a small portion of documents have keyphrases assigned by authors, and it is time-consuming and costly to manually assign keyphrases to documents, it is necessary to develop an algorithm to automatically generate keyphrases for documents. This paper describes a Keyphrase Identification Program (KIP), which extracts document keyphrases by using prior positive samples of human identified phrases to assign weights to the candidate keyphrases. The logic of our algorithm is: The more keywords a candidate keyphrase contains and the more significant these keywords are, the more likely this candidate phrase is a keyphrase. KIP's learning function can enrich the glossary database by automatically adding new identified keyphrases to the database. KIP's personalization feature will let the user build a glossary database specifically suitable for the area of his/her interest. The evaluation results show that KIP's performance is better than the systems we compared to and that the learning function is effective.

Date

22. 7.2006 17:25:48

0.010532449 = product of:
  0.021064898 = sum of:
    0.009444992 = product of:
      0.03777997 = sum of:
        0.03777997 = weight(_text_:learning in 1012) [ClassicSimilarity], result of:
          0.03777997 = score(doc=1012,freq=2.0), product of:
            0.15317118 = queryWeight, product of:
              4.464877 = idf(docFreq=1382, maxDocs=44218)
              0.0343058 = queryNorm
            0.24665193 = fieldWeight in 1012, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.464877 = idf(docFreq=1382, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1012)
      0.25 = coord(1/4)
    0.011619906 = product of:
      0.023239812 = sum of:
        0.023239812 = weight(_text_:22 in 1012) [ClassicSimilarity], result of:
          0.023239812 = score(doc=1012,freq=2.0), product of:
            0.120133065 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0343058 = 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.5 = coord(2/4)

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

0.0046479623 = product of:
  0.01859185 = sum of:
    0.01859185 = product of:
      0.0371837 = sum of:
        0.0371837 = weight(_text_:22 in 6599) [ClassicSimilarity], result of:
          0.0371837 = score(doc=6599,freq=2.0), product of:
            0.120133065 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0343058 = 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.25 = coord(1/4)

Date

26. 2.1997 10:22:43

0.0046479623 = product of:
  0.01859185 = sum of:
    0.01859185 = product of:
      0.0371837 = sum of:
        0.0371837 = weight(_text_:22 in 6751) [ClassicSimilarity], result of:
          0.0371837 = score(doc=6751,freq=2.0), product of:
            0.120133065 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0343058 = 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.25 = coord(1/4)

Date

6. 3.1997 16:22:15

0.0046479623 = product of:
  0.01859185 = sum of:
    0.01859185 = product of:
      0.0371837 = sum of:
        0.0371837 = weight(_text_:22 in 6974) [ClassicSimilarity], result of:
          0.0371837 = score(doc=6974,freq=2.0), product of:
            0.120133065 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0343058 = 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(1/4)

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

0.0034859716 = product of:
  0.013943886 = sum of:
    0.013943886 = product of:
      0.027887773 = sum of:
        0.027887773 = weight(_text_:22 in 948) [ClassicSimilarity], result of:
          0.027887773 = score(doc=948,freq=2.0), product of:
            0.120133065 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0343058 = 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.25 = coord(1/4)

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.

0.0033057472 = product of:
  0.013222989 = sum of:
    0.013222989 = product of:
      0.052891955 = sum of:
        0.052891955 = weight(_text_:learning in 6067) [ClassicSimilarity], result of:
          0.052891955 = score(doc=6067,freq=2.0), product of:
            0.15317118 = queryWeight, product of:
              4.464877 = idf(docFreq=1382, maxDocs=44218)
              0.0343058 = queryNorm
            0.3453127 = fieldWeight in 6067, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.464877 = idf(docFreq=1382, maxDocs=44218)
              0.0546875 = fieldNorm(doc=6067)
      0.25 = coord(1/4)
  0.25 = coord(1/4)

Abstract

Der Bedarf nach Summarizing-Leistungen, in Situationen der Fachinformation, aber auch in kommunikativen Umgebungen (Diskursen) wird aufgezeigt. Summarizing wird dazu in den Kontext des bisherigen (auch automatischen) Abstracting/Extracting gestellt. Der aktuelle Forschungsstand, vor allem mit Blick auf Multi-Document-Summarizing, wird dargestellt. Summarizing ist eine wichtige Funktion in komplex und umfänglich werdenden Diskussionen in elektronischen Foren. Dies wird am Beispiel des e-Learning-Systems K3 aufgezeigt. Rudimentäre Summarizing-Funktionen von K3 und des zugeordneten K3VIS-Systems werden dargestellt. Der Rahmen für ein elaborierteres, Template-orientiertes Summarizing unter Verwendung der vielfältigen Auszeichnungsfunktionen von K3 (Rollen, Diskurstypen, Inhaltstypen etc.) wird aufgespannt.

0.0033057472 = product of:
  0.013222989 = sum of:
    0.013222989 = product of:
      0.052891955 = sum of:
        0.052891955 = weight(_text_:learning in 951) [ClassicSimilarity], result of:
          0.052891955 = score(doc=951,freq=2.0), product of:
            0.15317118 = queryWeight, product of:
              4.464877 = idf(docFreq=1382, maxDocs=44218)
              0.0343058 = queryNorm
            0.3453127 = fieldWeight in 951, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.464877 = idf(docFreq=1382, maxDocs=44218)
              0.0546875 = fieldNorm(doc=951)
      0.25 = coord(1/4)
  0.25 = coord(1/4)

Abstract

Keywords can be considered as condensed versions of documents and short forms of their summaries. In this paper, the problem of automatic extraction of keywords from documents is treated as a supervised learning task. A lexical chain holds a set of semantically related words of a text and it can be said that a lexical chain represents the semantic content of a portion of the text. Although lexical chains have been extensively used in text summarization, their usage for keyword extraction problem has not been fully investigated. In this paper, a keyword extraction technique that uses lexical chains is described, and encouraging results are obtained.

0.0033057472 = product of:
  0.013222989 = sum of:
    0.013222989 = product of:
      0.052891955 = sum of:
        0.052891955 = weight(_text_:learning in 954) [ClassicSimilarity], result of:
          0.052891955 = score(doc=954,freq=2.0), product of:
            0.15317118 = queryWeight, product of:
              4.464877 = idf(docFreq=1382, maxDocs=44218)
              0.0343058 = queryNorm
            0.3453127 = fieldWeight in 954, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.464877 = idf(docFreq=1382, maxDocs=44218)
              0.0546875 = fieldNorm(doc=954)
      0.25 = coord(1/4)
  0.25 = coord(1/4)

Abstract

In the field of law there is an absolute need for summarizing the texts of court decisions in order to make the content of the cases easily accessible for legal professionals. During the SALOMON and MOSAIC projects we investigated the summarization and retrieval of legal cases. This article presents some of the main findings while integrating the research results of experiments on legal document summarization by other research groups. In addition, we propose novel avenues of research for automatic text summarization, which we currently exploit when summarizing court decisions in the ACILA project. Techniques for automated concept learning and argument recognition are here the most challenging.

0.0029049765 = product of:
  0.011619906 = sum of:
    0.011619906 = product of:
      0.023239812 = sum of:
        0.023239812 = weight(_text_:22 in 2640) [ClassicSimilarity], result of:
          0.023239812 = score(doc=2640,freq=2.0), product of:
            0.120133065 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0343058 = 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.25 = coord(1/4)

Date

22. 1.2016 12:29:41

0.0029049765 = product of:
  0.011619906 = sum of:
    0.011619906 = product of:
      0.023239812 = sum of:
        0.023239812 = weight(_text_:22 in 889) [ClassicSimilarity], result of:
          0.023239812 = score(doc=889,freq=2.0), product of:
            0.120133065 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0343058 = 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.25 = coord(1/4)

Date

22. 1.2023 18:57:12

0.002361248 = product of:
  0.009444992 = sum of:
    0.009444992 = product of:
      0.03777997 = sum of:
        0.03777997 = weight(_text_:learning in 3459) [ClassicSimilarity], result of:
          0.03777997 = score(doc=3459,freq=2.0), product of:
            0.15317118 = queryWeight, product of:
              4.464877 = idf(docFreq=1382, maxDocs=44218)
              0.0343058 = queryNorm
            0.24665193 = fieldWeight in 3459, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.464877 = idf(docFreq=1382, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3459)
      0.25 = coord(1/4)
  0.25 = coord(1/4)

Abstract

In this article, the authors address the problem of sentence ranking in summarization. Although most existing summarization approaches are concerned with the information embodied in a particular topic (including a set of documents and an associated query) for sentence ranking, they propose a novel ranking approach that incorporates intertopic information mining. Intertopic information, in contrast to intratopic information, is able to reveal pairwise topic relationships and thus can be considered as the bridge across different topics. In this article, the intertopic information is used for transferring word importance learned from known topics to unknown topics under a learning-based summarization framework. To mine this information, the authors model the topic relationship by clustering all the words in both known and unknown topics according to various kinds of word conceptual labels, which indicate the roles of the words in the topic. Based on the mined relationships, we develop a probabilistic model using manually generated summaries provided for known topics to predict ranking scores for sentences in unknown topics. A series of experiments have been conducted on the Document Understanding Conference (DUC) 2006 data set. The evaluation results show that intertopic information is indeed effective for sentence ranking and the resultant summarization system performs comparably well to the best-performing DUC participating systems on the same data set.

0.002361248 = product of:
  0.009444992 = sum of:
    0.009444992 = product of:
      0.03777997 = sum of:
        0.03777997 = weight(_text_:learning in 2693) [ClassicSimilarity], result of:
          0.03777997 = score(doc=2693,freq=2.0), product of:
            0.15317118 = queryWeight, product of:
              4.464877 = idf(docFreq=1382, maxDocs=44218)
              0.0343058 = queryNorm
            0.24665193 = fieldWeight in 2693, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.464877 = idf(docFreq=1382, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2693)
      0.25 = coord(1/4)
  0.25 = coord(1/4)

Abstract

Automatic text summarization has been an active field of research for many years. Several approaches have been proposed, ranging from simple position and word-frequency methods, to learning and graph based algorithms. The advent of human-generated knowledge bases like Wikipedia offer a further possibility in text summarization - they can be used to understand the input text in terms of salient concepts from the knowledge base. In this paper, we study a novel approach that leverages Wikipedia in conjunction with graph-based ranking. Our approach is to first construct a bipartite sentence-concept graph, and then rank the input sentences using iterative updates on this graph. We consider several models for the bipartite graph, and derive convergence properties under each model. Then, we take up personalized and query-focused summarization, where the sentence ranks additionally depend on user interests and queries, respectively. Finally, we present a Wikipedia-based multi-document summarization algorithm. An important feature of the proposed algorithms is that they enable real-time incremental summarization - users can first view an initial summary, and then request additional content if interested. We evaluate the performance of our proposed summarizer using the ROUGE metric, and the results show that leveraging Wikipedia can significantly improve summary quality. We also present results from a user study, which suggests that using incremental summarization can help in better understanding news articles.