<!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>Toward a Treebank Collecting German Aesthetic Writings of the Late 18th Century</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alessio Salomoni</string-name>
          <email>alessio.salomoni@unibg.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Bergamo-Pavia Corso Strada Nuova 65 Pavia, Italy</institution>
          ,
          <addr-line>27100</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>English. In this paper, I will describe the methodology to develop the first sample of a dependency treebank collecting German aesthetic writings of the late 18th century. A gold standard of the target data was annotated in order to evaluate some datadriven tools, trained on contemporary web news. Results are reported and discussed.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        A constantly increasing amount of digital texts
of the German literary history is freely available
online as downloadable raw texts, especially
thanks to important ongoing projects, such as
deutschestextarchiv.de or zeno.org, to name but
a few. In spite of this, we still lack annotated
corpora gathering them per author and genre.
Indeed, this is a strong bottleneck in
exploiting such textual treasure for linguistic analysis
through computational methods. At the same
time, available training data for data-driven
annotation tools mainly come from the domain
of contemporary web news. Therefore, models
have to be trained on this particular variety of the
German language, which could be very different,
in terms of linguistic features, from the target
unannotated data. Such variation between the
training set and the test set could cause tools’
performances to drop
        <xref ref-type="bibr" rid="ref6">(Gildea, 2001)</xref>
        . Therefore,
testing such models on a portion of the target
texts is crucial. On the one hand, to show their
robustness. On the other hand, more practically,
to understand to what extent available tools can
actually boost the semi-automatic annotation of
new data.
      </p>
      <p>
        In this paper, I will highlight the methodology
behind the development of a first sample of a
dependency treebank aiming to collect German
aesthetic essays of the late 18th century. By
aesthetic essays I mean theoretical writings about
art, poetics, beauty and related issues, which
were mainly published on literary magazines,
chiefly targeting non-academic middle-class
readers. 1 In that period, there was a remarkable
production of these texts in Germany, and they
contributed to popularize the recently born
modern ’Hochdeutsch’, i.e. the modern variety of the
German language. To the best of my knowledge,
despite its importance, such textual genre has
never been studied in depth at any linguistic level.
In a long-term perspective, a dependency treebank
will surely provide empirical data to fill the gap,
especially concerning syntax and semantics.
Indeed, many studies can be done on such resource,
ranging from using dependency networks to
describe syntactic phenomena
        <xref ref-type="bibr" rid="ref13">(Passarotti, 2014)</xref>
        ,
to extracting a valency lexicon
        <xref ref-type="bibr" rid="ref12">(Passarotti et al.,
2016)</xref>
        .
      </p>
      <p>In the rest of this paper, some fundamental
issues concerning the treebank design are
highlighted and preliminary results concerning
automatic lemmatization, POS-tagging and
dependency parsing are reported and discussed.</p>
      <p>1Philosophical monographs about aesthetics from the
same period are not part of the target data for this resource,
belonging to a different genre.
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>Methodology</title>
      <sec id="sec-2-1">
        <title>Data</title>
        <p>Even if we are dealing with texts in prose in a
defined domain, style between authors may vary
substantially, especially in terms of syntax and
lexicon. Therefore, to avoid too much variation in my
data, for this first sample I focused on a particular
text typology inside the target genre: fragments,
i.e. really short texts, sometimes in aphorism-like
form. I assumed that such texts could be dealt with
as a whole, in spite of their different authorship. 2
For the first sample of the treebank, I selected the
following data: F. Schlegel, Lyceum Fragmente,
fragments from 1 to 90; F. Schlegel and other
authors, Athenaeum Fragmente, fragments from 1 to
50; Novalis, Blu¨thenstaub, fragments from 1 to 31.
All the raw texts in .txt format were obtained from
zeno.org. Overall, this initial corpus counts 7337
tokens.
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Annotating a Gold Standard</title>
        <p>
          Such corpus was semi-automatically annotated
to build a gold standard. As for the annotation
scheme, I adhered to the Universal Dependencies
(UD) 2.0 scheme
          <xref ref-type="bibr" rid="ref11">(Nivre et al., 2017)</xref>
          . Texts
were tokenized and brought into conllu format
with UDPipe1.1
          <xref ref-type="bibr" rid="ref16">(Straka et al., 2016)</xref>
          . Then they
