<!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>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Tsvetomila Mihaylova</string-name>
          <email>tsvetomila.mihaylova@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Georgi Karadjov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yasen Kiprov</string-name>
          <email>yasen.kiprov@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Georgi Georgiev</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ivan Koychev</string-name>
          <email>koychev@fmi.uni-sofia.bg</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Preslav Nakov</string-name>
          <email>pnakov@qf.org.qa</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculty of Mathematics and Informatics, Sofia University “St. Kliment Ohridski”</institution>
          ,
          <country country="BG">Bulgaria</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Qatar Computing Research Institute</institution>
          ,
          <addr-line>HBKU</addr-line>
          ,
          <country country="QA">Qatar</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2016</year>
      </pub-date>
      <abstract>
        <p>The anonymity of a text's writer is an important topic for some domains, such as witness protection and anonymity programs. Stylometry can be used to reveal the true author of a text even if s/he wishes to hide his/her identity. In this paper, we present our approach for hiding an author's identity by masking their style, which we developed for the Author Obfuscation task, part of the PAN-2016 competition. The approach consists of three main steps: the first one is an evaluation of different metrics in the text that can indicate authorship; the second one is application of various transformations, so that those metrics of the target text are adjusted towards the average level, while still keeping the meaning and the soundness of the text; as a final step, we are adding random noise to the text. Our system showed the best performance for masking the author style.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>Stylometry is a well-studied topic. Detecting the author style in particular, has been
studied for years and different approaches have been explored.</p>
      <p>However, the reverse process, i.e., hiding the style of an author, is less explored. It
has a lot of challenges, not only the author style has to be hidden, but the text needs to
remain grammatically correct and the meaning of the original text needs to be preserved.</p>
      <p>
        The PAN-2016 [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] Author Obfuscation task [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] is divided into two subtasks -
Author Masking and Obfuscation Evaluation. The Author Masking task seeks for solutions
solving the following problem: “Given a document, paraphrase it so that its writing
style does not match that of its original author, anymore.” The documents given for
obfuscation have to be split into parts of up to 50 words each and each part is then
subject to obfuscation. The outcome is evaluated by three criteria: safety, i.e., whether
the author verification systems can detect the author from the obfuscated text;
soundness, which measures whether the result is entailed from the original, and sensibleness,
which checks whether the obfuscated text is meaningful. The latter two were evaluated
with peer review. The Obfuscation Evaluation subtask asks the participants to propose
automated measures for evaluation of the first subtask. Measures for one or more of the
criteria can be suggested. We have participated in both subtasks.
      </p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Author identification is a well-studied topic. For instance Juola et al., 2011 [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]
analyzed the features in JGAAP (Java Graphical Authorship Attribution Program) and built
a model using them, e.g., words, parts of speech, characters, and word bi-grams.
      </p>
      <p>
        Author Identification has been explored as a task at the PAN competition since 2011.
The PAN-2015 task description paper [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] summarizes the approaches and features
used for author identification. Among the most used features are the lengths of words,
sentences, and paragraphs, type-token ratios, hapax legomena, character n-grams
(including unigrams), words, punctuation marks, stopwords, part of speech n-grams. Other
features analyze the text more deeply by checking style and grammar.
      </p>
      <p>
        Kacmarcik et al. 2006 [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] explored author masking by detecting the most used
words by the author and trying to change them. They also mention the application of
machine translation as a possible approach for author obfuscation. Some authors
describe using machine translation as a means for author obfuscation ([
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ])
(translating passages of text from English to one or more other languages and then back to
English). Brennan et al. 2012 [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] investigate three different approaches for adversarial
stylometry: obfuscation (masking author style), imitation (trying to copy another
author’s style) and machine translation. They have summarized the features people use
most when trying to obfuscate their own writing style.
      </p>
      <p>
        Juola et al. 2011 [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] experiment with different techniques for author obfuscation.
Their system consists of three main modules - canonization (unifying case,
normalizing whitespaces, spelling correction, etc.), event set determination (extraction of events
significant for author detection, such as words, parts of speech bi- or tri- grams, etc.),
statistical inference (measures that determine the results and confidence in the final
report). The same authors used this approach ([
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]) to detect deliberate style obfuscation.
Some other features used for author recognition are personal pronouns, sentence length,
unique words, and parts of speech ([
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]).
      </p>
      <p>In our work here, we study most of the features mentioned by the research described
