Search (2 results, page 1 of 1)

0.00635655 = product of:
  0.0254262 = sum of:
    0.0254262 = product of:
      0.0508524 = sum of:
        0.0508524 = weight(_text_:research in 954) [ClassicSimilarity], result of:
          0.0508524 = score(doc=954,freq=6.0), product of:
            0.13306029 = queryWeight, product of:
              2.8529835 = idf(docFreq=6931, maxDocs=44218)
              0.046639 = queryNorm
            0.38217562 = fieldWeight in 954, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              2.8529835 = idf(docFreq=6931, maxDocs=44218)
              0.0546875 = fieldNorm(doc=954)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Abstract

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

0.0031456763 = product of:
  0.012582705 = sum of:
    0.012582705 = product of:
      0.02516541 = sum of:
        0.02516541 = weight(_text_:research in 2944) [ClassicSimilarity], result of:
          0.02516541 = score(doc=2944,freq=2.0), product of:
            0.13306029 = queryWeight, product of:
              2.8529835 = idf(docFreq=6931, maxDocs=44218)
              0.046639 = queryNorm
            0.18912788 = fieldWeight in 2944, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.8529835 = idf(docFreq=6931, maxDocs=44218)
              0.046875 = fieldNorm(doc=2944)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

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