were brought into conll09 format (Hajicˇ et al.,
2009) and processed with Anna 3.6 pipeline
          <xref ref-type="bibr" rid="ref2 ref4">(Bohnet, 2010)</xref>
          .3 I had used this suite in previous
preliminary experiments on some data from the
same period and domain, attaining good initial
results for POS-tagging and dependency parsing.
I assigned the following metadata: LEMMA,
UPOS (the coarse-grained POS-tag, based on the
Google tagset
          <xref ref-type="bibr" rid="ref14">(Petrov et al., 2011)</xref>
          ), XPOS (the
fine-grained POS-tag, based on the STTS tagset
          <xref ref-type="bibr" rid="ref5">(Brants et al., 2002)</xref>
          ), HEAD (the regent element
of the dependency relation) and DEPREL (the
kind of dependency relation). As for LEMMA
and XPOS, pre-trained models based on the Tiger
Corpus
          <xref ref-type="bibr" rid="ref5">(Brants et al., 2002)</xref>
          were used. As for
UPOS, HEAD and DEPREL, I trained a model
on the training file of the German treebank in
UD 2.04. Then, at each stage of the processing,
the automatic output was manually checked. An
2Preliminary clustering and syntactic parsing experiments
confirmed this hypothesis.
        </p>
        <p>3Double multi-word tokens such as ’der+im’ for the
determined article ’dem’ or ’in+dem’ for the preposition ’im’
had to be removed to work with this format.</p>
        <p>4It counts about 287.000 tokens.
annotated fragment is shown in Figure 1 in a
tree-like form.</p>
        <p>I briefly describe the formalism in Figure 1. The
main node of each sentence usually is the main
verb, which is ’kennen’ in this case, whose
relation is tagged as ’root’. The article ’Die’ depends
on the common noun ’Tiefen’ as determiner, while
’Tiefen’ depends on ’kennen’ as nominal object.
’Wir’ is a personal pronoun playing the role of
nominal subject. ’unsers’ is a possessive pronoun
modifying the common noun ’Geistes’, which is
in genitive case and modifies the subject.
According to the current scheme, such modifier depends
on the noun it refers to through ’det’ relation.</p>
        <p>
          As for lemmatization, I measured the accuracy
by Anna 3.6 lemmatizer
          <xref ref-type="bibr" rid="ref2">(Bjo¨rkelund et al., 2010)</xref>
          on fragments only. Results are shown in Table 1.5
Given the high overall accuracy by Anna 3.6, I did
5All the results in this paper are expressed as percentage.
not test any other system. I briefly report some
issues concerning this task: inflected adjectives such
as ’andre’ or ’unsrer’ where ’e’ in stem drops
after inflection (for instance, the stem of ’unsrer’ is
’unser’) are lemmatized without ’e’; deadjectival
nouns such as ’Langweile’ or ’Ku¨rzeste’ are
lemmatized as nouns with the same form, not as
adjectives; the non-finite verb ’seyn’ is lemmatized
as ’seyn’, not with the current spelling ’seien’.
2.4
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>POS-Tagging</title>
        <p>As for POS-tagging, I tested some candidate
POS-taggers on fragments first. Once the
bestperforming one was detected, I tested it also on
the source variety to measure the accuracy gap.
Before doing that, I had to cope with some issues
concerning models and training data. According
to the documentation provided with the treebank
file, in the UD German treebank UPOS was
assigned manually, while XPOS was assigned
automatically by using Tree Tagger, trained on Tiger
Corpus, with no manual checking. Thus, the UD
treebank was not ideal to train a model for XPOS.
At the same time, I was interested in testing both
tagsets on the target data. Consequently, I
followed two different methods. First, I considered
the UPOS tagset. I picked up two candidate
POStaggers, I trained them on the whole training file of
the German treebank in UD and I tested them on
fragments. They were fed with the automatically
lemmatized texts by Anna 3.6. Overall accuracy is
shown in Table 2. 6</p>
      </sec>
      <sec id="sec-2-4">
        <title>Training</title>
        <p>100% de-ud-train</p>
      </sec>
      <sec id="sec-2-5">
        <title>POS-tagger</title>
        <p>Anna 3.6
UDPipe 1.1</p>
      </sec>
      <sec id="sec-2-6">
        <title>Frag</title>
        <p>93
88.5</p>
        <p>The best POS-tagger was Anna 3.6, thus I run
