<!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>Overview of the Style Change Detection Task at PAN 2020</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Eva Zangerle</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maximilian Mayerl</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Günther Specht</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Martin Potthast</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Benno Stein</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Bauhaus-Universität Weimar</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Leipzig University</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Innsbruck</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>The goal of style change detection is to identify text positions within a multi-author document at which the author switches. Detecting these positions is a crucial part of processing multi-author documents for purposes of authorship identification. In this year's PAN style change detection task, we asked the participants to answer the following questions for a given document: (1) Given a document, was it written by multiple authors? (2) For each pair of consecutive paragraphs in a given document, is there a style change between these paragraphs? The task is performed and evaluated on two datasets compiled from an English Q&amp;A platform, which differ in their topical breadth (i.e., the number of different topics that are covered in the documents contained). The paper in hand introduces style change detection as a task and its underlying dataset, surveys the participants' submissions, and analyzes their performance.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The task of style change detection aims at detecting positions of author changes within
a collaboratively written text. Previous PAN editions paved the way for PAN’20 by
analyzing multi-authored documents for style changes. This includes the identification and
clustering of text segments by author in 2016 [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. In 2017, participants were asked
to detect whether a given document has been authored by multiple authors, and in
that case, to determine the boundaries at which authorship changes [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ]. The results
showed that accurately determining such boundaries is still beyond current capabilities.
Hence, in 2018, the task was relaxed by formulating it as a binary classification
problem, where the goal was to predict whether a given document is written by a single
author or multiple authors [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. At PAN 2019, this classification task was extended to
also predict the number of authors for multi-author documents [
        <xref ref-type="bibr" rid="ref35">35</xref>
        ]. In 2020, the task
was steered back into its original direction: Participants were asked to detect whether a
document was authored by one or multiple authors, and the positions of style changes
at the paragraph-level.
      </p>
      <p>The remainder of this paper is structured as follows. Section 2 presents previous
style change detection approaches. Section 3 introduces the style change detection task
as part of PAN 2020, along with the datasets and evaluation measures employed.
Section 4 summarizes the received submissions, and Section 5 analyzes and compares the
achieved results and Section 6 concludes the paper.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Style change detection is closely related to the fields of stylometry, plagiarism
detection, and text segmentation. All of them have in common that they rely on intrinsic
stylometric analyses of documents, without referring to external documents or
corpora for comparison. Hence, stylistic profiles are created that are based on lexical
features like character n-grams (e.g., [
        <xref ref-type="bibr" rid="ref20 ref29">29, 20</xref>
        ]), word frequencies (e.g., [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]) and average
word/sentence lengths (e.g., [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ]), syntactic features like part-of-speech tag
frequencies/structures (e.g., [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ]), and structural features such as indentation usage (e.g., [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ]).
      </p>
      <p>
        One of the earliest works on style change detection by analyzing stylometric
features to detect author boundaries is by Glover and Hirst [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], which aims at
identifying inconsistencies of writing style in collaborative documents. Meyer zu Eißen and
Stein [
        <xref ref-type="bibr" rid="ref21 ref30 ref31">21, 31, 30</xref>
        ] were the first to investigate intrinsic plagiarism detection based on
style change detection using word frequency classes. Koppel et al. [
        <xref ref-type="bibr" rid="ref18 ref19">18, 19</xref>
        ] and Akiva
and Koppel [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ] propose an unsupervised method to decompose multi-author
documents into authorial threads by applying clustering methods on lexical features.
Tschuggnall et al. [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ] proposed an unsupervised decomposition approach based on grammar
tree representations, whereas Rexha et al. [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] use stylistic features to predict the
number of authors who wrote a text. Bensalem et al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] rely on n-grams to identify author
style changes. Gianella [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] employs Bayesian modeling to split a document by
authorship, Further approaches include that of Graham et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], who utilize neural networks
with several stylometric features.
      </p>
      <p>
        At PAN 2017 [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ], the goal was to find the exact positions of authorship changes.
This task was mostly tackled by using stylometric features to characterize sentences
and paragraphs and detecting boundaries by computing similarities [
        <xref ref-type="bibr" rid="ref14 ref16">14, 16</xref>
        ], or by
