Search (103 results, page 1 of 6)

  • × theme_ss:"Automatisches Abstracting"
  1. Jiang, Y.; Meng, R.; Huang, Y.; Lu, W.; Liu, J.: Generating keyphrases for readers : a controllable keyphrase generation framework (2023) 0.05 
    0.04602302 = product of:
  0.069034524 = sum of:
    0.005338771 = weight(_text_:in in 1012) [ClassicSimilarity], result of:
      0.005338771 = score(doc=1012,freq=2.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.07514416 = fieldWeight in 1012, 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=1012)
    0.06369575 = sum of:
      0.028313057 = weight(_text_:science in 1012) [ClassicSimilarity], result of:
        0.028313057 = score(doc=1012,freq=4.0), product of:
          0.1375819 = queryWeight, product of:
            2.6341193 = idf(docFreq=8627, maxDocs=44218)
            0.052230705 = queryNorm
          0.20579056 = fieldWeight in 1012, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            2.6341193 = idf(docFreq=8627, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1012)
      0.035382695 = weight(_text_:22 in 1012) [ClassicSimilarity], result of:
        0.035382695 = score(doc=1012,freq=2.0), product of:
          0.18290302 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052230705 = 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.6666667 = coord(2/3)
    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
    Source
    Journal of the Association for Information Science and Technology. 74(2023) no.7, S.759-774
  2. Wu, Y.-f.B.; Li, Q.; Bot, R.S.; Chen, X.: Finding nuggets in documents : a machine learning approach (2006) 0.04 
    0.041968808 = product of:
  0.06295321 = sum of:
    0.007550162 = weight(_text_:in in 5290) [ClassicSimilarity], result of:
      0.007550162 = score(doc=5290,freq=4.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.10626988 = fieldWeight in 5290, 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=5290)
    0.05540305 = sum of:
      0.020020355 = weight(_text_:science in 5290) [ClassicSimilarity], result of:
        0.020020355 = score(doc=5290,freq=2.0), product of:
          0.1375819 = queryWeight, product of:
            2.6341193 = idf(docFreq=8627, maxDocs=44218)
            0.052230705 = queryNorm
          0.1455159 = fieldWeight in 5290, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            2.6341193 = idf(docFreq=8627, maxDocs=44218)
            0.0390625 = fieldNorm(doc=5290)
      0.035382695 = weight(_text_:22 in 5290) [ClassicSimilarity], result of:
        0.035382695 = score(doc=5290,freq=2.0), product of:
          0.18290302 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052230705 = 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.6666667 = coord(2/3)
    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
    Source
    Journal of the American Society for Information Science and Technology. 57(2006) no.6, S.740-752
  3. Kim, H.H.; Kim, Y.H.: Generic speech summarization of transcribed lecture videos : using tags and their semantic relations (2016) 0.04 
    0.041968808 = product of:
  0.06295321 = sum of:
    0.007550162 = weight(_text_:in in 2640) [ClassicSimilarity], result of:
      0.007550162 = score(doc=2640,freq=4.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.10626988 = fieldWeight in 2640, 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=2640)
    0.05540305 = sum of:
      0.020020355 = weight(_text_:science in 2640) [ClassicSimilarity], result of:
        0.020020355 = score(doc=2640,freq=2.0), product of:
          0.1375819 = queryWeight, product of:
            2.6341193 = idf(docFreq=8627, maxDocs=44218)
            0.052230705 = queryNorm
          0.1455159 = fieldWeight in 2640, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            2.6341193 = idf(docFreq=8627, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2640)
      0.035382695 = weight(_text_:22 in 2640) [ClassicSimilarity], result of:
        0.035382695 = score(doc=2640,freq=2.0), product of:
          0.18290302 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052230705 = 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.6666667 = coord(2/3)
    Abstract
    We propose a tag-based framework that simulates human abstractors' ability to select significant sentences based on key concepts in a sentence as well as the semantic relations between key concepts to create generic summaries of transcribed lecture videos. The proposed extractive summarization method uses tags (viewer- and author-assigned terms) as key concepts. Our method employs Flickr tag clusters and WordNet synonyms to expand tags and detect the semantic relations between tags. This method helps select sentences that have a greater number of semantically related key concepts. To investigate the effectiveness and uniqueness of the proposed method, we compare it with an existing technique, latent semantic analysis (LSA), using intrinsic and extrinsic evaluations. The results of intrinsic evaluation show that the tag-based method is as or more effective than the LSA method. We also observe that in the extrinsic evaluation, the grand mean accuracy score of the tag-based method is higher than that of the LSA method, with a statistically significant difference. Elaborating on our results, we discuss the theoretical and practical implications of our findings for speech video summarization and retrieval.
    Date
    22. 1.2016 12:29:41
    Source
    Journal of the Association for Information Science and Technology. 67(2016) no.2, S.366-379
  4. Oh, H.; Nam, S.; Zhu, Y.: Structured abstract summarization of scientific articles : summarization using full-text section information (2023) 0.04 
    0.041968808 = product of:
  0.06295321 = sum of:
    0.007550162 = weight(_text_:in in 889) [ClassicSimilarity], result of:
      0.007550162 = score(doc=889,freq=4.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.10626988 = fieldWeight in 889, 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=889)
    0.05540305 = sum of:
      0.020020355 = weight(_text_:science in 889) [ClassicSimilarity], result of:
        0.020020355 = score(doc=889,freq=2.0), product of:
          0.1375819 = queryWeight, product of:
            2.6341193 = idf(docFreq=8627, maxDocs=44218)
            0.052230705 = queryNorm
          0.1455159 = fieldWeight in 889, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            2.6341193 = idf(docFreq=8627, maxDocs=44218)
            0.0390625 = fieldNorm(doc=889)
      0.035382695 = weight(_text_:22 in 889) [ClassicSimilarity], result of:
        0.035382695 = score(doc=889,freq=2.0), product of:
          0.18290302 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.052230705 = 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.6666667 = coord(2/3)
    Abstract
    The automatic summarization of scientific articles differs from other text genres because of the structured format and longer text length. Previous approaches have focused on tackling the lengthy nature of scientific articles, aiming to improve the computational efficiency of summarizing long text using a flat, unstructured abstract. However, the structured format of scientific articles and characteristics of each section have not been fully explored, despite their importance. The lack of a sufficient investigation and discussion of various characteristics for each section and their influence on summarization results has hindered the practical use of automatic summarization for scientific articles. To provide a balanced abstract proportionally emphasizing each section of a scientific article, the community introduced the structured abstract, an abstract with distinct, labeled sections. Using this information, in this study, we aim to understand tasks ranging from data preparation to model evaluation from diverse viewpoints. Specifically, we provide a preprocessed large-scale dataset and propose a summarization method applying the introduction, methods, results, and discussion (IMRaD) format reflecting the characteristics of each section. We also discuss the objective benchmarks and perspectives of state-of-the-art algorithms and present the challenges and research directions in this area.
    Date
    22. 1.2023 18:57:12
    Source
    Journal of the Association for Information Science and Technology. 74(2023) no.2, S.234-248
  5. Jones, P.A.; Bradbeer, P.V.G.: Discovery of optimal weights in a concept selection system (1996) 0.03 
    0.03026015 = product of:
  0.045390222 = sum of:
    0.017084066 = weight(_text_:in in 6974) [ClassicSimilarity], result of:
      0.017084066 = score(doc=6974,freq=8.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.24046129 = fieldWeight in 6974, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=6974)
    0.028306156 = product of:
      0.056612313 = sum of:
        0.056612313 = weight(_text_:22 in 6974) [ClassicSimilarity], result of:
          0.056612313 = score(doc=6974,freq=2.0), product of:
            0.18290302 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052230705 = 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
  6. Vanderwende, L.; Suzuki, H.; Brockett, J.M.; Nenkova, A.: Beyond SumBasic : task-focused summarization with sentence simplification and lexical expansion (2007) 0.03 
    0.025453126 = product of:
  0.03817969 = sum of:
    0.016950073 = weight(_text_:in in 948) [ClassicSimilarity], result of:
      0.016950073 = score(doc=948,freq=14.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.23857531 = fieldWeight in 948, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=948)
    0.021229617 = product of:
      0.042459235 = sum of:
        0.042459235 = weight(_text_:22 in 948) [ClassicSimilarity], result of:
          0.042459235 = score(doc=948,freq=2.0), product of:
            0.18290302 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052230705 = 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.6666667 = coord(2/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.
  7. Robin, J.; McKeown, K.: Empirically designing and evaluating a new revision-based model for summary generation (1996) 0.02 
    0.024565458 = product of:
  0.036848187 = sum of:
    0.008542033 = weight(_text_:in in 6751) [ClassicSimilarity], result of:
      0.008542033 = score(doc=6751,freq=2.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.120230645 = fieldWeight in 6751, 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=6751)
    0.028306156 = product of:
      0.056612313 = sum of:
        0.056612313 = weight(_text_:22 in 6751) [ClassicSimilarity], result of:
          0.056612313 = score(doc=6751,freq=2.0), product of:
            0.18290302 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052230705 = 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.6666667 = coord(2/3)
    Abstract
    Presents a system for summarizing quantitative data in natural language, focusing on the use of a corpus of basketball game summaries, drawn from online news services, to empirically shape the system design and to evaluate the approach. Initial corpus analysis revealed characteristics of textual summaries that challenge the capabilities of current language generation systems. A revision based corpus analysis was used to identify and encode the revision rules of the system. Presents a quantitative evaluation, using several test corpora, to measure the robustness of the new revision based model
    Date
    6. 3.1997 16:22:15
  8. Salton, G.; Allan, J.; Buckley, C.; Singhal, A.: Automatic analysis, theme generation, and summarization of machine readable texts (1994) 0.02 
    0.023413785 = product of:
  0.035120677 = sum of:
    0.015100324 = weight(_text_:in in 1949) [ClassicSimilarity], result of:
      0.015100324 = score(doc=1949,freq=4.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.21253976 = fieldWeight in 1949, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.078125 = fieldNorm(doc=1949)
    0.020020355 = product of:
      0.04004071 = sum of:
        0.04004071 = weight(_text_:science in 1949) [ClassicSimilarity], result of:
          0.04004071 = score(doc=1949,freq=2.0), product of:
            0.1375819 = queryWeight, product of:
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.052230705 = queryNorm
            0.2910318 = fieldWeight in 1949, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.078125 = fieldNorm(doc=1949)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Footnote
    Wiederabgedruckt in: Readings in information retrieval. Ed.: K. Sparck Jones u. P. Willett. San Francisco: Morgan Kaufmann 1997. S.478-483.
    Source
    Science. 264(1994), S.1421-1426
  9. Xiong, S.; Ji, D.: Query-focused multi-document summarization using hypergraph-based ranking (2016) 0.02 
    0.019308537 = product of:
  0.028962806 = sum of:
    0.014948557 = weight(_text_:in in 2972) [ClassicSimilarity], result of:
      0.014948557 = score(doc=2972,freq=8.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.21040362 = fieldWeight in 2972, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2972)
    0.014014249 = product of:
      0.028028497 = sum of:
        0.028028497 = weight(_text_:science in 2972) [ClassicSimilarity], result of:
          0.028028497 = score(doc=2972,freq=2.0), product of:
            0.1375819 = queryWeight, product of:
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.052230705 = queryNorm
            0.20372227 = fieldWeight in 2972, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2972)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    General graph random walk has been successfully applied in multi-document summarization, but it has some limitations to process documents by this way. In this paper, we propose a novel hypergraph based vertex-reinforced random walk framework for multi-document summarization. The framework first exploits the Hierarchical Dirichlet Process (HDP) topic model to learn a word-topic probability distribution in sentences. Then the hypergraph is used to capture both cluster relationship based on the word-topic probability distribution and pairwise similarity among sentences. Finally, a time-variant random walk algorithm for hypergraphs is developed to rank sentences which ensures sentence diversity by vertex-reinforcement in summaries. Experimental results on the public available dataset demonstrate the effectiveness of our framework.
    Content
    Vgl.: http://www.sciencedirect.com/science/article/pii/S0306457315001491.
  10. Craven, T.C.: ¬A computer-aided abstracting tool kit (1993) 0.02 
    0.01873103 = product of:
  0.028096544 = sum of:
    0.01208026 = weight(_text_:in in 6506) [ClassicSimilarity], result of:
      0.01208026 = score(doc=6506,freq=4.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.17003182 = fieldWeight in 6506, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=6506)
    0.016016284 = product of:
      0.032032568 = sum of:
        0.032032568 = weight(_text_:science in 6506) [ClassicSimilarity], result of:
          0.032032568 = score(doc=6506,freq=2.0), product of:
            0.1375819 = queryWeight, product of:
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.052230705 = queryNorm
            0.23282544 = fieldWeight in 6506, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.0625 = fieldNorm(doc=6506)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    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
    Source
    Canadian journal of information and library science. 18(1993) no.2, S.20-31
  11. Craven, T.C.: ¬A phrase flipper for the assistance of writers of abstracts and other text (1995) 0.02 
    0.01873103 = product of:
  0.028096544 = sum of:
    0.01208026 = weight(_text_:in in 4897) [ClassicSimilarity], result of:
      0.01208026 = score(doc=4897,freq=4.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.17003182 = fieldWeight in 4897, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=4897)
    0.016016284 = product of:
      0.032032568 = sum of:
        0.032032568 = weight(_text_:science in 4897) [ClassicSimilarity], result of:
          0.032032568 = score(doc=4897,freq=2.0), product of:
            0.1375819 = queryWeight, product of:
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.052230705 = queryNorm
            0.23282544 = fieldWeight in 4897, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.0625 = fieldNorm(doc=4897)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    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
    Source
    Canadian journal of information and library science. 20(1995) nos.3/4, S.41-49
  12. Martinez-Romo, J.; Araujo, L.; Fernandez, A.D.: SemGraph : extracting keyphrases following a novel semantic graph-based approach (2016) 0.02 
    0.018469956 = product of:
  0.027704932 = sum of:
    0.015692718 = weight(_text_:in in 2832) [ClassicSimilarity], result of:
      0.015692718 = score(doc=2832,freq=12.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.22087781 = fieldWeight in 2832, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=2832)
    0.012012213 = product of:
      0.024024425 = sum of:
        0.024024425 = weight(_text_:science in 2832) [ClassicSimilarity], result of:
          0.024024425 = score(doc=2832,freq=2.0), product of:
            0.1375819 = queryWeight, product of:
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.052230705 = queryNorm
            0.17461908 = fieldWeight in 2832, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.046875 = fieldNorm(doc=2832)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Keyphrases represent the main topics a text is about. In this article, we introduce SemGraph, an unsupervised algorithm for extracting keyphrases from a collection of texts based on a semantic relationship graph. The main novelty of this algorithm is its ability to identify semantic relationships between words whose presence is statistically significant. Our method constructs a co-occurrence graph in which words appearing in the same document are linked, provided their presence in the collection is statistically significant with respect to a null model. Furthermore, the graph obtained is enriched with information from WordNet. We have used the most recent and standardized benchmark to evaluate the system ability to detect the keyphrases that are part of the text. The result is a method that achieves an improvement of 5.3% and 7.28% in F measure over the two labeled sets of keyphrases used in the evaluation of SemEval-2010.
    Source
    Journal of the Association for Information Science and Technology. 67(2016) no.1, S.71-82
  13. Moens, M.-F.; Uyttendaele, C.; Dumotier, J.: Abstracting of legal cases : the potential of clustering based on the selection of representative objects (1999) 0.02 
    0.017558426 = product of:
  0.026337638 = sum of:
    0.014325427 = weight(_text_:in in 2944) [ClassicSimilarity], result of:
      0.014325427 = score(doc=2944,freq=10.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.20163295 = fieldWeight in 2944, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=2944)
    0.012012213 = product of:
      0.024024425 = sum of:
        0.024024425 = weight(_text_:science in 2944) [ClassicSimilarity], result of:
          0.024024425 = score(doc=2944,freq=2.0), product of:
            0.1375819 = queryWeight, product of:
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.052230705 = queryNorm
            0.17461908 = fieldWeight in 2944, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.046875 = fieldNorm(doc=2944)
      0.5 = coord(1/2)
  0.6666667 = coord(2/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
    Source
    Journal of the American Society for Information Science. 50(1999) no.2, S.151-161
  14. Yang, C.C.; Wang, F.L.: Hierarchical summarization of large documents (2008) 0.02 
    0.017396256 = product of:
  0.026094384 = sum of:
    0.011937855 = weight(_text_:in in 1719) [ClassicSimilarity], result of:
      0.011937855 = score(doc=1719,freq=10.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.16802745 = fieldWeight in 1719, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1719)
    0.014156529 = product of:
      0.028313057 = sum of:
        0.028313057 = weight(_text_:science in 1719) [ClassicSimilarity], result of:
          0.028313057 = score(doc=1719,freq=4.0), product of:
            0.1375819 = queryWeight, product of:
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.052230705 = queryNorm
            0.20579056 = fieldWeight in 1719, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1719)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    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.
    Source
    Journal of the American Society for Information Science and Technology. 59(2008) no.6, S.887-902
  15. Atanassova, I.; Bertin, M.; Larivière, V.: On the composition of scientific abstracts (2016) 0.02 
    0.017350994 = product of:
  0.02602649 = sum of:
    0.016016312 = weight(_text_:in in 3028) [ClassicSimilarity], result of:
      0.016016312 = score(doc=3028,freq=18.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.22543246 = fieldWeight in 3028, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3028)
    0.010010177 = product of:
      0.020020355 = sum of:
        0.020020355 = weight(_text_:science in 3028) [ClassicSimilarity], result of:
          0.020020355 = score(doc=3028,freq=2.0), product of:
            0.1375819 = queryWeight, product of:
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.052230705 = queryNorm
            0.1455159 = fieldWeight in 3028, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3028)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Purpose - Scientific abstracts reproduce only part of the information and the complexity of argumentation in a scientific article. The purpose of this paper provides a first analysis of the similarity between the text of scientific abstracts and the body of articles, using sentences as the basic textual unit. It contributes to the understanding of the structure of abstracts. Design/methodology/approach - Using sentence-based similarity metrics, the authors quantify the phenomenon of text re-use in abstracts and examine the positions of the sentences that are similar to sentences in abstracts in the introduction, methods, results and discussion structure, using a corpus of over 85,000 research articles published in the seven Public Library of Science journals. Findings - The authors provide evidence that 84 percent of abstract have at least one sentence in common with the body of the paper. Studying the distributions of sentences in the body of the articles that are re-used in abstracts, the authors show that there exists a strong relation between the rhetorical structure of articles and the zones that authors re-use when writing abstracts, with sentences mainly coming from the beginning of the introduction and the end of the conclusion. Originality/value - Scientific abstracts contain what is considered by the author(s) as information that best describe documents' content. This is a first study that examines the relation between the contents of abstracts and the rhetorical structure of scientific articles. The work might provide new insight for improving automatic abstracting tools as well as information retrieval approaches, in which text organization and structure are important features.
  16. Ouyang, Y.; Li, W.; Li, S.; Lu, Q.: Intertopic information mining for query-based summarization (2010) 0.02 
    0.016740335 = product of:
  0.025110502 = sum of:
    0.015100324 = weight(_text_:in in 3459) [ClassicSimilarity], result of:
      0.015100324 = score(doc=3459,freq=16.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.21253976 = fieldWeight in 3459, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3459)
    0.010010177 = product of:
      0.020020355 = sum of:
        0.020020355 = weight(_text_:science in 3459) [ClassicSimilarity], result of:
          0.020020355 = score(doc=3459,freq=2.0), product of:
            0.1375819 = queryWeight, product of:
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.052230705 = queryNorm
            0.1455159 = fieldWeight in 3459, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3459)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    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.
    Source
    Journal of the American Society for Information Science and Technology. 61(2010) no.5, S.1062-1072
  17. Endres-Niggemeyer, B.; Neugebauer, E.: Professional summarizing : no cognitive simulation without observation (1998) 0.02 
    0.016372211 = product of:
  0.024558317 = sum of:
    0.008542033 = weight(_text_:in in 3243) [ClassicSimilarity], result of:
      0.008542033 = score(doc=3243,freq=2.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = 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.016016284 = product of:
      0.032032568 = sum of:
        0.032032568 = weight(_text_:science in 3243) [ClassicSimilarity], result of:
          0.032032568 = score(doc=3243,freq=2.0), product of:
            0.1375819 = queryWeight, product of:
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.052230705 = queryNorm
            0.23282544 = fieldWeight in 3243, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.0625 = fieldNorm(doc=3243)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    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
    Source
    Journal of the American Society for Information Science. 49(1998) no.6, S.486-506
  18. Liu, J.; Wu, Y.; Zhou, L.: ¬A hybrid method for abstracting newspaper articles (1999) 0.02 
    0.016372211 = product of:
  0.024558317 = sum of:
    0.008542033 = weight(_text_:in in 4059) [ClassicSimilarity], result of:
      0.008542033 = score(doc=4059,freq=2.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = 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.016016284 = product of:
      0.032032568 = sum of:
        0.032032568 = weight(_text_:science in 4059) [ClassicSimilarity], result of:
          0.032032568 = score(doc=4059,freq=2.0), product of:
            0.1375819 = queryWeight, product of:
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.052230705 = queryNorm
            0.23282544 = fieldWeight in 4059, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.0625 = fieldNorm(doc=4059)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    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
    Source
    Journal of the American Society for Information Science. 50(1999) no.13, S.1234-1245
  19. Wei, F.; Li, W.; Lu, Q.; He, Y.: Applying two-level reinforcement ranking in query-oriented multidocument summarization (2009) 0.02 
    0.01609016 = product of:
  0.02413524 = sum of:
    0.014125061 = weight(_text_:in in 3120) [ClassicSimilarity], result of:
      0.014125061 = score(doc=3120,freq=14.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.19881277 = fieldWeight in 3120, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3120)
    0.010010177 = product of:
      0.020020355 = sum of:
        0.020020355 = weight(_text_:science in 3120) [ClassicSimilarity], result of:
          0.020020355 = score(doc=3120,freq=2.0), product of:
            0.1375819 = queryWeight, product of:
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.052230705 = queryNorm
            0.1455159 = fieldWeight in 3120, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3120)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    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.
    Source
    Journal of the American Society for Information Science and Technology. 60(2009) no.10, S.2119-2131
  20. Craven, T.C.: ¬An experiment in the use of tools for computer-assisted abstracting (1996) 0.02 
    0.015405759 = product of:
  0.023108639 = sum of:
    0.011096427 = weight(_text_:in in 7426) [ClassicSimilarity], result of:
      0.011096427 = score(doc=7426,freq=6.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.1561842 = fieldWeight in 7426, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=7426)
    0.012012213 = product of:
      0.024024425 = sum of:
        0.024024425 = weight(_text_:science in 7426) [ClassicSimilarity], result of:
          0.024024425 = score(doc=7426,freq=2.0), product of:
            0.1375819 = queryWeight, product of:
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.052230705 = queryNorm
            0.17461908 = fieldWeight in 7426, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.6341193 = idf(docFreq=8627, maxDocs=44218)
              0.046875 = fieldNorm(doc=7426)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Experimental subjects wrote abstracts of an article using a simplified version of the TEXNET abstracting assistance software. In addition to the fulltext, the 35 subjects were presented with either keywords or phrases extracted automatically. The resulting abstracts, and the times taken, were recorded automatically; some additional information was gathered by oral questionnaire. Results showed considerable variation among subjects, but 37% found the keywords or phrases quite or very useful in writing their abstracts. Statistical analysis failed to support deveral hypothesised relations; phrases were not viewed as significantly more helpful than keywords; and abstracting experience did not correlate with originality of wording, approximation of the author abstract, or greater conciseness. Results also suggested possible modifications to the software
    Source
    Global complexity: information, chaos and control. Proceedings of the 59th Annual Meeting of the American Society for Information Science, ASIS'96, Baltimore, Maryland, 21-24 Oct 1996. Ed.: S. Hardin

Authors

Years

Languages

  • e 89
  • d 13
  • chi 1
  • More… Less…

Types

  • a 97
  • m 4
  • el 3
  • r 2
  • s 1
  • More… Less…

Themes

Subjects