it on UD, performing a ten-fold validation. I
split up the training file of the UD 2.0 German
treebank into two partitions with ratio 9:1. I
trained the POS-tagger on the 90% and tested it
on the remaining 10%. I repeated the experiment
ten times, varying each time the two partitions.
Overall accuracy concerning these experiments,
i.e. the average of the ten measures, is shown in
Table 3.</p>
      </sec>
      <sec id="sec-2-7">
        <title>Training</title>
        <p>90% de-ud-train</p>
      </sec>
      <sec id="sec-2-8">
        <title>POS-tagger</title>
        <p>Anna 3.6</p>
        <p>As for Anna 3.6 POS-tagger, I report the
accuracy on some specific part-of-speeches on both test
sets. The first number in brackets refers to UD
7, while the second one to the fragments: VERB
(95.1/94.8), PROPN (proper nouns) (84.01/83.6);
NOUN (93.71/94.23); SCONJ (subordinate
conjunctions) (89.1/79); ADJ (adjectives) (91.2/94);
AUX (auxiliaries) (83.9/77.7) and ADV (adverbs)
(90.7/83.02). There is a remarkable gap between
the two varieties on adverbs, subordinating
conjunctions and auxiliaries. On fragments, a lot of
adverbs have been mismatched with adjectives, for
instance when they modify adjectives, while many
occurrences of the subordinate conjunction ’daß’
have been wrongly assigned. As for AUX, the
modal verb ’mu¨ssen’ was frequently assigned a
wrong POS. As for VERB, the verb ’sein’ was
frequently tagged as AUX when it occurs as verbal
part of a nominal predicate, while, in this case, it
should be tagged as VERB, according to the UD
scheme.</p>
      </sec>
      <sec id="sec-2-9">
        <title>Training</title>
        <p>Tiger (p)
Tiger (p)
Negra (p)</p>
      </sec>
      <sec id="sec-2-10">
        <title>POS-tagger</title>
        <p>Anna 3.6
RFTagger
Stanford</p>
        <p>Second, I considered XPOS. At first, I tested
three POS-taggers which are commonly used with
the STTS tagset on fragments. I used pre-trained
models provided by developers. Overall results
are shown in Table 4. Anna 3.6 outperformed
other candidates, and its overall accuracy is clearly
6In all these POS-tagging experiments, accuracy is the
number of correctly assigned POS-tags divided by the total
number of POS-tags in the test set.</p>
        <p>7The reported value is the average of the ten accuracy
values attained on each POS in each experiment of the ten-fold
validation.
higher than that on UPOS on the same test set.
Such a significant improvement could be due to
the considerably different size of the training sets.8</p>
        <p>Following the method adopted in the UPOS
session, I performed a ten-fold validation of Anna 3.6
POS-tagger on Tiger Corpus 2.2. Overall average
accuracy was 97.7. Results concerning single
selected POS on both test sets is shown in Table 5.
To remind the difference in granularity between
the two tagsets, for each group of XPOS I reported
the corresponding UPOS as well. In contrast to
UPOS, problems concerning auxiliaries and
subordinating conjunctions on fragments seem to be
overcome, while there are still issues concerning
non-finite modal verbs, such as ’mu¨ssen’.</p>
      </sec>
      <sec id="sec-2-11">
        <title>UPOS</title>
        <p>VERB
AUX
ADJ
ADV
NOUN
PROPN
SCONJ</p>
      </sec>
      <sec id="sec-2-12">
        <title>XPOS</title>
        <p>VVFIN
VVINF
VVPP
VVIZU
VMFIN
VMINF
VAFIN
VAINF
ADJA
ADJD
ADV
NN</p>
        <p>
          NE
KOUS
As for dependency parsing, I tested four different
candidate parsers. First, I performed a ten-fold
validation on the training set of the UD German
treebank, using the same partitions from the
POStagging session. Second, the parsers were trained
on the whole training set of the German treebank
and tested on fragments. In this case,
morphological features were removed from the training set,
because they have not been annotated in my test
set yet, therefore the parsing model should not
include them. All the four parsers were fed with the
automatically lemmatized and POS-tagged texts
(both with UPOS and XPOS). Such metadata were
assigned by Anna 3.6. The candidate parsers and
their settings are introduced below, while
overall results are reported in Table 6. Parsing
accuracy was measured through Malt Eval
          <xref ref-type="bibr" rid="ref10">(Nivre et
al., 2010)</xref>
          and it is expressed in terms of labeled
