<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>2nd German Text Summarization Challenge</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Participant David Biesner UPB ROUGE-</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Baseline Inovex</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dominik Frefel, Manfred Vogel, Fabian M a ̈rki University of Applied Sciences Northwestern Switzerland Institute of Data Science</institution>
          ,
          <addr-line>Bahnhofstrasse 6, 5210 Windisch</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Overview</title>
      <p>Automatic text summarization has made
tremendous progress in recent years. However, the rating
of a summary is still an open research topic.
Especially when it comes to measuring the
abstractiveness, existing evaluation metrics like ROUGE,
BLEU or METEOR show severe shortcomings.</p>
      <p>In the 2nd German Text Summarization
Challenge we aimed to explore new ideas and solutions
regarding an automatic quality assessment of
German text summarizations. For the challenge, we
provided a text corpus together with several
summaries per text. The goal was to assign a quality
measure in the range from 0 (bad) to 1 (excellent)
to each summary. We asked the participants to
consider aspects such as correctness in content and
grammar as well as facets like compactness and
abstractiveness. The participants were able to
submit (and resubmit) their solution to our evaluation
board. The solution was evaluated automatically,
and the achieved rank published on the leaderboard.</p>
    </sec>
    <sec id="sec-2">
      <title>Data</title>
      <p>The dataset provided consists of 24 distinct source
texts from our German summarization corpus
(Frefel, 2020). It contains one reference summary
and 9 summaries proposed for evaluation for each
source text. The summaries are generated by
various summarization algorithms and humans. Each
summary is evaluated and given a score between 0
to 1 by the task organizers. All texts are provided
in lower case, with punctuation and quotations
intact. The source texts are on average 786 tokens
long. The reference summaries contain on average
46 and the generated summaries 38 tokens. The
average compression ratio is 6%.</p>
      <p>Error
29.037
31.993
32.098
34.630</p>
    </sec>
    <sec id="sec-3">
      <title>Evaluation</title>
      <p>The participants’ submissions are ranked by the
mean squared error of their score predictions. We
use our own German ROUGE-1 implementation
as a baseline (Frefel, 2020). It scores an error of
32.098. Refer to table 1 for the results of all
participants.</p>
    </sec>
  </body>
  <back>
    <ref-list />
  </back>
</article>