Search (81 results, page 1 of 5)

  • × theme_ss:"Automatisches Abstracting"
  1. Goh, A.; Hui, S.C.: TES: a text extraction system (1996) 0.03 
    0.034193687 = product of:
  0.05129053 = sum of:
    0.026609756 = weight(_text_:to in 6599) [ClassicSimilarity], result of:
      0.026609756 = score(doc=6599,freq=8.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.32138905 = fieldWeight in 6599, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0625 = fieldNorm(doc=6599)
    0.024680775 = product of:
      0.04936155 = sum of:
        0.04936155 = weight(_text_:22 in 6599) [ClassicSimilarity], result of:
          0.04936155 = score(doc=6599,freq=2.0), product of:
            0.15947726 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045541126 = 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.6666667 = coord(2/3)
    Abstract
    With the onset of the information explosion arising from digital libraries and access to a wealth of information through the Internet, the need to efficiently determine the relevance of a document becomes even more urgent. Describes a text extraction system (TES), which retrieves a set of sentences from a document to form an indicative abstract. Such an automated process enables information to be filtered more quickly. Discusses the combination of various text extraction techniques. Compares results with manually produced abstracts
    Date
    26. 2.1997 10:22:43
  2. Robin, J.; McKeown, K.: Empirically designing and evaluating a new revision-based model for summary generation (1996) 0.03 
    0.034193687 = product of:
  0.05129053 = sum of:
    0.026609756 = weight(_text_:to in 6751) [ClassicSimilarity], result of:
      0.026609756 = score(doc=6751,freq=8.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.32138905 = fieldWeight in 6751, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0625 = fieldNorm(doc=6751)
    0.024680775 = product of:
      0.04936155 = sum of:
        0.04936155 = weight(_text_:22 in 6751) [ClassicSimilarity], result of:
          0.04936155 = score(doc=6751,freq=2.0), product of:
            0.15947726 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045541126 = 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
  3. Vanderwende, L.; Suzuki, H.; Brockett, J.M.; Nenkova, A.: Beyond SumBasic : task-focused summarization with sentence simplification and lexical expansion (2007) 0.03 
    0.029941088 = product of:
  0.04491163 = sum of:
    0.026401049 = weight(_text_:to in 948) [ClassicSimilarity], result of:
      0.026401049 = score(doc=948,freq=14.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.3188683 = fieldWeight in 948, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.046875 = fieldNorm(doc=948)
    0.018510582 = product of:
      0.037021164 = sum of:
        0.037021164 = weight(_text_:22 in 948) [ClassicSimilarity], result of:
          0.037021164 = score(doc=948,freq=2.0), product of:
            0.15947726 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045541126 = 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.
  4. Jones, P.A.; Bradbeer, P.V.G.: Discovery of optimal weights in a concept selection system (1996) 0.03 
    0.028997809 = product of:
  0.043496713 = sum of:
    0.018815938 = weight(_text_:to in 6974) [ClassicSimilarity], result of:
      0.018815938 = score(doc=6974,freq=4.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.22725637 = fieldWeight in 6974, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0625 = fieldNorm(doc=6974)
    0.024680775 = product of:
      0.04936155 = sum of:
        0.04936155 = weight(_text_:22 in 6974) [ClassicSimilarity], result of:
          0.04936155 = score(doc=6974,freq=2.0), product of:
            0.15947726 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045541126 = 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
  5. Wu, Y.-f.B.; Li, Q.; Bot, R.S.; Chen, X.: Finding nuggets in documents : a machine learning approach (2006) 0.03 
    0.026914757 = product of:
  0.040372133 = sum of:
    0.024946647 = weight(_text_:to in 5290) [ClassicSimilarity], result of:
      0.024946647 = score(doc=5290,freq=18.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.30130222 = fieldWeight in 5290, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5290)
    0.015425485 = product of:
      0.03085097 = sum of:
        0.03085097 = weight(_text_:22 in 5290) [ClassicSimilarity], result of:
          0.03085097 = score(doc=5290,freq=2.0), product of:
            0.15947726 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045541126 = 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.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
  6. Jiang, Y.; Meng, R.; Huang, Y.; Lu, W.; Liu, J.: Generating keyphrases for readers : a controllable keyphrase generation framework (2023) 0.03 
    0.026914757 = product of:
  0.040372133 = sum of:
    0.024946647 = weight(_text_:to in 1012) [ClassicSimilarity], result of:
      0.024946647 = score(doc=1012,freq=18.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.30130222 = fieldWeight in 1012, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1012)
    0.015425485 = product of:
      0.03085097 = sum of:
        0.03085097 = weight(_text_:22 in 1012) [ClassicSimilarity], result of:
          0.03085097 = score(doc=1012,freq=2.0), product of:
            0.15947726 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045541126 = 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.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
  7. Kim, H.H.; Kim, Y.H.: Generic speech summarization of transcribed lecture videos : using tags and their semantic relations (2016) 0.02 
    0.021371057 = product of:
  0.032056585 = sum of:
    0.016631098 = weight(_text_:to in 2640) [ClassicSimilarity], result of:
      0.016631098 = score(doc=2640,freq=8.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.20086816 = fieldWeight in 2640, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2640)
    0.015425485 = product of:
      0.03085097 = sum of:
        0.03085097 = weight(_text_:22 in 2640) [ClassicSimilarity], result of:
          0.03085097 = score(doc=2640,freq=2.0), product of:
            0.15947726 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045541126 = 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.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
  8. Oh, H.; Nam, S.; Zhu, Y.: Structured abstract summarization of scientific articles : summarization using full-text section information (2023) 0.02 
    0.021371057 = product of:
  0.032056585 = sum of:
    0.016631098 = weight(_text_:to in 889) [ClassicSimilarity], result of:
      0.016631098 = score(doc=889,freq=8.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.20086816 = fieldWeight in 889, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0390625 = fieldNorm(doc=889)
    0.015425485 = product of:
      0.03085097 = sum of:
        0.03085097 = weight(_text_:22 in 889) [ClassicSimilarity], result of:
          0.03085097 = score(doc=889,freq=2.0), product of:
            0.15947726 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045541126 = 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.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
  9. Chen, H.-H.; Kuo, J.-J.; Huang, S.-J.; Lin, C.-J.; Wung, H.-C.: ¬A summarization system for Chinese news from multiple sources (2003) 0.01 
    0.00940797 = product of:
  0.02822391 = sum of:
    0.02822391 = weight(_text_:to in 2115) [ClassicSimilarity], result of:
      0.02822391 = score(doc=2115,freq=16.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.34088457 = fieldWeight in 2115, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.046875 = fieldNorm(doc=2115)
  0.33333334 = coord(1/3)
    Abstract
    This article proposes a summarization system for multiple documents. It employs not only named entities and other signatures to cluster news from different sources, but also employs punctuation marks, linking elements, and topic chains to identify the meaningful units (MUs). Using nouns and verbs to identify the similar MUs, focusing and browsing models are applied to represent the summarization results. To reduce information loss during summarization, informative words in a document are introduced. For the evaluation, a question answering system (QA system) is proposed to substitute the human assessors. In large-scale experiments containing 140 questions to 17,877 documents, the results show that those models using informative words outperform pure heuristic voting-only strategy by news reporters. This model can be easily further applied to summarize multilingual news from multiple sources.
  10. Sweeney, S.; Crestani, F.; Losada, D.E.: 'Show me more' : incremental length summarisation using novelty detection (2008) 0.01 
    0.009193186 = product of:
  0.027579557 = sum of:
    0.027579557 = weight(_text_:to in 2054) [ClassicSimilarity], result of:
      0.027579557 = score(doc=2054,freq=22.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.33310217 = fieldWeight in 2054, product of:
          4.690416 = tf(freq=22.0), with freq of:
            22.0 = termFreq=22.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2054)
  0.33333334 = coord(1/3)
    Abstract
    The paper presents a study investigating the effects of incorporating novelty detection in automatic text summarisation. Condensing a textual document, automatic text summarisation can reduce the need to refer to the source document. It also offers a means to deliver device-friendly content when accessing information in non-traditional environments. An effective method of summarisation could be to produce a summary that includes only novel information. However, a consequence of focusing exclusively on novel parts may result in a loss of context, which may have an impact on the correct interpretation of the summary, with respect to the source document. In this study we compare two strategies to produce summaries that incorporate novelty in different ways: a constant length summary, which contains only novel sentences, and an incremental summary, containing additional sentences that provide context. The aim is to establish whether a summary that contains only novel sentences provides sufficient basis to determine relevance of a document, or if indeed we need to include additional sentences to provide context. Findings from the study seem to suggest that there is only a minimal difference in performance for the tasks we set our users and that the presence of contextual information is not so important. However, for the case of mobile information access, a summary that contains only novel information does offer benefits, given bandwidth constraints.
  11. Rodríguez-Vidal, J.; Carrillo-de-Albornoz, J.; Gonzalo, J.; Plaza, L.: Authority and priority signals in automatic summary generation for online reputation management (2021) 0.01 
    0.0087653585 = product of:
  0.026296074 = sum of:
    0.026296074 = weight(_text_:to in 213) [ClassicSimilarity], result of:
      0.026296074 = score(doc=213,freq=20.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.31760043 = fieldWeight in 213, product of:
          4.472136 = tf(freq=20.0), with freq of:
            20.0 = termFreq=20.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0390625 = fieldNorm(doc=213)
  0.33333334 = coord(1/3)
    Abstract
    Online reputation management (ORM) comprises the collection of techniques that help monitoring and improving the public image of an entity (companies, products, institutions) on the Internet. The ORM experts try to minimize the negative impact of the information about an entity while maximizing the positive material for being more trustworthy to the customers. Due to the huge amount of information that is published on the Internet every day, there is a need to summarize the entire flow of information to obtain only those data that are relevant to the entities. Traditionally the automatic summarization task in the ORM scenario takes some in-domain signals into account such as popularity, polarity for reputation and novelty but exists other feature to be considered, the authority of the people. This authority depends on the ability to convince others and therefore to influence opinions. In this work, we propose the use of authority signals that measures the influence of a user jointly with (a) priority signals related to the ORM domain and (b) information regarding the different topics that influential people is talking about. Our results indicate that the use of authority signals may significantly improve the quality of the summaries that are automatically generated.
  12. 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.008315549 = product of:
  0.024946647 = sum of:
    0.024946647 = weight(_text_:to in 4685) [ClassicSimilarity], result of:
      0.024946647 = score(doc=4685,freq=18.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.30130222 = fieldWeight in 4685, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4685)
  0.33333334 = coord(1/3)
    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.
  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.01 
    0.0081475405 = product of:
  0.02444262 = sum of:
    0.02444262 = weight(_text_:to in 2944) [ClassicSimilarity], result of:
      0.02444262 = score(doc=2944,freq=12.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.29521468 = fieldWeight in 2944, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.046875 = fieldNorm(doc=2944)
  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
  14. Hirao, T.; Okumura, M.; Yasuda, N.; Isozaki, H.: Supervised automatic evaluation for summarization with voted regression model (2007) 0.01 
    0.0081475405 = product of:
  0.02444262 = sum of:
    0.02444262 = weight(_text_:to in 942) [ClassicSimilarity], result of:
      0.02444262 = score(doc=942,freq=12.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.29521468 = fieldWeight in 942, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.046875 = fieldNorm(doc=942)
  0.33333334 = coord(1/3)
    Abstract
    The high quality evaluation of generated summaries is needed if we are to improve automatic summarization systems. Although human evaluation provides better results than automatic evaluation methods, its cost is huge and it is difficult to reproduce the results. Therefore, we need an automatic method that simulates human evaluation if we are to improve our summarization system efficiently. Although automatic evaluation methods have been proposed, they are unreliable when used for individual summaries. To solve this problem, we propose a supervised automatic evaluation method based on a new regression model called the voted regression model (VRM). VRM has two characteristics: (1) model selection based on 'corrected AIC' to avoid multicollinearity, (2) voting by the selected models to alleviate the problem of overfitting. Evaluation results obtained for TSC3 and DUC2004 show that our method achieved error reductions of about 17-51% compared with conventional automatic evaluation methods. Moreover, our method obtained the highest correlation coefficients in several different experiments.
  15. Díaz, A.; Gervás, P.: User-model based personalized summarization (2007) 0.01 
    0.0081475405 = product of:
  0.02444262 = sum of:
    0.02444262 = weight(_text_:to in 952) [ClassicSimilarity], result of:
      0.02444262 = score(doc=952,freq=12.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.29521468 = fieldWeight in 952, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.046875 = fieldNorm(doc=952)
  0.33333334 = coord(1/3)
    Abstract
    The potential of summary personalization is high, because a summary that would be useless to decide the relevance of a document if summarized in a generic manner, may be useful if the right sentences are selected that match the user interest. In this paper we defend the use of a personalized summarization facility to maximize the density of relevance of selections sent by a personalized information system to a given user. The personalization is applied to the digital newspaper domain and it used a user-model that stores long and short term interests using four reference systems: sections, categories, keywords and feedback terms. On the other side, it is crucial to measure how much information is lost during the summarization process, and how this information loss may affect the ability of the user to judge the relevance of a given document. The results obtained in two personalization systems show that personalized summaries perform better than generic and generic-personalized summaries in terms of identifying documents that satisfy user preferences. We also considered a user-centred direct evaluation that showed a high level of user satisfaction with the summaries.
  16. Wang, W.; Hwang, D.: Abstraction Assistant : an automatic text abstraction system (2010) 0.01 
    0.0081475405 = product of:
  0.02444262 = sum of:
    0.02444262 = weight(_text_:to in 3981) [ClassicSimilarity], result of:
      0.02444262 = score(doc=3981,freq=12.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.29521468 = fieldWeight in 3981, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.046875 = fieldNorm(doc=3981)
  0.33333334 = coord(1/3)
    Abstract
    In the interest of standardization and quality assurance, it is desirable for authors and staff of access services to follow the American National Standards Institute (ANSI) guidelines in preparing abstracts. Using the statistical approach an extraction system (the Abstraction Assistant) was developed to generate informative abstracts to meet the ANSI guidelines for structural content elements. The system performance is evaluated by comparing the system-generated abstracts with the author's original abstracts and the manually enhanced system abstracts on three criteria: balance (satisfaction of the ANSI standards), fluency (text coherence), and understandability (clarity). The results suggest that it is possible to use the system output directly without manual modification, but there are issues that need to be addressed in further studies to make the system a better tool.
  17. Xu, D.; Cheng, G.; Qu, Y.: Preferences in Wikipedia abstracts : empirical findings and implications for automatic entity summarization (2014) 0.01 
    0.0081475405 = product of:
  0.02444262 = sum of:
    0.02444262 = weight(_text_:to in 2700) [ClassicSimilarity], result of:
      0.02444262 = score(doc=2700,freq=12.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.29521468 = fieldWeight in 2700, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.046875 = fieldNorm(doc=2700)
  0.33333334 = coord(1/3)
    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.
  18. 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.007839975 = product of:
  0.023519924 = sum of:
    0.023519924 = weight(_text_:to in 1003) [ClassicSimilarity], result of:
      0.023519924 = score(doc=1003,freq=16.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.28407046 = fieldWeight in 1003, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1003)
  0.33333334 = coord(1/3)
    Abstract
    This paper proposes two approaches to address text summarization: modified corpus-based approach (MCBA) and LSA-based T.R.M. approach (LSA + T.R.M.). The first is a trainable summarizer, which takes into account several features, including position, positive keyword, negative keyword, centrality, and the resemblance to the title, to generate summaries. Two new ideas are exploited: (1) sentence positions are ranked to emphasize the significances of different sentence positions, and (2) the score function is trained by the genetic algorithm (GA) to obtain a suitable combination of feature weights. The second uses latent semantic analysis (LSA) to derive the semantic matrix of a document or a corpus and uses semantic sentence representation to construct a semantic text relationship map. We evaluate LSA + T.R.M. both with single documents and at the corpus level to investigate the competence of LSA in text summarization. The two novel approaches were measured at several compression rates on a data corpus composed of 100 political articles. When the compression rate was 30%, an average f-measure of 49% for MCBA, 52% for MCBA + GA, 44% and 40% for LSA + T.R.M. in single-document and corpus level were achieved respectively.
  19. Salton, G.: Automatic text structuring and summarization (1997) 0.01 
    0.0077611795 = product of:
  0.023283537 = sum of:
    0.023283537 = weight(_text_:to in 145) [ClassicSimilarity], result of:
      0.023283537 = score(doc=145,freq=8.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.28121543 = fieldWeight in 145, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0546875 = fieldNorm(doc=145)
  0.33333334 = coord(1/3)
    Abstract
    Applies the ideas from the automatic link generation research to automatic text summarisation. Using techniques for inter-document link generation, generates intra-document links between passages of a document. Based on the intra-document linkage pattern of a text, characterises the structure of the text. Applies the knowledge of text structure to do automatic text summarisation by passage extraction. Evaluates a set of 50 summaries generated using these techniques by comparing the to paragraph extracts constructed by humans. The automatic summarisation methods perform well, especially in view of the fact that the summaries generates by 2 humans for the same article are surprisingly dissimilar
    Footnote
    Contribution to a special issue on methods and tools for the automatic construction of hypertext
  20. Uyttendaele, C.; Moens, M.-F.; Dumortier, J.: SALOMON: automatic abstracting of legal cases for effective access to court decisions (1998) 0.01 
    0.0077611795 = product of:
  0.023283537 = sum of:
    0.023283537 = weight(_text_:to in 495) [ClassicSimilarity], result of:
      0.023283537 = score(doc=495,freq=8.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.28121543 = fieldWeight in 495, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0546875 = fieldNorm(doc=495)
  0.33333334 = coord(1/3)
    Abstract
    The SALOMON project summarises Belgian criminal cases in order to improve access to the large number of existing and future cases. A double methodology was used when developing SALOMON: the cases are processed by employing additional knowledge to interpret structural patterns and features on the one hand and by way of occurrence statistics of index terms on the other. SALOMON performs an initial categorisation and structuring of the cases and subsequently extracts the most relevant text units of the alleged offences and of the opinion of the court. The SALOMON techniques do not themselves solve any legal questions, but they do guide the use effectively towards relevant texts

Authors

Years

Languages

  • e 79
  • chi 1
  • d 1
  • More… Less…

Types

  • a 78
  • m 2
  • el 1
  • r 1
  • More… Less…

Themes

Subjects