attachment score (LAS).
        </p>
        <p>
          Malt Parser 1.9.0
          <xref ref-type="bibr" rid="ref9">(Nivre et al., 2006)</xref>
          , a
transition-based system. This parser
performs better with an optimized configuration
obtained through Malt Optimizer, i.e. a
software able to suggest the best parsing
configuration after reading the training data. First,
I run Malt Optimizer on the ten partitions of
the training file of the UD German Treebank.
Then, for each of them, the suggested
configuration was used to parse the corresponding
test set. Second, Malt Optimizer
          <xref ref-type="bibr" rid="ref1 ref3">(Ballesteros
and Nivre, 2012)</xref>
          was run on the whole UD
training file, and the suggested configuration
9 was used to parse the target variety.
        </p>
        <p>
          Anna 3.6
          <xref ref-type="bibr" rid="ref2 ref4">(Bohnet, 2010)</xref>
          by Mate Tools, a
graph-based system. It was run with 10
training iterations.
        </p>
        <p>
          Joint Parser 1.30
          <xref ref-type="bibr" rid="ref1 ref3">(Bohnet and Nivre, 2012)</xref>
          ,
a transition-based system with beam search,
graph completion model and an integrated
part-of-speech tagger. It was run with the R6J
transition, 25 training iterations and beam
search parameter fixed at 40.
        </p>
        <p>
          Parsito, a transition-based system with a
neural network classifier, included in the
UDPipe 1.1 suite
          <xref ref-type="bibr" rid="ref16">(Straka et al., 2016)</xref>
          . It was run
in the standard configuration.
        </p>
        <p>Overall, Anna 3.6 attained the highest accuracy
on both test sets. However, there is a 19.2%
accuracy gap between the two top scores on the
two varieties.</p>
        <p>8Indeed, Tiger Corpus 2.2 is about three times bigger than
the UD German treebank used to train the model for UPOS.
9system: liblinear; feature model:
addMergPOSTAGS0I0FORMLookahead0; algorithm: stackproj</p>
      </sec>
      <sec id="sec-2-13">
        <title>Training</title>
        <p>100% de-ud-train</p>
      </sec>
      <sec id="sec-2-14">
        <title>Parser</title>
        <p>Malt 1.9
Anna 3.6</p>
        <p>Joint
Parsito
In order to detect which syntactic relations are
more difficult to correctly parse in fragments, I did
an in-depth evaluation for all the parsers.
Accuracy concerning some of the most problematic
relations is reported in Table 7. 10</p>
      </sec>
      <sec id="sec-2-15">
        <title>Deprel</title>
        <p>acl
xcomp
advcl
conj
root</p>
      </sec>
      <sec id="sec-2-16">
        <title>Parser</title>
        <p>Malt
Anna
Joint
Parsito
Malt
Anna
Joint
Parsito
Malt
Anna
Joint
Parsito
Malt
Anna
Joint
Parsito
Malt
Anna
Joint
Parsito</p>
        <p>I supply a brief description of the dependency
relations I reported in Table 7. ’acl’ stands for
adjectival clause modifier, i.e. it refers to all those
finite and non-finite clauses modifying a noun,
such as the relative clauses. For instance, it occurs
between the noun ’Apfel’ in the main clause
and the subordinate verb ’liegt’ in the sentence
10I have not done an in-depth evaluation of the results on
UD yet.
’Die Apfel, die auf dem Tisch liegt’ (The apple,
that is on the table). It is different from ’advcl’,
which stands for adverbial clause, i.e. a clause
modifying a predicate not as a core argument. It
occurs, for instance, between the subordinate verb
and the main verb in the sentence ’Ich denke, dass
diese Pru¨fung ganz schwierig ist’ (I think that this
exam is really difficult). ’xcomp’ stands for all
those predicative or clausal complements without
their own subject. In German, such function
matches different syntactic phenomena. For
example, it occurs between the main verb and the
subordinate verb in non-finite clauses introduced
by the particle ’zu’, such as in ’Ich habe viel zu
tun’ (I have a lot to do); or between the predicative
part of verbs such as ’lassen’ , ’scheinen’ or even
’nennen’ and the verb, such as in ’Ich lasse
dich gehen’ (I let you go). ’conj’ is the relation
occurring between coordinate items, while ’root’,
as shown in Figure 1, is the dependency relation
assigned to the main predicate of each sentence.</p>
        <p>In German, the subordinate verb lies at the end
