Search (42 results, page 1 of 3)

0.054289002 = product of:
  0.1357225 = sum of:
    0.07919731 = weight(_text_:system in 6751) [ClassicSimilarity], result of:
      0.07919731 = score(doc=6751,freq=6.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.48217484 = fieldWeight in 6751, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=6751)
    0.056525193 = weight(_text_:22 in 6751) [ClassicSimilarity], result of:
      0.056525193 = score(doc=6751,freq=2.0), product of:
        0.18262155 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.052150324 = 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.4 = coord(2/5)

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

0.048475813 = product of:
  0.12118953 = sum of:
    0.064664334 = weight(_text_:system in 6599) [ClassicSimilarity], result of:
      0.064664334 = score(doc=6599,freq=4.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.3936941 = fieldWeight in 6599, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=6599)
    0.056525193 = weight(_text_:22 in 6599) [ClassicSimilarity], result of:
      0.056525193 = score(doc=6599,freq=2.0), product of:
        0.18262155 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.052150324 = 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.4 = coord(2/5)

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

0.047630545 = product of:
  0.119076364 = sum of:
    0.07668247 = weight(_text_:system in 948) [ClassicSimilarity], result of:
      0.07668247 = score(doc=948,freq=10.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.46686378 = fieldWeight in 948, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=948)
    0.042393893 = weight(_text_:22 in 948) [ClassicSimilarity], result of:
      0.042393893 = score(doc=948,freq=2.0), product of:
        0.18262155 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.052150324 = 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.4 = coord(2/5)

Abstract

In recent years, there has been increased interest in topic-focused multi-document summarization. In this task, automatic summaries are produced in response to a specific information request, or topic, stated by the user. The system we have designed to accomplish this task comprises four main components: a generic extractive summarization system, a topic-focusing component, sentence simplification, and lexical expansion of topic words. This paper details each of these components, together with experiments designed to quantify their individual contributions. We include an analysis of our results on two large datasets commonly used to evaluate task-focused summarization, the DUC2005 and DUC2006 datasets, using automatic metrics. Additionally, we include an analysis of our results on the DUC2006 task according to human evaluation metrics. In the human evaluation of system summaries compared to human summaries, i.e., the Pyramid method, our system ranked first out of 22 systems in terms of overall mean Pyramid score; and in the human evaluation of summary responsiveness to the topic, our system ranked third out of 35 systems.

0.040899914 = product of:
  0.10224978 = sum of:
    0.045724586 = weight(_text_:system in 6974) [ClassicSimilarity], result of:
      0.045724586 = score(doc=6974,freq=2.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.27838376 = fieldWeight in 6974, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=6974)
    0.056525193 = weight(_text_:22 in 6974) [ClassicSimilarity], result of:
      0.056525193 = score(doc=6974,freq=2.0), product of:
        0.18262155 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.052150324 = 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.4 = coord(2/5)

Source

Information retrieval: new systems and current research. Proceedings of the 16th Research Colloquium of the British Computer Society Information Retrieval Specialist Group, Drymen, Scotland, 22-23 Mar 94. Ed.: R. Leon

0.018146386 = product of:
  0.090731926 = sum of:
    0.090731926 = weight(_text_:system in 3981) [ClassicSimilarity], result of:
      0.090731926 = score(doc=3981,freq=14.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.5524007 = fieldWeight in 3981, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=3981)
  0.2 = coord(1/5)

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.

