<!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>Analyses of Characters in Dramatic Works by Using Document Embeddings</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Faculty of Engineering</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Natural Science</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sabanc University</string-name>
          <email>mehmetyavuz@sabanciuniv.edu</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tuzla Physics Department</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bogazici University</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bebek I_stanbul</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Turkiye</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>Shakespearean tragedies show clear antagonisms and the resolutions are rational which means they obey the Aristotelian unity-ofaction principle. Any tragic play must rely upon its own movement. Therefore, it is complete and there should not be extra characters written only for the sake of resolution, so called "Deus-ex-Machina". In this work, Deus-ex-Machina characters are automatically detected using machine learning methods. We rst train unsupervised Doc2Vec network by using all plays of Shakespeare. Then, we collected all the lines uttered by each character in a separate document and extracted the document vectors. Thus, each character is represented with a vector in the semantic space of Shakespeare. We measure the semantic similarity between characters using the cosine di erence, the angle between normalized vectors of each character document and we observe characters form a cluster. According to this work, it is possible to detect Deus-ex-Machina characters. Examples of strong unity-of-action principle plays could be demonstrated as well as distinct characters. Dis/similar characters between the plays could also be shown.</p>
      </abstract>
      <kwd-group>
        <kwd>Document Embedding</kwd>
        <kwd>Dramatic Works</kwd>
        <kwd>Character Sim- ilarity</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The Shakespearean dramas are the most outstanding examples of theatrical