of the clause, thus relation length, i.e the number
of tokens between the head (in this case the main
verb) and the dependent (the subordinate verb),
may be really high. This can play a crucial role in
parsing accuracy, especially for transition-based
systems. Malt parser mostly attained low accuracy
on this kind of relations, while performances by
this system increases on ’conj’ relation. This
could be do to the relatively low frequency of
coordinate relations occurring between verbs in
this test set (23% of all ’conj’ relations), which
are usually more likely to generate long relations.
Anna 3.6 sensibly outperformed the other systems
on ’acl’, ’advcl’ and on ’conj’ too. As for the
’root’ relation, a part from Malt Parser,
performances are almost similar. On ’xcomp’, accuracy
by all the systems dramatically drops. This could
be due to the high relation length between some
non-finite verbs and their heads, but also to the
wide range of different syntactic constructions in
which such relation occurs.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Conclusion and Future Work</title>
      <p>In this work, I described the methodology
behind the development of a first sample of a
German treebank collecting a particular kind of
aesthetic essays from the late 18th century, called
fragments. A gold standard was annotated
adhering to UD 2.0. Then some data-driven tools were
tested either on the target data and on a test set
of the source variety. Some core issues
concerning the automatic annotation were highlighted. As
for LEMMA and XPOS, overall accuracy on the
target data was high and very close to that on the
source variety. As for UPOS, the accuracy by the
best tagger dropped, especially on the target data.
Therefore, to assign POS-tag, the very good
results on the STTS tagset may suggest to
automatically assign XPOS first and then derive UPOS
from XPOS. Furthermore, the influence of
POStagging granularity on parsing has not been
studied yet. As for dependency parsing, the overall
gap between the target variety and the source
variety was remarkable (19%). An in-depth
comparison between the two varieties concerning single
relations will surely help to better detect parsing
problems on fragments. In addition, parsing
manually lemmatized and POS-tagged texts will surely
shed light on the error propagation on parsing.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Miguel</given-names>
            <surname>Ballesteros</surname>
          </string-name>
          and
          <string-name>
            <given-names>Joakim</given-names>
            <surname>Nivre</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Maltoptimizer: an optimization tool for maltparser</article-title>
          .
          <source>In Proceedings of the Demonstrations at the 13th Conference of the European Chapter of the Association for Computational Linguistics</source>
          , pages
          <fpage>58</fpage>
          -
          <lpage>62</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Anders</given-names>
            <surname>Bjo</surname>
          </string-name>
          ¨rkelund, Bernd Bohnet, Love Hafdell, and
          <string-name>
            <given-names>Pierre</given-names>
            <surname>Nugues</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>A high-performance syntactic and semantic dependency parser</article-title>
          .
          <source>In Proceedings of the 23rd International Conference on Computational Linguistics: Demonstrations</source>
          , pages
          <fpage>33</fpage>
          -
          <lpage>36</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>Bernd</given-names>
            <surname>Bohnet</surname>
          </string-name>
          and
          <string-name>
            <given-names>Joakim</given-names>
            <surname>Nivre</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>A transitionbased system for joint part-of-speech tagging and labeled non-projective dependency parsing</article-title>
          .
          <source>In Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning</source>
          , pages
          <fpage>1455</fpage>
          -
          <lpage>1465</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>Bernd</given-names>
            <surname>Bohnet</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Very high accuracy and fast dependency parsing is not a contradiction</article-title>
          .
          <source>In Proceedings of the 23rd international conference on computational linguistics</source>
          , pages
          <fpage>89</fpage>
          -
          <lpage>97</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Sabine</given-names>
            <surname>Brants</surname>
          </string-name>
          , Stefanie Dipper, Silvia Hansen, Wolfgang Lezius, and
          <string-name>
            <given-names>George</given-names>
            <surname>Smith</surname>
          </string-name>
          .
          <year>2002</year>
          .
          <article-title>The tiger treebank</article-title>
          .
          <source>In Proceedings of the workshop on treebanks and linguistic theories</source>
          , volume
          <volume>168</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>Daniel</given-names>
            <surname>Gildea</surname>
          </string-name>
          .
          <year>2001</year>
          .
          <article-title>Corpus variation and parser performance</article-title>
          .
          <source>In Proceedings of the 2001 Conference on Empirical Methods in Natural Language Processing</source>
          , pages
          <fpage>167</fpage>
          -
          <lpage>202</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Jan</surname>
            <given-names>Hajicˇ</given-names>
          </string-name>
          , Massimiliano Ciaramita, Richard Johansson, Daisuke Kawahara, Maria Anto`nia Mart´ı, Llu´ıs Ma`rquez, Adam Meyers, Joakim Nivre, Sebastian Pado´, Jan Sˇ teˇpa´nek, et al.
          <year>2009</year>
          .
          <article-title>The conll-2009 shared task: Syntactic and semantic dependencies in multiple languages</article-title>
          .
          <source>In Proceedings of the Thirteenth Conference on Computational Natural Language Learning: Shared Task</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>18</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Christopher D Manning</surname>
          </string-name>
          , Mihai Surdeanu, John Bauer, Jenny Rose Finkel, Steven Bethard, and
          <string-name>
            <surname>David McClosky</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>The stanford corenlp natural language processing toolkit</article-title>
          .
          <source>In ACL (System Demonstrations)</source>
          , pages
          <fpage>55</fpage>
          -
          <lpage>60</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>Joakim</given-names>
            <surname>Nivre</surname>
          </string-name>
          , Johan Hall, and
          <string-name>
            <given-names>Jens</given-names>
            <surname>Nilsson</surname>
          </string-name>
          .
          <year>2006</year>
          .
          <article-title>Maltparser: A data-driven parser-generator for dependency parsing</article-title>
          .
          <source>In Proceedings of LREC</source>
          , volume
          <volume>6</volume>
          , pages
          <fpage>2216</fpage>
          -
          <lpage>2219</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>Joakim</given-names>
            <surname>Nivre</surname>
          </string-name>
          , Laura Rimell,
          <string-name>
            <surname>Ryan McDonald</surname>
          </string-name>
          , and
          <string-name>
            <surname>Carlos</surname>
          </string-name>
          Gomez-Rodriguez.
          <year>2010</year>
          .
          <article-title>Evaluation of dependency parsers on unbounded dependencies</article-title>
          .
          <source>In Proceedings of the 23rd International Conference on Computational Linguistics</source>
          , pages
          <fpage>833</fpage>
          -
          <lpage>841</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>Joakim</given-names>
            <surname>Nivre</surname>
          </string-name>
          , Zˇ eljko Agic´,
          <string-name>
            <given-names>Lars</given-names>
            <surname>Ahrenberg</surname>
          </string-name>
          , et al.
          <year>2017</year>
          .
          <article-title>Universal dependencies 2.0. LINDAT/CLARIN digital library at the Institute of Formal and Applied Linguistics</article-title>
          , Charles University.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <given-names>Marco</given-names>
            <surname>Passarotti</surname>
          </string-name>
          , Berta Gonza´lez Saavedra, and Christophe Onambe´le´.
          <year>2016</year>
          .
          <article-title>Latin vallex. a treebank-based semantic valency lexicon for latin</article-title>
          .
          <source>In LREC.</source>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>Marco</given-names>
            <surname>Passarotti</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>The importance of being sum. network analysis of a latin dependency treebank</article-title>
          .
          <source>In Proceedings of La Prima Conferenza Italiana di Linguistica Computazionale</source>
          , pages
          <fpage>291</fpage>
          -
          <lpage>295</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <given-names>Slav</given-names>
            <surname>Petrov</surname>
          </string-name>
          ,
          <string-name>
            <surname>Dipanjan Das</surname>
          </string-name>
          , and
          <string-name>
            <surname>Ryan McDonald</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>A universal part-of-speech tagset</article-title>
          .
          <source>arXiv preprint arXiv:1104</source>
          .
          <year>2086</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <given-names>Helmut</given-names>
            <surname>Schmid</surname>
          </string-name>
          and
          <string-name>
            <given-names>Florian</given-names>
            <surname>Laws</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Estimation of conditional probabilities with decision trees and an application to fine-grained pos tagging</article-title>
          .
          <source>In Proceedings of the 22nd International Conference on Computational Linguistics-Volume</source>
          <volume>1</volume>
          , pages
          <fpage>777</fpage>
          -
          <lpage>784</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <given-names>Milan</given-names>
            <surname>Straka</surname>
          </string-name>
          , Jan Hajic, and Jana Strakova´.
          <year>2016</year>
          .
          <article-title>Udpipe: Trainable pipeline for processing conll-u files performing tokenization, morphological analysis, pos tagging and parsing</article-title>
          .
          <source>In LREC.</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>