Search (7 results, page 1 of 1)

  • × year_i:[2000 TO 2010}
  • × theme_ss:"Automatisches Abstracting"
  1. Lam, W.; Chan, K.; Radev, D.; Saggion, H.; Teufel, S.: Context-based generic cross-lingual retrieval of documents and automated summaries (2005) 0.01 
    0.009611183 = product of:
  0.019222366 = sum of:
    0.019222366 = product of:
      0.03844473 = sum of:
        0.03844473 = weight(_text_:k in 1965) [ClassicSimilarity], result of:
          0.03844473 = score(doc=1965,freq=2.0), product of:
            0.16245733 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.045509085 = queryNorm
            0.23664509 = fieldWeight in 1965, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.046875 = fieldNorm(doc=1965)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
  2. Sparck Jones, K.: Automatic summarising : the state of the art (2007) 0.01 
    0.009611183 = product of:
  0.019222366 = sum of:
    0.019222366 = product of:
      0.03844473 = sum of:
        0.03844473 = weight(_text_:k in 932) [ClassicSimilarity], result of:
          0.03844473 = score(doc=932,freq=2.0), product of:
            0.16245733 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.045509085 = queryNorm
            0.23664509 = fieldWeight in 932, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.046875 = fieldNorm(doc=932)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
  3. Nomoto, T.: Discriminative sentence compression with conditional random fields (2007) 0.01 
    0.009611183 = product of:
  0.019222366 = sum of:
    0.019222366 = product of:
      0.03844473 = sum of:
        0.03844473 = weight(_text_:k in 945) [ClassicSimilarity], result of:
          0.03844473 = score(doc=945,freq=2.0), product of:
            0.16245733 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.045509085 = queryNorm
            0.23664509 = fieldWeight in 945, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.046875 = fieldNorm(doc=945)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    The paper focuses on a particular approach to automatic sentence compression which makes use of a discriminative sequence classifier known as Conditional Random Fields (CRF). We devise several features for CRF that allow it to incorporate information on nonlinear relations among words. Along with that, we address the issue of data paucity by collecting data from RSS feeds available on the Internet, and turning them into training data for use with CRF, drawing on techniques from biology and information retrieval. We also discuss a recursive application of CRF on the syntactic structure of a sentence as a way of improving the readability of the compression it generates. Experiments found that our approach works reasonably well compared to the state-of-the-art system [Knight, K., & Marcu, D. (2002). Summarization beyond sentence extraction: A probabilistic approach to sentence compression. Artificial Intelligence 139, 91-107.].
  4. Steinberger, J.; Poesio, M.; Kabadjov, M.A.; Jezek, K.: Two uses of anaphora resolution in summarization (2007) 0.01 
    0.009611183 = product of:
  0.019222366 = sum of:
    0.019222366 = product of:
      0.03844473 = sum of:
        0.03844473 = weight(_text_:k in 949) [ClassicSimilarity], result of:
          0.03844473 = score(doc=949,freq=2.0), product of:
            0.16245733 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.045509085 = queryNorm
            0.23664509 = fieldWeight in 949, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.046875 = fieldNorm(doc=949)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
  5. Vanderwende, L.; Suzuki, H.; Brockett, J.M.; Nenkova, A.: Beyond SumBasic : task-focused summarization with sentence simplification and lexical expansion (2007) 0.01 
    0.009248778 = product of:
  0.018497556 = sum of:
    0.018497556 = product of:
      0.036995113 = sum of:
        0.036995113 = weight(_text_:22 in 948) [ClassicSimilarity], result of:
          0.036995113 = score(doc=948,freq=2.0), product of:
            0.15936506 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045509085 = 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.5 = coord(1/2)
    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.
  6. Wu, Y.-f.B.; Li, Q.; Bot, R.S.; Chen, X.: Finding nuggets in documents : a machine learning approach (2006) 0.01 
    0.007707316 = product of:
  0.015414632 = sum of:
    0.015414632 = product of:
      0.030829264 = sum of:
        0.030829264 = weight(_text_:22 in 5290) [ClassicSimilarity], result of:
          0.030829264 = score(doc=5290,freq=2.0), product of:
            0.15936506 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045509085 = 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(1/2)
    Date
    22. 7.2006 17:25:48
  7. Dunlavy, D.M.; O'Leary, D.P.; Conroy, J.M.; Schlesinger, J.D.: QCS: A system for querying, clustering and summarizing documents (2007) 0.01 
    0.006407455 = product of:
  0.01281491 = sum of:
    0.01281491 = product of:
      0.02562982 = sum of:
        0.02562982 = weight(_text_:k in 947) [ClassicSimilarity], result of:
          0.02562982 = score(doc=947,freq=2.0), product of:
            0.16245733 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.045509085 = queryNorm
            0.15776339 = fieldWeight in 947, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.03125 = fieldNorm(doc=947)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Information retrieval systems consist of many complicated components. Research and development of such systems is often hampered by the difficulty in evaluating how each particular component would behave across multiple systems. We present a novel integrated information retrieval system-the Query, Cluster, Summarize (QCS) system-which is portable, modular, and permits experimentation with different instantiations of each of the constituent text analysis components. Most importantly, the combination of the three types of methods in the QCS design improves retrievals by providing users more focused information organized by topic. We demonstrate the improved performance by a series of experiments using standard test sets from the Document Understanding Conferences (DUC) as measured by the best known automatic metric for summarization system evaluation, ROUGE. Although the DUC data and evaluations were originally designed to test multidocument summarization, we developed a framework to extend it to the task of evaluation for each of the three components: query, clustering, and summarization. Under this framework, we then demonstrate that the QCS system (end-to-end) achieves performance as good as or better than the best summarization engines. Given a query, QCS retrieves relevant documents, separates the retrieved documents into topic clusters, and creates a single summary for each cluster. In the current implementation, Latent Semantic Indexing is used for retrieval, generalized spherical k-means is used for the document clustering, and a method coupling sentence "trimming" and a hidden Markov model, followed by a pivoted QR decomposition, is used to create a single extract summary for each cluster. The user interface is designed to provide access to detailed information in a compact and useful format. Our system demonstrates the feasibility of assembling an effective IR system from existing software libraries, the usefulness of the modularity of the design, and the value of this particular combination of modules.

Authors