above in order to mask the author style, i.e., to address the Author Masking task.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Method</title>
      <p>
        Our approach measures some of the most significant features of the text used for author
identification as mentioned in the work of Brennan et al. 2012 [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. After that we apply
transformations that change the calculated metrics, so the text has average values for
the aforementioned metrics.
      </p>
      <p>
        The system consists of three main parts. First, we calculate “average” metrics based
on the training corpus provided for the Author Obfuscation task and a corpus of several
public domain books from Project Gutenberg [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Having the average metrics, before
transforming each document, we calculate the corresponding metrics for it. Then
transformation for each metric is applied, depending on whether its value is below or above
the calculated average. After the targeted transformations are applied, additional
transformations are added to transform the text beyond the target metrics. We chose very safe
transformations, so that the text would not change its meaning. We used dictionaries to
transform abbreviations, equations, and short forms to their text alternatives.
3.1
      </p>
      <sec id="sec-3-1">
        <title>Calculating text metrics</title>
        <p>
          We used the following metrics:
1. Average sentence word count;
2. Punctuation to word count ratio;
3. Stop words to word count ratio;
4. Type-token ratio;
5. POS to word count ratio: measured for four part-of-speech groups: nouns, verbs,
adjectives, and adverbs; we used the Python NLTK [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] with Universal Tagset for
part of speech tagging;
6. Words in all capital letters to word count ratio;
7. Count of each word in the text.
        </p>
        <p>
          We calculate “average values” that were obtained by calculating the average for the
above metrics on the training corpus and a corpus of several public domain books from
Project Gutenberg [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. Before splitting each document in parts to be obfuscated, we
calculate the above measures for it. For each part, we compare the document measure
values of the calculated averages and we apply transformations to increase the value if
it is below the corresponding average, or to decrease it when it is above it.
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Modulizing the text</title>
        <p>The given texts are split into parts of up to 50 words each, according to the task
requirements. First, the text is split into sentences using the NLTK sentence splitter. Each part
of the text was obtained by merging sentences while the sample had less than 50 words.
We ignored paragraph separation for this splitting.
3.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>Text Transformations</title>
      </sec>
      <sec id="sec-3-4">
        <title>1. Splitting or merging sentences</title>
        <p>If the average sentence length of the whole document is below the average, we
perform merging of the sentences for each text part. We merge all the sentences for a
given text part into one sentence. Merging is done by adding a random connecting
word (and, as, yet) and randomly inserting punctuation - comma (,) or semicolon
(;). When the average sentence length of the entire document is above the average,
we split the sentence into shorter ones. We use a simple sentence splitting
algorithm: We go through all POS-tagged words in the text, and we count the nouns
and the verbs. When we reach a conjunction and, if the sentence so far contains a
noun and a verb, we replace the and with a comma (,) and we capitalize the next
word’s initial as it will now start a new sentence.</p>
      </sec>
      <sec id="sec-3-5">
        <title>2. Stop Words</title>
        <p>Stop words can be strong indicators for author identification due to the fact that
some authors have the tendency to use specific stop words or to have specific stop
words to other words ratio. Thus, we perform two kinds of transformations
regarding stop words:
– Removing stop words that carry little to no information.
– Replacing stop words with their alternatives or with a phrases with the same
meaning.</p>
      </sec>
      <sec id="sec-3-6">
        <title>3. Spelling</title>
        <p>The spelling score of a document is high if there are no spelling mistakes, and low
when there are some.
– To increase the spelling score we apply spelling correction. The spell-checker
uses a probability model and a previously mentioned corpus from publicly-available
books.
– To decrease the score, we use a dictionary to insert common mistakes in the
text. The aforementioned dictionary was manually created using data from various
sources.</p>
      </sec>
      <sec id="sec-3-7">
        <title>4. Punctuation</title>
        <p>If the punctuation use is above average, we remove all punctuation used within the
sentence. This is limited to the symbols comma (,), semicolon (;) and colon (:) If
the punctuation use is bellow average, we apply two techniques to improve that
score:
– We randomly insert comma or semicolon before prepositions. We insert comma
with a higher probability then for inserting semicolon.
– We insert redundant symbols using the following schema:
! can be replaced with one of [!, !!, !!!]
? can be replaced with one of [?, ??, ???, ?!?, !?!]</p>
      </sec>
      <sec id="sec-3-8">
        <title>5. Word Substitution</title>
        <p>
          In order to change the ratio of unique words, we replace the most or the least
common words. Replacement is done with synonyms, hypernyms or word descriptions
from WordNet [
          <xref ref-type="bibr" rid="ref15 ref5">5,15</xref>
          ].
        </p>
        <p>If the document type-token ratio is above average, most words used in the document
are randomly replaced with their synonym or hypernym. If the unique words ration
in the document is below average, we randomly replace the least used words with
their definition from WordNet.</p>
      </sec>
      <sec id="sec-3-9">
        <title>6. Paraphrase Corpus</title>
        <p>
          We randomly replace phrases from the text with their substitutions from a
paraphrase corpus. We use the short version of the phrasal corpus of PPDB, or the
Paraphrase Database ([
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]). This transformation appeared to be very useful for the
results. By changing small phrases, the meaning of the text was still preserved, and
there was an improvement in changing the metrics for unique work count and parts
of speech.
        </p>
      </sec>
      <sec id="sec-3-10">
        <title>7. Uppercase Words</title>
        <p>For decreasing the uppercase words ratio, we only transform words that are all
upper case and are longer then three symbols. We assume that if the word is in
upper case and is shorter then three symbols, it is an acronym and thus is supposed
to stay in uppercase. The transformation is straightforward: all uppercase letters are
substituted with lowercase ones.
3.4</p>
      </sec>
      <sec id="sec-3-11">
        <title>Noise</title>
        <p>After the transformations are added to mask the author identification features, we apply
some transformations that insert some noise in the text.</p>
      </sec>
      <sec id="sec-3-12">
        <title>1. Switching British and American English</title>
        <p>Randomly changing words from British to American English and vice versa. The
words are taken from a vocabulary.</p>
      </sec>
      <sec id="sec-3-13">
        <title>2. Inserting random functional words</title>
        <p>Randomly selected functional words are inserted in the beginning of the sentence.</p>
        <p>The words are taken from a discourse marker vocabulary.
3.5</p>
      </sec>
      <sec id="sec-3-14">
        <title>General Transformations</title>
        <p>We also apply some general transformations that would keep the meaning of the text,
but would mask the author style.</p>
      </sec>
      <sec id="sec-3-15">
        <title>1. Replacing short forms</title>
        <p>We replace short forms such as I’ve, I’d, I’m, I’ll, don’t, etc. with their full forms.</p>
      </sec>
      <sec id="sec-3-16">
        <title>2. Replacing numbers with words</title>
        <p>We replace the parts of the text, POS-tagged as numbers, with their word
representation in English.</p>
      </sec>
      <sec id="sec-3-17">
        <title>3. Replacing equations</title>
        <p>As there were some examples of scientific text in the training corpus, if the text
contains equations, the operations in them are being replaced with words. The
equations are captured if the text contains both comparing and inner equation symbols:
".[&lt;&gt;=]+." and ".[\+\-\*\/]+."
The following symbols are being replaced if an equation is found: + (plus), -
(minus), * (multiplied by), / (divided by), = (equals), &gt; (greater than), &lt; (less than),
&lt;= (less than or equal to), &gt;= (greater than or equal to).</p>
      </sec>
      <sec id="sec-3-18">
        <title>4. Replace symbols and abbreviations with words</title>
        <p>We replace symbols and abbreviations with their word representations. Such
symbols are currency symbols, % (percent), @ (at), abbreviations of person titles (such
as Prof., Mr., Dr., etc.).</p>
      </sec>
      <sec id="sec-3-19">
        <title>5. Simple transformations with regular expressions</title>
        <p>Possessions are replaced with their short forms:
"(\w+) of (\w+)"
is replaced with
"\2’s \1"
This will slightly change the stop words rate and also could obfuscate some specific
manner of writing as the first method of describing possessions is not commonly
used.
3.6</p>
      </sec>
      <sec id="sec-3-20">
        <title>Experiments with Machine Translation</title>
        <p>
          We also experimented with applying machine translation as described in [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. We
translate from English to two languages (Croatian and Estonian) and then back to English.
Microsoft Translation API is used for the translations.
        </p>
        <p>The measured results in Section 4 show that the transformations we are applying
work better for most of the metrics and are comparable to changing the metrics for
parts of speech. Manual evaluation of the text obtained with machine translation show
that very often the meaning of the obfuscated text differs from the original text.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Evaluation and Discussion</title>
      <p>There is no adequate metric that could automatically measure the soundness of the text,
but we can evaluate how much text metrics had changed after the obfuscation process.</p>
      <p>Table 1 shows the average values calculated on the training set and on the books
from the Project Gutenberg corpus that we used. For each measure, the average from
all the documents in the training set is displayed: before and after obfuscation. The
average change rate from all documents is shown, as well as the minimum and the
maximum change rate from the documents in the training set.</p>
      <p>
        We have compared the results from the transformations described in Section 3
with machine translation. Table 1 shows the results: average, minimum and maximum
change from the custom transformations. Table 2 shows the same measures of the
obfuscation with machine translation. We can see that our transformations work better
than just applying two-way machine translation for changing the measured indicators
of item style. Machine translation has close values for the part of speech ratio and is
better than verb ratio.
Participant PAN 2013 PAN 2014 EE PAN 2014 EN PAN 2015
Mihaylova et al. (our system) -0.10 -0.13 -0.16 -0.11
Keswani et al. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] -0.09 -0.11 -0.12 -0.06
Mansoorizadeh et al. [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] -0.05 -0.04 -0.03 -0.04
Table 3. Average performance drops in terms of ‘final scores’ of the authorship verifiers
submitted at PAN 2013 to PAN 2015 when run on obfuscated versions of the corresponding test datasets
as per the submitted obfuscators. The smaller the number (i.e., the higher the performance drop),
the better.
      </p>
      <p>
        The results from the evaluation of the Author Obfuscation task authors [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] are
shown in Table 4. Our system performs best in terms of fooling the state-of-the-art
systems that participated in the Author Identification tasks in the previous years.
      </p>
      <p>The metrics that change the most are the average sentence length and the
punctuation to word count rate. The metrics whose values changed the least are the rates of the
different parts of speech: nouns, verbs and adjectives and unique words.</p>
      <p>The soundness of the obfuscated texts was checked manually for randomly selected
documents from the corpus. The observations are that after applying the transformations
mentioned above, the result text is close to the meaning of the original. The most
useful transformations were word replacement using the paraphrase corpus and WordNet.
Splitting and merging sentences also contributes to changing the author style. Insertion
of random noise - spelling and punctuation mistakes - lowers the quality of the resulting
text, but contributes to changing the measures used for author identification.</p>
      <p>After the submission, we further checked our results for sensibleness and noticed
that some of the transformations were applied too often and resulted in tests of lower
quality. These are replacements of numbers, replacement of words with their definitions
from WordNet, insertion of too many spelling and punctuation errors. Lowering those
transformations improves the quality of the resulting texts.</p>
    </sec>
    <sec id="sec-5">
      <title>Obfuscation Evaluation</title>
      <sec id="sec-5-1">
        <title>Evaluation Metrics</title>
        <p>For the Obfuscation Evaluation subtask, we provide metrics for safety and soundness.</p>
        <p>The metrics used for safety measure how much each of the metrics has changed in
the obfuscated text compared to the original text. We are giving the metric as follows:
|original_value-obfuscated_value| / original_value
or 0 if the metric value for the original text is 0. The metrics for safety are the difference
in the metrics described in the previous chapters.</p>
        <p>
          One metric for measuring soundness is proposed. It measures the semantic
similarity between the original and the obfuscated text. We measure this for all of the text parts
and we use the average as a metric for the obfuscated document ([
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]). The similarity
is a measure for each original-obfuscation pair. The similarity between two text parts is
measured as a weighted sum of their semantic similarity and word order similarity. The
semantic similarity between the two texts is measured as the cosine distance between
their semantic vectors. For calculation of the semantic vectors, the union of all words
in the two texts is taken. The sentence is passed in as a collection of words. The size
of the semantic vector is the same as the size of the joint word set. The elements are
1 if a word in the sentence already exists in the joint word set, or the similarity of the
word to the most similar word in the joint word set if it does not. Word order similarity
computes the word order vector for a sentence. The sentence is passed in as a sequence
of words. The size of the word order vector is the same as the size of the joint word
set. The elements of the word order vector are the position mapping (from the windex
dictionary) of the word in the joint set if the word exists in the sentence. If the word
does not exist in the sentence, then the value of the element is the position of the most
similar word in the sentence. However, our experiments showed that this metric works
too slowly and we did not include it in the final evaluation of the systems.
5.2
        </p>
      </sec>
      <sec id="sec-5-2">
        <title>Results from Peer Review</title>
        <p>Part of our task was to evaluate the results of the systems for all participants who
submitted results for the Author Obfuscation task. This subsection shows our results from
this evaluation.</p>
        <p>We measure the three dimensions specified in the task: safety, soundness and
sensibleness.</p>
        <p>Soundness and sensibleness are measured manually. We get random samples of
original-obfuscation pairs and we count the pairs that correspond to the given metric.</p>
        <p>
          Safety is measured in two ways. The first one is running the system GLAD [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], one
of the best systems for author identification from PAN-2015 [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. The results from the
original texts were compared with the results for the obfuscation of each participant.The
model was trained on the PAN-2015 corpus for English.
        </p>
        <p>The second way was by using our approach, which measures the change in the
metrics mentioned in the previous sections, which are commonly used for author
identification: parts of speech ratio, type-token ratio, average sentence length, punctuation
rate, rate of words in all capital letters.</p>
        <p>The submissions were anonymized for the evaluation. The participant team names
were replaced with “Participant A”, “Participant B” and “Participant C”. Our results for
each of the participants is shown below.
– Safety</p>
        <p>This participant performs worst in terms of safety. The results from the
evaluation with author identification software as well as with custom metrics show
that they have the least change of the values output by the evaluations.
– Soundness</p>
        <sec id="sec-5-2-1">
          <title>Sound Not Sound Total 212 13 225</title>
          <p>– Sensibleness
– Overall thoughts</p>
          <p>Overall the documents are not obfuscated except for several phrases. The phrases
that are switched often do not carry the same meaning and/or are out of
context. There are occasional grammatical errors. The obfuscation is sound and
sensible, but one can detect the style of the original author.</p>
        </sec>
      </sec>
      <sec id="sec-5-3">
        <title>2. Participant B: keswani:2016 [12]</title>
        <p>– Safety</p>
        <p>This participant performs second best in terms of safety.
– Soundness</p>
      </sec>
      <sec id="sec-5-4">
        <title>3. Participant C: mihaylova:2016 (our system)</title>
        <p>– Overall thoughts</p>
        <p>The texts are obfuscated, but almost all of them do not make any sense. The
obfuscation is neither sound, nor sensible.
– Safety</p>
        <p>This participant (i.e., our system) performs best in terms of safety. They achieve
the highest scores from both author obfuscation software and custom metrics.
– Soundness</p>
        <sec id="sec-5-4-1">
          <title>Sound Not Sound Total 200 2 202</title>
        </sec>
        <sec id="sec-5-4-2">
          <title>Sensible Not Sensible Total 100 100 200</title>
          <p>– Overall thoughts</p>
          <p>The text is safe as the author’s style is masked. Most of text fragments preserve
the meaning of the original text. Grammatical mistakes and typos are common
and one could tell that the text is obfuscated. Some phrases are out of context.
5.3</p>
        </sec>
      </sec>
      <sec id="sec-5-5">
        <title>Results for Safety</title>
        <sec id="sec-5-5-1">
          <title>We show the results from our evaluation of safety.</title>
        </sec>
      </sec>
      <sec id="sec-5-6">
        <title>Evaluation with author identification software</title>
        <p>
          We ran one of the best-performing systems of the PAN-2015 Author Identification
task - GLAD [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. We trained it on the training set from PAN-2015, then we used as
test sets the original texts and the texts obfuscated with each of the given systems for
participants A, B and C.
        </p>
        <p>We measured how much the prediction changes for each document and then we get
the average, the maximum and the minimum change per participant. The results are
given in Table 5.3.</p>
      </sec>
      <sec id="sec-5-7">
        <title>Evaluation with custom metrics</title>
        <p>For this part of the evaluation of safety, we measure how much each of the
metrics we use has changed for each of the obfuscated documents. Then we compare the
average, min and max change for each participant. Table 5.3 shows the results of this
evaluation. Participant A does not have any metric for which they have the max average
change. Participant B has a max average change for noun, verb, punctuation rate and
unique words rate. Participant C has a max average change for adjectives and adverbs
rates, stop words rate, average sentence length and words in all capital letters.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusion and Future work</title>
      <p>We have described the system of the Sofia University’s mihaylova16 team for the
PAN2016 Author Obfuscation task. Our main approach is based on measuring popular text
characteristics used for Author Identification and applying transformations aiming to
change those measures for the given text.</p>
      <p>Further development includes adding more features used for author identification.
The existing transformations should be improved in terms of producing more
meaningful text.</p>
      <p>The task requirements included splitting the text into smaller parts and applying
obfuscation on those parts, and we have implemented transformations suitable for such
smaller text parts. We would like to try experiment with transformations that could be
applied to the entire text or to paragraphs, which is closer to the way people transform
texts.</p>
      <p>What our approach is lacking is a proper evaluation measure about whether it
performs well in terms of soundness; designing one is a challenging but necessary and
enabling research direction.</p>
      <p>Finally, we plan to use the techniques used in this paper for author imitation. One
key difference will be that the goal for the transformations should not be the average
metrics, but the metrics of the author that should be imitated.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>This research was performed by a team of students from MSc programs in Computer
Science in the Sofia University “St Kliment Ohridski”.</p>
      <p>We thank the Sofia University “St Kliment Ohridski” for the support and guidance
to our team participation at the CLEF 2016 Conference.</p>
    </sec>
    <sec id="sec-8">
      <title>Appendix 1 - Project Gutenberg books</title>
      <p>– The Adventures of Sherlock Holmes by Sir Arthur Conan Doyle
– History of the United States by Charles A. Beard and Mary R. Beard
– Manual of Surgery Volume First: General Surgery by Alexis Thomson and
Alexander Miles. Sixth Edition.
– War and Peace, by Leo Tolstoy</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Afroz</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brennan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Greenstadt</surname>
          </string-name>
          , R.:
          <article-title>Detecting hoaxes, frauds, and deception in writing style online</article-title>
          .
          <source>In: Proceedings of the 2012 IEEE Symposium on Security and Privacy</source>
          . pp.
          <fpage>461</fpage>
          -
          <lpage>475</lpage>
          . SP '12, IEEE Computer Society, Washington, DC, USA (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Balog</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <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>Macdonald</surname>
          </string-name>
          , C. (eds.):
          <article-title>CLEF 2016 Evaluation Labs</article-title>
          and Workshop - Working Notes Papers,
          <fpage>5</fpage>
          -
          <lpage>8</lpage>
          September, Évora, Portugal. CEUR Workshop Proceedings, CEUR-WS.org (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Bird</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Klein</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Loper</surname>
            ,
            <given-names>E.: Natural</given-names>
          </string-name>
          <string-name>
            <surname>Language Processing with Python. O'Reilly Media</surname>
          </string-name>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Brennan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Afroz</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Greenstadt</surname>
          </string-name>
          , R.:
          <article-title>Adversarial stylometry: Circumventing authorship recognition to preserve privacy and anonymity</article-title>
          .
          <source>ACM Trans. Inf. Syst. Secur</source>
          .
          <volume>15</volume>
          (
          <issue>3</issue>
          ),
          <volume>12</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>12</lpage>
          :
          <fpage>22</fpage>
          (Nov
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Fellbaum</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>WordNet: An Electronic Lexical Database</article-title>
          . Bradford
          <string-name>
            <surname>Books</surname>
          </string-name>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Ganitkevitch</surname>
          </string-name>
          , J.,
          <string-name>
            <surname>Van Durme</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Callison-Burch</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>PPDB: The paraphrase database</article-title>
          .
          <source>In: Proceedings of NAACL-HLT</source>
          . pp.
          <fpage>758</fpage>
          -
          <lpage>764</lpage>
          . Atlanta,
          <string-name>
            <surname>Georgia</surname>
          </string-name>
          (
          <year>June 2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hart</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Project gutenberg</article-title>
          .
          <source>Project Gutenberg</source>
          (
          <year>1971</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8. Hürlimann and
          <string-name>
            <given-names>Benno</given-names>
            <surname>Weck</surname>
          </string-name>
          and
          <article-title>Esther van den Berg and Simon Suster</article-title>
          and
          <string-name>
            <given-names>Malvina</given-names>
            <surname>Nissim</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          : Glad:
          <article-title>Groningen lightweight authorship detection</article-title>
          .
          <source>In: CLEF</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Juola</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Detecting stylistic deception</article-title>
          .
          <source>In: Proceedings of the Workshop on Computational Approaches</source>
          to Deception Detection. pp.
          <fpage>91</fpage>
          -
          <lpage>96</lpage>
          . Avignon, France (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Juola</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vescovi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <source>Advances in Digital Forensics VII: 7th IFIP WG 11</source>
          .9 International Conference on Digital Forensic, chap. Analyzing Stylometric Approaches to Author Obfuscation, pp.
          <fpage>115</fpage>
          -
          <lpage>125</lpage>
          . Orlando, FL, USA (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Kacmarcik</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gamon</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Obfuscating document stylometry to preserve author anonymity</article-title>
          .
          <source>In: Proceedings of COLING/ACL: Poster Sessions</source>
          . pp.
          <fpage>444</fpage>
          -
          <lpage>451</lpage>
          . Sydney,
          <string-name>
            <surname>Australia</surname>
          </string-name>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Keswani</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trivedi</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mehta</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Majumder</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Author Masking through Translation-Notebook for PAN at CLEF 2016</article-title>
          . In: Balog et al. [
          <volume>2</volume>
          ]
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McLean</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bandar</surname>
            ,
            <given-names>Z.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>O'Shea</surname>
            ,
            <given-names>J.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Crockett</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Sentence similarity based on semantic nets and corpus statistics</article-title>
          .
          <source>IEEE Trans. on Knowl. and Data Eng</source>
          .
          <volume>18</volume>
          (
          <issue>8</issue>
          ),
          <fpage>1138</fpage>
          -
          <lpage>1150</lpage>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Mansoorizadeh</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rahgooy</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aminiyan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eskandari</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Author Obfuscation using WordNet and Language Models-Notebook for PAN at CLEF 2016</article-title>
          . In: Balog et al. [
          <volume>2</volume>
          ]
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Miller</surname>
            ,
            <given-names>G.A.</given-names>
          </string-name>
          :
          <article-title>WordNet: A lexical database for English</article-title>
          .
          <source>Commun. ACM</source>
          <volume>38</volume>
          (
          <issue>11</issue>
          ),
          <fpage>39</fpage>
          -
          <lpage>41</lpage>
          (
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Potthast</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hagen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Author Obfuscation: Attacking State-of-the-Art Authorship Verification Approaches</article-title>
          .
          <source>In: Working Notes Papers of the CLEF</source>
          <year>2016</year>
          <article-title>Evaluation Labs</article-title>
          .
          <article-title>CLEF and CEUR-WS.org (</article-title>
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Quirk</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brockett</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dolan</surname>
            ,
            <given-names>W.:</given-names>
          </string-name>
          <article-title>Monolingual machine translation for paraphrase generation</article-title>
          .
          <source>In: Proceedings of EMNLP 2004</source>
          . pp.
          <fpage>142</fpage>
          -
          <lpage>149</lpage>
          . Barcelona,
          <string-name>
            <surname>Spain</surname>
          </string-name>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <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>Verhoeven</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Juola</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>López-López</surname>
            ,
            <given-names>A.</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 author identification task at PAN 2015</article-title>
          . In: CLEF (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>