applying outlier detection [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. For the binary classification task whether a document is
single-author or multi-author at PAN 2018 [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], the best performing system is a
stacking ensemble classifier based on lexical and syntactical features extracted via multiple
sliding window approaches [
        <xref ref-type="bibr" rid="ref37">37</xref>
        ]. Alternatively, deep learning approaches such as
convolutional neural networks that operate on a character input [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] and recurrent neural
networks operating on parse tree features [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] have been proposed. Other participants
used stylometric features to compute the similarity of sentences and paragraphs to find
homogeneous text segments that correspond to an individual author [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], or as input
to a binary ensemble classifier [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]. In addition, to predict the number of authors of a
multi-author document, at PAN 2019, Nath [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] uses two clustering approaches based
on token frequencies, whereas Zuo et al. [
        <xref ref-type="bibr" rid="ref38">38</xref>
        ] use a classification ensemble based on
lexical, syntactic and word frequency features.
      </p>
      <p>Author 1
Author 1
changes, resulting from at most three different authors.
3.2</p>
      <sec id="sec-2-1">
        <title>Dataset Construction</title>
        <p>
          As with last year’s task [
          <xref ref-type="bibr" rid="ref35">35</xref>
          ], the datasets are based on data taken from StackExchange.
StackExchange is a popular network of Q&amp;A sites, covering a wide range of topics. We
used a dump of the questions and answers on the various StackExchange sites1 as the
basis for our datasets. As a first step, we cleaned this data as follows:
– Removal of questions and answers that contain fewer than 30 characters.
– Removal of questions and answers that were edited by a user different from the one
who originally wrote them.
– Removal of the following items within all questions and answers: images, URLs,
code snippets, block quotes, and bullet lists along with their contents.
        </p>
        <p>After cleaning the data, we constructed two datasets differing in the number of
topics covered to also enable an investigation into how well approaches are able
to deal with topical diversity. For the first dataset, called dataset-narrow, we
used only questions and answers belonging to a subset of the StackExchange sites
that deal with topics related to computer technology.2 For the second dataset, called
dataset-wide, we used a subset of sites covering a wide range of different topics,3
including technology, economics, literature, philosophy, and mathematics.</p>
        <p>For every site in the subset of sites that was used for the creation of a given dataset,
we grouped together all questions and answers written by the same user and split them
into paragraphs, removing paragraphs with fewer than 100 characters. This yielded a
list of paragraphs for every user on a particular site. In a next step, we constructed
the documents making up the dataset. Each dataset contains an equal number of
singleauthor and multi-author documents. For single-author documents, we selected a random
user and drew paragraphs from the paragraph list of that user until the document had a
sufficient length (randomly chosen to be between 1,000 and 3,000 words). For
multiauthor documents, we first randomly chose whether the document should have two
or three authors. Then, we randomly constructed a structure for the document (i.e.,
a sequence of author changes for a set of paragraphs). Based on that, we randomly
chose distinct authors from our list of users and drew paragraphs from their paragraph
lists until the document had the predetermined structure and the chosen length (again,
randomly chosen to be between 1,000 and 3,000 words).</p>
        <p>The resulting documents were then split into training, validation, and test sets with
approximately 50% of the documents being assigned to the training set, and 25% each
being assigned to the validation and test sets. The procedure we used for splitting
ensured that every subset contains approximately the same number of single-author and
multi-author documents. Finally, we filtered all documents based on their language. As
1See https://archive.org/details/stackexchange
2dataset-narrow contains questions and answers from the following sites: Code Review,
Computer Graphics, CS Educators, CS Theory, Data Science, DBA, DevOps, Game Dev,
Network Engineering, Raspberry Pi, Serverfault.com, Superuser.com.
3dataset-wide contains questions and answers from the following sites: Academia,
Astronomy, Bicycles, Biology, Buddhism, Code Review, Coffee, DBA, Earth Science, Economics,
Engineering, Fitness, History, Interpersonal, Linguistics, Literature, Mathoverflow.net, Outdoors,
Philosophy, Serverfault.com, Skeptics, Sports, Travel, Workplace, Worldbuilding.
we want our datasets to consist only of English documents, we removed all documents
where at least one paragraph was identified as being written in a language other than
English. For this, we used the Python library langdetect.4 A summary of the parameters
for both datasets is given in Table 1. Table 2 shows an overview of the created datasets,
including the number of contained documents as well as the average document lengths,
partitioned by the number of authors.</p>
        <p>For development, participants are provided with the documents and ground truth
information. For each training and validation document, we provided the number of
authors, the StackExchange site the texts were gathered from, the order of the authors
within the document, the positions of the style changes, and whether the document was
indeed multi-authored.
3.3</p>
      </sec>
      <sec id="sec-2-2">
        <title>Performance Measures</title>
        <p>To evaluate and compare the submitted approaches, we report both, the achieved
performance for the individual subtasks, and their combination as a staged task. Furthermore,
4https://pypi.org/project/langdetect/
we evaluate the approaches on both datasets individually. Submissions are evaluated
using the F -Measure for each document, where = 1 equally weighs the harmonic
mean between precision and recall. For Task 1, we compute the average F1 measure
across all documents, and for Task 2, we use the micro-averaged F1 measure across all
documents. The submissions for the two datasets are evaluated independently and the
resulting F1 measures for the two tasks are averaged across datasets.
3.4</p>
      </sec>
      <sec id="sec-2-3">
        <title>Evaluation Framework</title>
        <p>
          To ensure the reproducibility of the submitted solutions, participants were asked to
deploy their software on our TIRA platform [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. Each participant was assigned a virtual
machine on TIRA, where the software had to be setup with the only constraint of being
executable via a POSIX command. The web frontend of TIRA allows for configuring
pieces of software that are deployed within an participant’s virtual machine, and to
remotely execute them via an appropriate command. This enabled participants both, to
test their software on the freely available training and validation datasets, as well as
to self-evaluate their software on the test dataset, which is not freely accessible. TIRA
prevents direct access by participants by moving the virtual machine into a secure
sandbox before enabling the a deployed software to process a test dataset. This way, TIRA
enables blind evaluation, thus foreclosing optimization against the test data. Runs
resulting from processing the training, validation, or test data can be evaluated using the
aforementioned evaluation measure at the click of a button.
4
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Survey of Submissions</title>
      <p>For this year’s edition of the style change detection task, we received three
submissions. However, only two participating teams submitted a working notes paper. In the
following, we describe the approaches used in those submissions.
4.1</p>
      <sec id="sec-3-1">
        <title>Mixed Style Feature Representation and B-maximal Clustering</title>
        <p>
          The approach developed by Castro-Castro et al. [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] makes use of a variant of
B0maximal clustering to solve the style change detection task. First, they formulate a
representation for a paragraph as a set of 185 stylometric features, consisting of
characterbased, lexical, and syntactic features, but excluding features which explicitly capture
the semantics of the given text. The features are divided into three different categories:
boolean features, features consisting of a single floating-point number, and features
consisting of vectors of numbers. For each of these categories, a comparison criterion
is defined which expresses whether a given feature of two different paragraphs is
“similar” or not. Then, the similarity between two paragraphs is defined to be the number of
similar features between them.
        </p>
        <p>
          Based on this, B0-maximal clustering is performed to group the paragraphs in a
document into clusters, where every cluster is regarded to be one author. This clustering
approach assigns all paragraphs with a similarity larger than a defined threshold to the
same cluster. Since this makes it possible for a paragraph to be assigned to multiple
clusters, and hence to multiple authors, a basic approach for deciding to which cluster
a paragraph will be assigned is proposed. In such a case, from all possible candidate
clusters, the one which contains the paragraph that occurs earliest in the document is
chosen. Thus, all the paragraphs in a document are assigned to authors. From this, the
tasks posed in this year’s style change detection task are solved as follows: For the first
task, it is simply checked whether the clustering has produced more than one cluster.
For the second task, the positions in the document are identified, where consecutive
paragraphs were assigned to different clusters.
The approach of Iyer and Vosoughi [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] is based on using Google’s BERT language
model [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] as a feature extractor, and random forests as a classifier. First, the documents
contained in the dataset are split into sentences, and every sentence is fed to BERT,
taking the outputs of the last four BERT layers to represent a given sentence. Since the size
of the feature matrix produced by this depends on the number of tokens in a sentence,
the values along the length dimension are summed to obtain a feature matrix of a fixed
length. After this, representations are formulated for consecutive pairs of paragraphs
(to solve the second task), and the whole document (to solve the first task), based on
the representations of sentences, by summing (paragraphs) or averaging (whole
documents) the feature values of the sentences that make up the paragraph or document.
These feature representations are then used to trin random forest models for both tasks.
5
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Evaluation Results</title>
      <p>The results for the participants submissions as well as a random baseline are given in
Table 3. The table shows the F1 score for both tasks, as well as the overall average
scores. Both participants’ submissions significantly outperformed the baseline with
respect to individual and overall score. The best-performing submission is the one by
Iyer and Vosoughi, which achieved the best scores in both tasks as well as in the overall
average score. The approach developed by Castro-Castro et al. performs significantly
better than the random baseline, but also significantly worse than the approach by Iyer
and Vosoughi, forming a middle ground. The approach of Nath5 performs only slightly
worse than that of Castro-Castro et al.
5The participant did not submit their working notes and was hence omitted from further analysis.
1.0
0.8
re0.6
o
c
S
F10.4
0.2
0.0
(d) Topic Diversity</p>
      <sec id="sec-4-1">
        <title>Participant</title>
        <p>Iyer and Vosoughi
Castro-Castro et al.</p>
        <p>(a) Single-author Documents
(b) Multi-author Documents</p>
        <p>Participant
Castro-Castro et al.</p>
        <p>Iyer and Vosoughi</p>
        <p>We further analyzed the performance of both approaches with regard to the specific
properties of the documents in our datasets. First, compared both approaches with
respect to single-author versus multi-author documents. The results for this analysis are
shown in Figures 2a and b. The approach by Iyer and Vosoughi reaches an F1 score of
almost 1:0 for Task 2 on single-author documents. This suggests that it may be
beneficial for them to reduce their approach to one model predicting style changes between
paragraphs, and then calculating predictions for Task 1 based on the output of that
model (i.e., predicting a document to be multi-author if and only if there was at least
one style change predicted between the paragraphs of that document). Another point to
note is that the approach by Castro-Castro et al. performed best for Task 1 on
multiauthor documents. This suggests that their model is especially well-suited for detecting
documents that have been written by more than one author. Moreover, we analyzed how
the performance for both submitted approaches changes depending on the number of
authors. The results for this analysis are shown in Figure 2c, confirming that the
approach of Castro-Castro et al. performs better for multi-author documents, regardless
of whether the number of authors is two or three. It is interesting that Castro-Castro et
al.’s approach improves for multi-author documents, whereas that of Iyer and Vosoughi
performs best for single-author documents, exerting a sharp drop in performance when
a document is written by multiple authors.</p>
        <p>Finally, we analyzed the performance of the participants’ approaches dependent on
topic diversity (see Figure 2d). In most cases, we found a significant difference in
performance between both datasets. The exception to this is the approach by Castro-Castro
et al. on Task 1, where the performance on the narrow and wide datasets are almost
identical. In all other cases, the performance differs significantly, with performance on
the narrow dataset being higher than on the wide dataset, implying that dealing with
documents of a diverse topical variety renders the task more difficult.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>In the 2020 edition of the PAN style change detection task, we asked participants to
answer the following questions for a given document: (1) Given a document, was it written
by multiple authors? (2) For each pair of consecutive paragraphs in a given document,
is there a style change between these paragraphs? Three participants submitted their
systems and two participants submitted a working notes paper. The two approaches
differed fundamentally, the best-performing system relying on semantic features (i.e.,
BERT embeddings), while the second-best approach focused on syntactic ones. Future
challenges include finding the exact position of authorship changes beyond the
paragraph level, and assigning paragraphs to individual authors.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Akiva</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koppel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Identifying distinct components of a multi-author document</article-title>
          . In: Memon,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Zeng</surname>
          </string-name>
          ,
          <string-name>
            <surname>D</surname>
          </string-name>
          . (eds.) 2012
          <source>European Intelligence and Security Informatics Conference, EISIC</source>
          <year>2012</year>
          , Odense, Denmark,
          <source>August 22-24</source>
          ,
          <year>2012</year>
          , pp.
          <fpage>205</fpage>
          -
          <lpage>209</lpage>
          , IEEE Computer Society (
          <year>2012</year>
          ), https://doi.org/10.1109/EISIC.
          <year>2012</year>
          .16, URL https://doi.org/10.1109/EISIC.
          <year>2012</year>
          .16
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Akiva</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koppel</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A generic unsupervised method for decomposing multi-author documents</article-title>
          .
          <source>JASIST</source>
          <volume>64</volume>
          (
          <issue>11</issue>
          ),
          <fpage>2256</fpage>
          -
          <lpage>2264</lpage>
          (
          <year>2013</year>
          ), https://doi.org/10.1002/asi.22924, URL https://doi.org/10.1002/asi.22924
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Bensalem</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chikhi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Intrinsic plagiarism detection using n-gram classes</article-title>
          .
          <source>In: Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)</source>
          , pp.
          <fpage>1459</fpage>
          -
          <lpage>1464</lpage>
          , Association for Computational Linguistics, Doha, Qatar (Oct
          <year>2014</year>
          ), https://doi.org/10.3115/v1/
          <fpage>D14</fpage>
          -1153, URL https://www.aclweb.org/anthology/D14-1153
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Cappellato</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goeuriot</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mandl</surname>
          </string-name>
          , T. (eds.):
          <article-title>CLEF 2017 Evaluation Labs</article-title>
          and Workshop - Working Notes Papers,
          <volume>11</volume>
          -
          <fpage>14</fpage>
          September, Dublin, Ireland, CEUR Workshop Proceedings, CEUR-WS.org (
          <year>2017</year>
          ),
          <source>ISSN 1613-0073</source>
          , URL http://ceur-ws.
          <source>org/</source>
          Vol-1866/
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Cappellato</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nie</surname>
            ,
            <given-names>J.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Soulier</surname>
            ,
            <given-names>L</given-names>
          </string-name>
          . (eds.):
          <article-title>CLEF 2018 Evaluation Labs</article-title>
          and Workshop - Working Notes Papers,
          <volume>11</volume>
          -
          <fpage>14</fpage>
          September, Avignon, France, CEUR Workshop Proceedings, CEUR-WS.org (
          <year>2018</year>
          ),
          <source>ISSN 1613-0073</source>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Castro-Castro</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rodríguez-Lozada</surname>
            ,
            <given-names>C.A.</given-names>
          </string-name>
          , noz, R.M.:
          <article-title>Mixed Style Feature Representation and B-maximal Clustering for Style Change Detection</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Névéol</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Eickhoff</surname>
          </string-name>
          , C. (eds.)
          <article-title>CLEF 2020 Labs and Workshops, Notebook Papers, CEUR-WS</article-title>
          .
          <source>org (Sep</source>
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Devlin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>M.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toutanova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Bert: Pre-training of deep bidirectional transformers for language understanding</article-title>
          . arXiv preprint arXiv:
          <year>1810</year>
          .
          <volume>04805</volume>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Giannella</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>An improved algorithm for unsupervised decomposition of a multi-author document</article-title>
          .
          <source>JASIST</source>
          <volume>67</volume>
          (
          <issue>2</issue>
          ),
          <fpage>400</fpage>
          -
          <lpage>411</lpage>
          (
          <year>2016</year>
          ), https://doi.org/10.1002/asi.23375, URL https://doi.org/10.1002/asi.23375
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Glover</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hirst</surname>
          </string-name>
          , G.:
          <article-title>Detecting stylistic inconsistencies in collaborative writing</article-title>
          .
          <source>In: The New Writing Environment</source>
          , pp.
          <fpage>147</fpage>
          -
          <lpage>168</lpage>
          , Springer (
          <year>1996</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Graham</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hirst</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marthi</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Segmenting documents by stylistic character</article-title>
          .
          <source>Natural Language Engineering</source>
          <volume>11</volume>
          (
          <issue>4</issue>
          ),
          <fpage>397</fpage>
          -
          <lpage>416</lpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Holmes</surname>
            ,
            <given-names>D.I.</given-names>
          </string-name>
          :
          <article-title>The evolution of stylometry in humanities scholarship</article-title>
          .
          <source>Literary and Linguistic Computing</source>
          <volume>13</volume>
          (
          <issue>3</issue>
          ),
          <fpage>111</fpage>
          -
          <lpage>117</lpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Hosseinia</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mukherjee</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>A Parallel Hierarchical Attention Network for Style Change Detection-Notebook for PAN at CLEF 2018</article-title>
          . In: [5]
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Iyer</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vosoughi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Style Change Detection Using BERT</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Névéol</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Eickhoff</surname>
          </string-name>
          , C. (eds.)
          <article-title>CLEF 2020 Labs and Workshops, Notebook Papers, CEUR-WS</article-title>
          .
          <source>org (Sep</source>
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Karas</surname>
            <given-names>´</given-names>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
            , S´ piewak,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sobecki</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>OPI-JSA at CLEF 2017: Author Clustering and Style Breach Detection-Notebook for PAN at CLEF 2017</article-title>
          . In: [4], URL http://ceur-ws.
          <source>org/</source>
          Vol-1866/
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Kestemont</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tschuggnall</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stamatatos</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Daelemans</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Specht</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Potthast</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Overview of the Author Identification Task at PAN-2018: Cross-Domain Authorship Attribution and Style Change Detection</article-title>
          .
          <source>In: Working Notes Papers of the CLEF</source>
          <year>2018</year>
          <article-title>Evaluation Labs</article-title>
          . Avignon, France,
          <source>September 10-14</source>
          ,
          <year>2018</year>
          /Cappellato, Linda [edit.]; et al., pp.
          <fpage>1</fpage>
          -
          <lpage>25</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Khan</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Style Breach Detection: An Unsupervised Detection Model-Notebook for PAN at CLEF 2017</article-title>
          . In: [4], URL http://ceur-ws.
          <source>org/</source>
          Vol-1866/
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Khan</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>A Model for Style Change Detection at a Glance-Notebook for PAN at CLEF 2018</article-title>
          . In: [5]
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Koppel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Akiva</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dershowitz</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dershowitz</surname>
          </string-name>
          , N.:
          <article-title>Unsupervised decomposition of a document into authorial components</article-title>
          .
          <source>In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies</source>
          , pp.
          <fpage>1356</fpage>
          -
          <lpage>1364</lpage>
          , Association for Computational Linguistics, Portland, Oregon, USA (Jun
          <year>2011</year>
          ), URL https://www.aclweb.org/anthology/P11-1136
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Koppel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Akiva</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dershowitz</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dershowitz</surname>
          </string-name>
          , N.:
          <article-title>Unsupervised decomposition of a document into authorial components</article-title>
          . In: Lin,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Matsumoto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Mihalcea</surname>
          </string-name>
          ,
          <string-name>
            <surname>R</surname>
          </string-name>
          . (eds.)
          <article-title>The 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies</article-title>
          ,
          <source>Proceedings of the Conference</source>
          ,
          <volume>19</volume>
          -
          <fpage>24</fpage>
          June,
          <year>2011</year>
          , Portland, Oregon, USA, pp.
          <fpage>1356</fpage>
          -
          <lpage>1364</lpage>
          , The Association for Computer Linguistics (
          <year>2011</year>
          ), URL http://www.aclweb.org/anthology/P11-1136
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Koppel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schler</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Argamon</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Computational methods in authorship attribution</article-title>
          .
          <source>Journal of the American Society for Information Science and Technology</source>
          <volume>60</volume>
          (
          <issue>1</issue>
          ),
          <fpage>9</fpage>
          -
          <lpage>26</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21] Meyer zu Eißen,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Stein</surname>
          </string-name>
          ,
          <string-name>
            <surname>B.</surname>
          </string-name>
          :
          <article-title>Intrinsic Plagiarism Detection</article-title>
          . In: Lalmas,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>MacFarlane</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Rüger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Tombros</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Tsikrika</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Yavlinsky</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.)
          <source>Advances in Information Retrieval. 28th European Conference on IR Research (ECIR 2006), Lecture Notes in Computer Science</source>
          , vol.
          <volume>3936</volume>
          , pp.
          <fpage>565</fpage>
          -
          <lpage>569</lpage>
          , Springer, Berlin Heidelberg New York (
          <year>2006</year>
          ),
          <source>ISBN 3-540-33347-9</source>
          , ISSN 0302-9743, https://doi.org/10.1007/11735106_
          <fpage>66</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Nath</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>UniNE at PAN-CLEF 2019: Style Change Detection by Threshold Based and Window Merge Clustering Methods</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Losada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Müller</surname>
          </string-name>
          , H. (eds.)
          <article-title>CLEF 2019 Labs and Workshops, Notebook Papers, CEUR-WS</article-title>
          .
          <source>org (Sep</source>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Potthast</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gollub</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wiegmann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>TIRA Integrated Research Architecture</article-title>
          . In: Ferro,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Peters</surname>
          </string-name>
          ,
          <string-name>
            <surname>C</surname>
          </string-name>
          . (eds.)
          <article-title>Information Retrieval Evaluation in a Changing World</article-title>
          ,
          <source>The Information Retrieval Series</source>
          , Springer, Berlin Heidelberg New York (
          <year>Sep 2019</year>
          ),
          <source>ISBN 978-3-030-22948-1</source>
          , https://doi.org/10.1007/978-3-
          <fpage>030</fpage>
          -22948-
          <issue>1</issue>
          _
          <fpage>5</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Rexha</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Klampfl</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kröll</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kern</surname>
          </string-name>
          , R.:
          <article-title>Towards a more fine grained analysis of scientific authorship: Predicting the number of authors using stylometric features</article-title>
          . In: Mayr,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Frommholz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Cabanac</surname>
          </string-name>
          ,
          <string-name>
            <surname>G</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the Third Workshop on Bibliometric-enhanced Information Retrieval co-located with the 38th European Conference on Information Retrieval (ECIR</source>
          <year>2016</year>
          ), Padova, Italy, March
          <volume>20</volume>
          ,
          <year>2016</year>
          .,
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <volume>1567</volume>
          , pp.
          <fpage>26</fpage>
          -
          <lpage>31</lpage>
          , CEUR-WS.org (
          <year>2016</year>
          ), URL http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>1567</volume>
          /paper3.pdf
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rangel</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Potthast</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stamatatos</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tschuggnall</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Overview of PAN'16-New Challenges for Authorship Analysis: Cross-genre Profiling, Clustering, Diarization, and Obfuscation</article-title>
          . In: Fuhr,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Quaresma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Larsen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Gonçalves</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Balog</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Macdonald</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Cappellato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          , N. (eds.)
          <string-name>
            <surname>Experimental IR Meets Multilinguality</surname>
          </string-name>
          , Multimodality, and
          <string-name>
            <surname>Interaction</surname>
          </string-name>
          .
          <source>7th International Conference of the CLEF Initiative (CLEF 16)</source>
          , Springer, Berlin Heidelberg New York (
          <year>Sep 2016</year>
          ),
          <source>ISBN 978-3-319-44564-9</source>
          , https://doi.org/10.1007/978-3-
          <fpage>319</fpage>
          -44564-9_
          <fpage>28</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>Safin</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsova</surname>
          </string-name>
          , R.:
          <article-title>Style Breach Detection with Neural Sentence Embeddings-Notebook for PAN at CLEF 2017</article-title>
          . In: [4], URL http://ceur-ws.
          <source>org/</source>
          Vol-1866/
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <surname>Safin</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ogaltsov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Detecting a Change of Style Using Text Statistics-Notebook for PAN at CLEF 2018</article-title>
          . In: [5]
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <surname>Schaetti</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          :
          <article-title>Character-based Convolutional Neural Network for Style Change Detection-Notebook for PAN at CLEF 2018</article-title>
          . In: [5], URL http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2125</volume>
          /
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <surname>Stamatatos</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>Intrinsic Plagiarism Detection Using Character n-gram Profiles</article-title>
          .
          <source>In: Notebook Papers of the 5th Evaluation Lab on Uncovering Plagiarism, Authorship and Social Software Misuse (PAN)</source>
          , Amsterdam, The Netherlands (
          <year>Sep 2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lipka</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Prettenhofer</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Intrinsic Plagiarism Analysis</article-title>
          .
          <article-title>Language Resources and Evaluation (LRE) 45(1</article-title>
          ),
          <fpage>63</fpage>
          -
          <lpage>82</lpage>
          (
          <year>Mar 2011</year>
          ), ISSN 1574-020X, https://doi.org/10.1007/s10579-010-9115-y
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          , Meyer zu Eißen, S.:
          <article-title>Intrinsic Plagiarism Analysis with Meta Learning</article-title>
          . In: Stein,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Koppel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Stamatatos</surname>
          </string-name>
          , E. (eds.) 1st Workshop on Plagiarism Analysis,
          <string-name>
            <given-names>Authorship</given-names>
            <surname>Identification</surname>
          </string-name>
          , and
          <string-name>
            <surname>Near-Duplicate Detection (PAN 2007) at</surname>
            <given-names>SIGIR</given-names>
          </string-name>
          , pp.
          <fpage>45</fpage>
          -
          <lpage>50</lpage>
          (
          <year>Jul 2007</year>
          ),
          <source>ISSN 1613-0073</source>
          , URL http://ceur-ws.
          <source>org/</source>
          Vol-276
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <surname>Tschuggnall</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Specht</surname>
          </string-name>
          , G.:
          <article-title>Countering Plagiarism by Exposing Irregularities in Authors' Grammar</article-title>
          .
          <source>In: Proceedings of the European Intelligence and Security Informatics Conference (EISIC)</source>
          , pp.
          <fpage>15</fpage>
          -
          <lpage>22</lpage>
          , IEEE, Uppsala,
          <source>Sweden (Aug</source>
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <surname>Tschuggnall</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Specht</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Automatic decomposition of multi-author documents using grammar analysis</article-title>
          . In: Klan,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Specht</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Gamper</surname>
          </string-name>
          , H. (eds.)
          <source>Proceedings of the 26th GI-Workshop Grundlagen von Datenbanken</source>
          , Bozen-Bolzano, Italy,
          <source>October 21st to 24th</source>
          ,
          <year>2014</year>
          .,
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <volume>1313</volume>
          , pp.
          <fpage>17</fpage>
          -
          <lpage>22</lpage>
          , CEUR-WS.org (
          <year>2014</year>
          ), URL http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>1313</volume>
          /paper_4.pdf
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <surname>Tschuggnall</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stamatatos</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verhoeven</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Daelemans</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Specht</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Potthast</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Overview of the author identification task at pan-2017: style breach detection and author clustering</article-title>
          .
          <source>In: Working Notes Papers of the CLEF 2017 Evaluation Labs/Cappellato</source>
          , Linda [edit.]; et al., pp.
          <fpage>1</fpage>
          -
          <lpage>22</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <surname>Zangerle</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tschuggnall</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Specht</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Potthast</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Overview of the Style Change Detection Task at PAN 2019</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Losada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Müller</surname>
          </string-name>
          , H. (eds.)
          <article-title>CLEF 2019 Labs and Workshops, Notebook Papers, CEUR-WS</article-title>
          .
          <source>org (Sep</source>
          <year>2019</year>
          ), URL http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2380</volume>
          /
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <surname>Zheng</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>A framework for authorship identification of online messages: Writing-style features and classification techniques</article-title>
          .
          <source>Journal of the American Society for Information Science and Technology</source>
          <volume>57</volume>
          (
          <issue>3</issue>
          ),
          <fpage>378</fpage>
          -
          <lpage>393</lpage>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <surname>Zlatkova</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kopev</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mitov</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Atanasov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hardalov</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koychev</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nakov</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>An Ensemble-Rich Multi-Aspect Approach for Robust Style Change Detection-Notebook for PAN at CLEF 2018</article-title>
          . In: [5], URL http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2125</volume>
          /
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <surname>Zuo</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Banerjee</surname>
          </string-name>
          , R.:
          <article-title>Style Change Detection with Feedforward Neural Networks Notebook for PAN at CLEF 2019</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Losada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Müller</surname>
          </string-name>
          , H. (eds.)
          <article-title>CLEF 2019 Labs and Workshops, Notebook Papers, CEUR-WS</article-title>
          .
          <source>org (Sep</source>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>