0.016003607 = product of:
  0.08001803 = sum of:
    0.08001803 = weight(_text_:system in 2928) [ClassicSimilarity], result of:
      0.08001803 = score(doc=2928,freq=2.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.4871716 = fieldWeight in 2928, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.109375 = fieldNorm(doc=2928)
  0.2 = coord(1/5)

0.015839463 = product of:
  0.07919731 = sum of:
    0.07919731 = weight(_text_:system in 2929) [ClassicSimilarity], result of:
      0.07919731 = score(doc=2929,freq=6.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.48217484 = fieldWeight in 2929, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=2929)
  0.2 = coord(1/5)

Abstract

Description of a system that performs domain-independent automatic condensation of news from a large commercial news service encompassing 41 different publications. This system was evaluated against a system that condensed the same articles using only the first portions of the texts (the löead), up to the target length of the summaries. 3 lengths of articles were evaluated for 250 documents by both systems, totalling 1.500 suitability judgements in all. The lead-based summaries outperformed the 'intelligent' summaries significantly, achieving acceptability ratings of over 90%, compared to 74,7%

0.015839463 = product of:
  0.07919731 = sum of:
    0.07919731 = weight(_text_:system in 4059) [ClassicSimilarity], result of:
      0.07919731 = score(doc=4059,freq=6.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.48217484 = fieldWeight in 4059, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=4059)
  0.2 = coord(1/5)

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

0.013717378 = product of:
  0.068586886 = sum of:
    0.068586886 = weight(_text_:system in 2994) [ClassicSimilarity], result of:
      0.068586886 = score(doc=2994,freq=2.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.41757566 = fieldWeight in 2994, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.09375 = fieldNorm(doc=2994)
  0.2 = coord(1/5)

0.013717378 = product of:
  0.068586886 = sum of:
    0.068586886 = weight(_text_:system in 2115) [ClassicSimilarity], result of:
      0.068586886 = score(doc=2115,freq=8.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.41757566 = fieldWeight in 2115, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=2115)
  0.2 = coord(1/5)

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.

0.012097589 = product of:
  0.060487945 = sum of:
    0.060487945 = weight(_text_:system in 947) [ClassicSimilarity], result of:
      0.060487945 = score(doc=947,freq=14.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.36826712 = fieldWeight in 947, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.03125 = fieldNorm(doc=947)
  0.2 = coord(1/5)

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.

0.011431146 = product of:
  0.057155732 = sum of:
    0.057155732 = weight(_text_:system in 917) [ClassicSimilarity], result of:
      0.057155732 = score(doc=917,freq=2.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.3479797 = fieldWeight in 917, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.078125 = fieldNorm(doc=917)
  0.2 = coord(1/5)

Abstract

The final report of the 2nd British Library abstracting project (the BLAB project), 1990-1992, which was carried out partly at the Computing Department of Lancaster University, and partly at the Centre for Computational Linguistics, UMIST. This project built on the results of the first project, of 1985-1987, to build a system designed create abstracts automatically from given texts

0.011431146 = product of:
  0.057155732 = sum of:
    0.057155732 = weight(_text_:system in 1956) [ClassicSimilarity], result of:
      0.057155732 = score(doc=1956,freq=2.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.3479797 = fieldWeight in 1956, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.078125 = fieldNorm(doc=1956)
  0.2 = coord(1/5)

0.0113162575 = product of:
  0.05658129 = sum of:
    0.05658129 = weight(_text_:system in 4540) [ClassicSimilarity], result of:
      0.05658129 = score(doc=4540,freq=4.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.34448233 = fieldWeight in 4540, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4540)
  0.2 = coord(1/5)

Abstract

Browsing a database of article abstracts is one way to select and buy relevant magazine articles online. Our research contributes to the design and development of text grammars for abstracting texts in unlimited subject domains. We developed a system that parses texts based on the text grammar of a specific text type and that extracts sentences and statements which are relevant for inclusion in the abstracts. The system employs knowledge of the discourse patterns that are typical of news stories. The results are encouraging and demonstrate the importance of discourse structures in text summarisation.

0.0113162575 = product of:
  0.05658129 = sum of:
    0.05658129 = weight(_text_:system in 2734) [ClassicSimilarity], result of:
      0.05658129 = score(doc=2734,freq=4.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.34448233 = fieldWeight in 2734, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2734)
  0.2 = coord(1/5)

Abstract

Access to the vast body of research literature that is now available on biomedicine and related fields can be improved with automatic summarization. This paper describes a summarization system for the biomedical domain that represents documents as graphs formed from concepts and relations in the UMLS Metathesaurus. This system has to deal with the ambiguities that occur in biomedical documents. We describe a variety of strategies that make use of MetaMap and Word Sense Disambiguation (WSD) to accurately map biomedical documents onto UMLS Metathesaurus concepts. Evaluation is carried out using a collection of 150 biomedical scientific articles from the BioMed Central corpus. We find that using WSD improves the quality of the summaries generated.

0.011200191 = product of:
  0.056000955 = sum of:
    0.056000955 = weight(_text_:system in 2683) [ClassicSimilarity], result of:
      0.056000955 = score(doc=2683,freq=12.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.3409491 = fieldWeight in 2683, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.03125 = fieldNorm(doc=2683)
  0.2 = coord(1/5)

Abstract

Video summarization aims at producing a compact version of a full-length video while preserving the significant content of the original video. Movie summarization condenses a full-length movie into a summary that still retains the most significant and interesting content of the original movie. In the past, several movie summarization systems have been proposed to generate a movie summary based on low-level video features such as color, motion, texture, etc. However, a generic summary, which is common to everyone and is produced based only on low-level video features will not satisfy every user. As users' preferences for the summary differ vastly for the same movie, there is a need for a personalized movie summarization system nowadays. To address this demand, this paper proposes a novel system to generate semantically meaningful video summaries for the same movie, which are tailored to the preferences and interests of a user. For a given movie, shots and scenes are automatically detected and their high-level features are semi-automatically annotated. Preferences over high-level movie features are explicitly collected from the user using a query interface. The user preferences are generated by means of a stored-query. Movie summaries are generated at shot level and scene level, where shots or scenes are selected for summary skim based on the similarity measured between shots and scenes, and the user's preferences. The proposed movie summarization system is evaluated subjectively using a sample of 20 subjects with eight movies in the English language. The quality of the generated summaries is assessed by informativeness, enjoyability, relevance, and acceptance metrics and Quality of Perception measures. Further, the usability of the proposed summarization system is subjectively evaluated by conducting a questionnaire survey. The experimental results on the performance of the proposed movie summarization approach show the potential of the proposed system.

0.009899664 = product of:
  0.04949832 = sum of:
    0.04949832 = weight(_text_:system in 6601) [ClassicSimilarity], result of:
      0.04949832 = score(doc=6601,freq=6.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.30135927 = fieldWeight in 6601, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6601)
  0.2 = coord(1/5)

Abstract

Describes the design and implementation of a text extraction tool, NEWS_EXT, which aztomatically produces summaries from news reports by extracting sentences to form indicative abstracts. Selection of sentences is based on sentence importance, measured by means of sentence scoring or simple linguistic analysis of sentence structure. Tests were conducted on 4 approaches for the functioning of the NEWS_EXT system; extraction by keyword frequency; extraction by title keywords; extraction by location; and extraction by indicative phrase. Reports results of a study to compare the results of the application of NEWS_EXT with manually produced extracts; using relevance as the criterion for effectiveness. 48 newspaper articles were assessed (The Straits Times, International Herald Tribune, Asian Wall Street Journal, and Financial Times). The evaluation was conducted in 2 stages: stage 1 involving abstracts produced manually by 2 human experts; stage 2 involving the generation of abstracts using NEWS_EXT. Results of each of the 4 approaches were compared with the human produced abstracts, where the title and location approaches were found to give the best results for both local and foreign news. Reports plans to refine and enhance NEWS_EXT and incorporate it as a module within a larger newspaper clipping system

0.009699649 = product of:
  0.048498247 = sum of:
    0.048498247 = weight(_text_:system in 949) [ClassicSimilarity], result of:
      0.048498247 = score(doc=949,freq=4.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.29527056 = fieldWeight in 949, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=949)
  0.2 = coord(1/5)

Abstract

We propose a new method for using anaphoric information in Latent Semantic Analysis (lsa), and discuss its application to develop an lsa-based summarizer which achieves a significantly better performance than a system not using anaphoric information, and a better performance by the rouge measure than all but one of the single-document summarizers participating in DUC-2002. Anaphoric information is automatically extracted using a new release of our own anaphora resolution system, guitar, which incorporates proper noun resolution. Our summarizer also includes a new approach for automatically identifying the dimensionality reduction of a document on the basis of the desired summarization percentage. Anaphoric information is also used to check the coherence of the summary produced by our summarizer, by a reference checker module which identifies anaphoric resolution errors caused by sentence extraction.

0.009699649 = product of:
  0.048498247 = sum of:
    0.048498247 = weight(_text_:system in 950) [ClassicSimilarity], result of:
      0.048498247 = score(doc=950,freq=4.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.29527056 = fieldWeight in 950, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=950)
  0.2 = coord(1/5)

Abstract

This paper presents a model that incorporates contemporary theories of tense and aspect and develops a new framework for extracting temporal relations between two sentence-internal events, given their tense, aspect, and a temporal connecting word relating the two events. A linguistic constraint on event combination has been implemented to detect incorrect parser analyses and potentially apply syntactic reanalysis or semantic reinterpretation - in preparation for subsequent processing for multi-document summarization. An important contribution of this work is the extension of two different existing theoretical frameworks - Hornstein's 1990 theory of tense analysis and Allen's 1984 theory on event ordering - and the combination of both into a unified system for representing and constraining combinations of different event types (points, closed intervals, and open-ended intervals). We show that our theoretical results have been verified in a large-scale corpus analysis. The framework is designed to inform a temporally motivated sentence-ordering module in an implemented multi-document summarization system.

0.009144917 = product of:
  0.045724586 = sum of:
    0.045724586 = weight(_text_:system in 6506) [ClassicSimilarity], result of:
      0.045724586 = score(doc=6506,freq=2.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.27838376 = fieldWeight in 6506, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=6506)
  0.2 = coord(1/5)

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