pieces. Most of the plays show clear antagonisms and the resolutions are very
rational which means the inter-character relations are consistent within the plays.
This is so called the "unity-of-action" principle. Any tragic play must rely upon
its own movement. There was no more need for a Deus-ex-Machina for the stage
of Shakespeare, though there are exceptions. The term is an invention of Greeks,
indicating a weakness according to Aristotle [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. At the end of a play, a distinct
character helps the resolution which violates within the play consistency, or
unity-of-action. According to Aristotle, the solutions of plots should come about
as a result of the plot. Most notable examples follow such an idea. Forming a
rational play is essential to all modern playwriting, therefore it is important to
measure within play consistency. A second important issue is to detect character
similarities among the dramas, if we can match characters between the plays.
In this study, we would like to answer such questions by using contemporary
machine learning algorithms.
      </p>
      <p>
        The above analyses is directly related to the recent state of the eld. The
literary criticism recently meets computerized analysis, [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. The main
inspiration of our analysis is based on the previous works by literary critics, [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. The
current and widely accepted machine learning algorithms frequently used in the
purpose of verifying literary discussion. The other reason behind our interest
is mainly due to the technical advancements. Advance chatbots, conversational
AI helps to generate realistic speeches [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. With the developing machine
learning techniques, nowadays it seems very possible to generate realistic dialogues
for drama, or in other words arti cial literature starts to seem possible [
        <xref ref-type="bibr" rid="ref11 ref25">11,
25</xref>
        ]. There needs quality measures, or evaluation metrics for such texts either of
hand-made or computer generated.
      </p>
      <p>In this paper, we would rstly like to overview our mathematical approach
to have a document vector and then show o the experiments we carried out
on Shakespearean characters as representing each character in a n-dimensional
space. The last section is left to discussions on the characters and the relationship
between the plays.
1.1</p>
    </sec>
    <sec id="sec-2">
      <title>Related Works</title>
      <p>
        The eld of digital humanities (DH) mostly with the quantitative analyses of
literary and cultural studies [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ]. There is speci cally a sub- elds of DH, the
so called "Drametrics", that deals with the quantitative analysis of the literary
genre of drama [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Digital Shakespeare projects have gotten attention since the
2000s [
        <xref ref-type="bibr" rid="ref14 ref6">6, 14</xref>
        ]. The dramatic structures in the form of antagonisms are revealed
by topic modeling algorithms, [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. Machine learning based text analyses are
also carried out for genre classi cations [
        <xref ref-type="bibr" rid="ref1 ref18 ref22 ref25 ref26 ref7">25, 1, 7, 18, 22, 26</xref>
        ]. In literature,
structural elements such as dramatis persone are also analyzed and applications are
developed for further analyses [
        <xref ref-type="bibr" rid="ref19 ref21 ref23 ref24 ref5 ref9">5, 9, 19, 21, 23, 24</xref>
        ].
2
      </p>
      <sec id="sec-2-1">
        <title>Methodology</title>
        <p>
          The method proposed is an unsupervised neural learning algorithm. By this
way, each document can be represented by a document vector. The xed length
representation of each document helps to nd semantic relations between
documents. Similar documents are represented in a similar location in latent space.
The cosine similarity between vectors is used as a measure of similarity.
The document vector extraction is an unsupervised neural operation that
recursively predicts the next word [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. The idea is very similar to language modeling.
By using the context of all the previous input tokens, the next word is predicted
and errors are minimized by using back-propagation [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. The framework is
represented as Figure 1.
        </p>
        <p>For example, the context of given three words, "the", "cat" and "sat", the
next word "on" is predicted. In this framework, every document is mapped
to a unique vector, represented by a column in matrix D and every word is
also mapped to a unique vector, represented by a column in matrix W. In the
experiments, we use concatenation as the method to combine the vectors.</p>
        <p>As an unsupervised process, there needs texts to train such algorithms. After
training, at inference stage, the input texts can be mapped to a N-dimensional
latent space. Semantically similar documents would have similar features, such as
orientation or location. Consistency is important between training and inference
texts, when constructing such latent space.
The cosine similarity of any two N dimensional vector x and y computes
L2normalized dot product,
kxk kyk
The Euclidean (L2) normalization projects the vectors onto the unit sphere, the
angle between normalized vectors is the similarity measure k(x; y).
(1)
3</p>
      </sec>
      <sec id="sec-2-2">
        <title>Experiments</title>
        <p>Training dataset is the collection of Shakespeare dramas. Lines of each play
treated as a document and trained for 40 epochs. A vocabulary is created out
of all the plays. The number of documents is 37, it is low, the texts are long on
average, around 20K. Vector length is 50. We use Gensim-Doc2Vec package.</p>
        <p>At the inference stage, lines uttered by each character treated as a document
and have a xed length vector representation in pretrained semantic space of
Shakespeare.
4</p>
      </sec>
      <sec id="sec-2-3">
        <title>Discussion</title>
        <p>In this section, the characters that have 40 lines or above are chosen for
consistency analyses. The rst subsection is on detection of Deus-ex-Machina
characters in each play. The distinct characters are identi ed in order to analyze the
strength of a play, the unity-of-action principle. The second subsection left to
similar characters between the plays.
4.1</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Unity-of-Action</title>
      <p>Shakespearean comedies as well as tragedies are so strong in terms of dramatic
structures. All can be thought of as Aristotelian. According to Aristotle, a play
consists of complications, crisis and resolution. In the beginning of a play, the
problems occur on protagonists. The crisis is the peak point which all problems
need for a solution. According to Aristotle, the resolution should emerge from
the plot itself. If the resolution comes as an outside force, for instance a Greek
god appears at the end and kills the antagonists and saves the protagonists, this
is so called Deus-ex-Machina. This is a weakness according to Aristotle. The
play should be complete among the chain of events.</p>
      <p>
        By thinking unity-of-action principle, we can assume that all characters in
a play should be related, their speeches should be coherent. In the previous
section, we construct a semantic space in an unsupervised manner by using
Shakespeare's all plays. In this semantic space, similar characters have similar
orientations. The position of the vector of a character has a semantic meaning.
In this semantic space, all characters of a play lie inside a cluster of a play, while
the Deus-ex-Machina characters would be distinct. Since Shakespeare's plays are
in dialog form, as the characters talk to each other, the semantic cluster of a play
forms. Following the conjuncture idea on literature by Moretti, [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], similarly,
this reasoning leads to Deus-ex-Machina conjuncture to be tested,
Conjecture. The semantics of lines uttered by characters are coherent within
the play, except Deus-ex-Machina, if it obeys the unity-of-action principle.
      </p>
      <p>In order to verify above conjecture, the cosine di erence between all
characters is measured in pairs. By this way, similarities of all characters could be
graphed in Figure 2 as a lower triangle. Each row and each column corresponds
to a character, x and y in similarity function k(x; y), respectively. The document
vector projections would be maximized, if there are semantic similarities between
characters. Then, strongly similar characters, the characters that have similarity
close to 1, are represented with reddish colors, while dissimilar characters are
blueish.</p>
      <p>In Figure 2, there graphed six plays by Shakespeare. Bottom row is Macbeth,
Othello and The Tempest, respectively. These are very good examples of
unityof-action principle. Three plays by Shakespeare demonstrate strong semantic
similarity between characters. Each character's dialogues are at least 0.5 related
to the others. Some of the characters are apparently more similar, for example,
two main protagonists Macbeth and Lady Macbeth, in addition to Lady Macbeth
and Banquo. Similarly, Othello and Iago are also intensely related, as well as Iago
and Casio. These character pairs have importance for the play from a dramatic
perspective. Strong semantic similarity is a good indicator.</p>
      <p>
        The top row is Measure for Measure, Merchant of Venice and Richard III.
These plays have a distinct character, who has nearly no semantic similarity with
the rest of the characters. Mariana in Measure for Measure, Duke in Merchant
of Venice and Richmond in Richard III demonstrates a di erence from the rest.
In Richard III, Richmond clearly presents himself as a Deus-ex-Machina, as
drop to resolve the play. Mariana in Measure for Measure also has a similar
function in the play. The Duke in Merchant of Venice is literally a
Deus-exMachina [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. Algorithms identify them successfully. However, the actual
Deusex-Machina that turns tragedy to comedy is the Duke in Measure for Measure.
Algorithms could not be identi ed. It is due to the length of the speeches by the
Duke, 1/3th of the play is his lines. Changing the play from tragedy to comedy
Fig. 2. Within play consistencies are graphed. The rst row is the examples of
Deusex-Machina characters. A single character is di erent than the rest of characters. The
second row shows great plays by Shakespare. Within play consistency is very high,
therefore the dramatic structures are more powerful.
is not his only function in the play. Thus far, we cover a successful identi cation
of a character who breaks the unity-of-action principle and a failure case of the
algorithm.
4.2
      </p>
    </sec>
    <sec id="sec-4">
      <title>Character Similarity between Tragedies</title>
      <p>In order to identify inter-play relations of characters, we measured and graphed
semantic similarities among four plays, Macbeth, Richard III, Merchant of Venice,
Othello, respectively. It is very apparent that within-play consistency is much
denser than inter-play consistency. Each reddish triangle is a play, while the blue
rectangles are inter-play relationships.</p>
      <p>If we examine the dominant colors of rectangles that show inter-play relations,
Macbeth and Merchant of Venice are least related plays, the dominant color is
blue. On the other hand, Merchant of Venice and Othello, as having topics on
revenge, have warmer colors. Besides, Macbeth and Richard III also have warmer
colors, as their topics are mostly on taking the throne. The similarities between
the plays can be observed from the dominant colors.</p>
      <p>There are other observations on Figure 3. Some of the characters are almost
similar to each character in di erent plays. Lady Macdu of Macbeth, Iago of
Othello are examples of such characters, this is probably due to their compatible
nature. In addition to that, Macbeth is dissimilar to all the characters in the
rest of the other plays. Another interesting observation is the Duke in Merchant
of Venice. Although the Duke is dissimilar to everyone within the play, it has
similarities with other characters in other plays.</p>
      <p>All in all, inter-play relations are demonstrated to a certain extent. It is
very crucial to detect similar characters between dramas, for the purpose of
play writing. Characters like Iago are compatible with everyone, while Duke-like
characters can be found in other texts. Character similarities are observable by
the analysis we proposed.
5</p>
      <sec id="sec-4-1">
        <title>Conclusion</title>
        <p>
          Thus far, we cover the analyses on the characters in each play and between the
plays. These two analyses can be useful from the perspective of play writing
as well as arti cial literature. It is kind of hard to have an evaluation metric
for any kind of generative model, however literary criticism helps to identify
basic characteristics of a play. Drama has a well-de ned form that shaped the
beginning with Aristotle. In a previous work, we had identi ed a way of showing
antagonisms, [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ]. Our methodology in this work helps to nd detecting the
characters that break the unity-of-action principle. Inter-play similarities also
gives much insight into the characters.
        </p>
        <p>Richmond in Richard III and The Duke in Merchant of Venice are given
as a successful identi cation of distinct characters. Algorithms almost always
successfully detect these distinct characters, though exceptions. The weakness of
such a method is based on the assumption of the characters. Instead of judging
a character based on the lines, we treat the characters as a whole. All lines
by a character are token and represented in a latent space. This holistic view
of a character fails when dealing with multi-function characters like the Duke
in Measure and Measure. In addition to these detection, the strongly similar
characters are another observation. The most important characters of a play
always show a strong similarity. We also observed that some of the characters
are compatible with every other character. Lady Macdu and Iago are examples.
Other types of characters are dissimilar to every other character in other plays,
such as Macbeth. These observations are very important for the insight into the
plays.</p>
        <p>
          It is important to develop further evaluation metrics for drama. The
generative models have a promising future in terms of dialogs, [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], and Shakespare
wrote only dialog form plays. The writing of a play is possible with the knowledge
of authorship. These metrics can be thought of as knowledge of the authorship
of computers. Aristotle as the rst critic, gives much insight into the authorship
and states that the principle of unity-of-action is the most important feature of
a play.
        </p>
        <p>Acknowledgments This work was supported by grant 12B03P4 of Bogazici
University. The author would like to thank Muhittin Mungan for suggesting
this Master of Science topic as his advisor and Meltem Gurle Mungan for her
kind opinion. The author would also like to thank Prof. Berrin Yan koglu for
reviewing article and actor Gunes Yak n for talks together on Shakespeare.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Ardanuy</surname>
            ,
            <given-names>M. C.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Sporleder</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <article-title>Structure-based clustering of novels</article-title>
          .
          <source>In: Proceedings of the 3rd Workshop on Computational Linguistics for Literature (CLFL)</source>
          , pp.
          <fpage>31</fpage>
          -
          <lpage>39</lpage>
          . Gothenburg, Sweden. (
          <year>2014</year>
          , April).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Aristotle</surname>
          </string-name>
          .
          <source>Aristotle's Poetics. Hill and Wang:</source>
          New York (
          <year>1961</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Clement</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Steger</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Unsworth</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Uszkalo</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <article-title>How not to read a million books</article-title>
          . (
          <year>2008</year>
          ). Available online at http://people.brandeis.edu/ unsworth/hownot2read.html
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Crane</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <article-title>What do you do with a million books? D-Lib Magazine</article-title>
          . (
          <year>2006</year>
          ). Available online at http://www.dlib.org/dlib/march06/crane/03crane.html
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Dennerlein</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <article-title>Measuring the average population densities of plays. A case study of Andreas Gryphius, Christian Weise and Gotthold Ephraim Lessing</article-title>
          . Semicerchio. Rivista di poesia comparata LIII:
          <volume>80</volume>
          {
          <fpage>88</fpage>
          . (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Hirsch</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Craig</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <article-title>"Mingled Yarn": The State of Computing in Shakespeare 2.0</article-title>
          . In T. Bishop, &amp; A.
          <string-name>
            <surname>Huang</surname>
          </string-name>
          (Eds.),
          <source>The Shakespearean International Yearbook</source>
          (Vol.
          <volume>14</volume>
          :
          <string-name>
            <surname>Special</surname>
            <given-names>Section</given-names>
          </string-name>
          , Digital Shakespeares, pp.
          <fpage>3</fpage>
          -
          <lpage>35</lpage>
          ). Ashgate Publishing Limited, United Kingdom. (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hope</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Witmore</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>The Hundredth Psalm to the Tune of "Green Sleeves": Digital Approaches to Shakespeare's Language of Genre</article-title>
          .
          <source>Shakespeare Quarterly</source>
          ,
          <volume>61</volume>
          (
          <issue>3</issue>
          ),
          <fpage>357</fpage>
          -
          <lpage>390</lpage>
          . (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>Jianfeng</given-names>
            <surname>Gao</surname>
          </string-name>
          , Michel Galley: \Neural Approaches to Conversational
          <source>AI"</source>
          ,
          <year>2018</year>
          ; arXiv:
          <year>1809</year>
          .08267.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Krautter</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <article-title>Quantitative microanalysis? Di erent methods of digital drama analysis in comparison</article-title>
          . In: Book of Abstracts,
          <string-name>
            <surname>DH</surname>
          </string-name>
          <year>2018</year>
          .
          <article-title>Mexico-City, Mexico</article-title>
          , pp.
          <fpage>225</fpage>
          -
          <lpage>228</lpage>
          . (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Le</surname>
            , Quoc; Mikolov,
            <given-names>Tomas.</given-names>
          </string-name>
          <article-title>Distributed representations of sentences and documents</article-title>
          . In: Xing,
          <string-name>
            <given-names>Eric P.</given-names>
            and
            <surname>Jebara</surname>
          </string-name>
          , Tony (eds.)
          <source>Proceedings of the 31st International Conference on International Conference on Machine Learning</source>
          , Vol.
          <volume>32</volume>
          , p.
          <fpage>1188</fpage>
          -
          <lpage>1196</lpage>
          . (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Lebrun</surname>
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Who Is the Arti cial Author?</article-title>
          . In:
          <string-name>
            <surname>Mouhoub</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Langlais</surname>
            <given-names>P</given-names>
          </string-name>
          . (eds) Advances in Arti cial Intelligence.
          <source>Canadian AI 2017. Lecture Notes in Computer Science</source>
          , vol
          <volume>10233</volume>
          . Springer, Cham (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Moretti</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <article-title>Conjectures on world literature</article-title>
          . New left review,
          <fpage>54</fpage>
          -
          <lpage>68</lpage>
          (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Moretti</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Distant reading</article-title>
          . 1st edn.
          <source>Verso Books</source>
          , London (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Mueller</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Digital Shakespeare, or towards a literary informatics</article-title>
          .
          <source>Shakespeare</source>
          <volume>4</volume>
          ,
          <fpage>284</fpage>
          -
          <lpage>301</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Ramsay</surname>
          </string-name>
          , S. Reading Machines:
          <article-title>Toward an Algorithmic Criticism</article-title>
          . 1st edn. University of Illinois Press,
          <string-name>
            <surname>Champaign</surname>
            <given-names>IL</given-names>
          </string-name>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Romanska</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Drametrics: what dramaturgs should learn from mathematicians</article-title>
          . In Romanska, M. (ed.),
          <source>The Routledge Companion to Dramaturgy</source>
          , pp.
          <fpage>472</fpage>
          -
          <lpage>481</lpage>
          . Routledge, New York (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Rumelhart</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hinton</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Williams</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <article-title>Learning representations by backpropagating errors</article-title>
          .
          <source>Nature</source>
          <volume>323</volume>
          ,
          <volume>533</volume>
          {
          <fpage>536</fpage>
          (
          <year>1986</year>
          ) doi:10.1038/323533a0
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18. Schoch, Christof. (
          <year>2016</year>
          ).
          <article-title>Topic Modeling Genre: An Exploration of French Classical and Enlightenment Drama</article-title>
          . Digital Humanities Quarterly, (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Schmidt</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burghardt</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dennerlein</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Wol</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <article-title>Katharsis { A Tool for Computational Drametrics</article-title>
          . In: Book of Abstracts,
          <string-name>
            <surname>DH</surname>
          </string-name>
          <year>2019</year>
          .
          <article-title>(</article-title>
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Sennet</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <article-title>The Foreigner: Two Essays on Exile</article-title>
          .
          <source>Notting Hill Editions Ltd</source>
          , London. (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Trilcke</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fischer</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Kampkaspar</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <article-title>Digital Network Analysis of Dramatic Texts</article-title>
          . In: Book of Abstracts,
          <string-name>
            <surname>DH</surname>
          </string-name>
          <year>2015</year>
          . Sidney, Australia. (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Underwood</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Black</surname>
            ,
            <given-names>M.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Auvil</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Capitanu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <article-title>Mapping mutable genres in structurally complex volumes</article-title>
          .
          <source>IEEE International Conference on Big Data</source>
          ,
          <fpage>95</fpage>
          -
          <lpage>103</lpage>
          . (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Wilhelm</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burghardt</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Wol</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          \
          <article-title>To See or Not to See" - An Interactive Tool for the Visualization and Analysis of Shakespeare Plays</article-title>
          . In R. FrankenWendelstorf, E. Lindinger, and J.
          <string-name>
            <surname>Sieck</surname>
          </string-name>
          (Eds.),
          <source>Kultur und Informatik: Visual Worlds &amp; Interactive Spaces. Gluckstadt: Verlag Werner Hulsbusch</source>
          , pp.
          <volume>175</volume>
          {
          <fpage>185</fpage>
          . (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Xanthos</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pante</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rochat</surname>
            ,
            <given-names>Y</given-names>
          </string-name>
          and Grandjean,
          <string-name>
            <surname>M. Visualising</surname>
          </string-name>
          <article-title>the dynamics of character networks</article-title>
          .
          <source>In: Book of Abstracts</source>
          ,
          <string-name>
            <surname>DH</surname>
          </string-name>
          <year>2016</year>
          . Krakow, Poland, pp.
          <fpage>417</fpage>
          -
          <lpage>419</lpage>
          . (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Yavuz</surname>
            ,
            <given-names>M. C.</given-names>
          </string-name>
          :
          <article-title>Analyses of Literary Texts by Using Statistical Inference Methods</article-title>
          .
          <source>In: Proceedings of the Sixth Italian Conference on Computational Linguistics</source>
          , CLiCit'
          <fpage>19</fpage>
          .
          <string-name>
            <surname>Bari</surname>
          </string-name>
          , Italy. (
          <year>2019</year>
          ,
          <article-title>November), CEUR-WS</article-title>
          .org, online http://ceur-ws.org/Vol2481/paper75.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <article-title>An evaluation of text classi cation methods for literary study</article-title>
          .
          <source>Literary and Linguistic Computing</source>
          <volume>23</volume>
          (
          <issue>3</issue>
          ):
          <fpage>327</fpage>
          -
          <lpage>343</lpage>
          . (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>