<!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>bot.zen @ EVALITA 2016 - A minimally-deep learning PoS-tagger (trained for Italian Tweets)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Egon W. Stemle</string-name>
          <email>egon.stemle@eurac.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute for Specialised Communication and Multilingualism EURAC Research Bolzano/Bozen</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>English. This article describes the system that participated in the POS tagging for Italian Social Media Texts (PoSTWITA) task of the 5th periodic evaluation campaign of Natural Language Processing (NLP) and speech tools for the Italian language EVALITA 2016. The work is a continuation of Stemle (2016) with minor modifications to the system and different data sets. It combines a small assertion of trending techniques, which implement matured methods, from NLP and ML to achieve competitive results on PoS tagging of Italian Twitter texts; in particular, the system uses word embeddings and character-level representations of word beginnings and endings in a LSTM RNN architecture. Labelled data (Italian UD corpus, DiDi and PoSTWITA) and unlabbelled data (Italian C4Corpus and PAIS A`) were used for training. The system is available under the APLv2 open-source license.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Italiano. Questo articolo descrive il sis</title>
      <p>tema che ha partecipato al task POS
tagging for Italian Social Media Texts
(PoSTWita) nell’ambito di EVALITA 2016, la
5° campagna di valutazione periodica del
Natural Language Processing (NLP) e
delle tecnologie del linguaggio.</p>
      <p>Il lavoro e` un proseguimento di quanto
descritto in Stemle (2016), con modifiche
minime al sistema e insiemi di dati
differenti. Il lavoro combina alcune tecniche
correnti che implementano metodi
comprovati dell’NLP e del Machine
Learning, per raggiungere risultati
competitivi nel PoS tagging dei testi italiani di
Twitter. In particolare il sistema utilizza
strategie di word embedding e di
rappresentazione character-level di inizio e
fine parola, in un’architettura LSTM RNN.
Dati etichettati (Italian UD corpus, DiDi
e PoSTWITA) e dati non etichettati (Italian
C4Corpus e PAISA`) sono stati utilizzati in
fase di training.</p>
    </sec>
    <sec id="sec-2">
      <title>Il sistema e` disponibile sotto licenza open source APLv2.</title>
      <sec id="sec-2-1">
        <title>1 Introduction</title>
        <p>Part-of-speech (PoS) tagging is an essential
processing stage for virtually all NLP
applications. Subsequent tasks, like parsing,
namedentity recognition, event detection, and machine
translation, often utilise PoS tags, and benefit
(directly or indirectly) from accurate tag sequences.</p>
        <p>
          Actual work on PoS tagging, meanwhile,
mainly concentrated on standardized texts for
many years, and frequent phenomena in
computermediated communication (CMC) and Web
corpora such as emoticons, acronyms, interaction
words, iteration of letters, graphostylistics,
shortenings, addressing terms, spelling variations, and
boilerplate
          <xref ref-type="bibr" rid="ref1 ref7">(Androutsopoulos, 2007; Bernardini et
al., 2008; Beißwenger, 2013)</xref>
          still deteriorate the
performance of PoS-taggers
          <xref ref-type="bibr" rid="ref12 ref2">(Giesbrecht and
Evert, 2009; Baldwin et al., 2013)</xref>
          .
        </p>
        <p>On the other hand, the interest in automatic
evaluation of social media texts, in particular
for microblogging texts such as tweets, has been
growing considerably, and specialised tools for
Twitter data have become available for different
languages. But Italian completely lacks such
resources, both regarding annotated corpora and
specific PoS-tagging tools.1 To this end, the
POS tagging for Italian Social Media Texts
(PoSTWITA) task was proposed for EVALITA 2016
concerning the domain adaptation of PoS-taggers
to Twitter texts.</p>
        <p>Our system combined word2vec (w2v) word
embeddings (WEs) with a single-layer Long Short
Term Memory (LSTM) recurrent neural network
(RNN) architecture. The sequence of unlabelled
w2v representations of words is accompanied by
the sequence of n-grams of the word beginnings
and endings, and is fed into the RNN which in turn
predicts PoS labels.</p>
        <p>The paper is organised as follows: We present
our system design in Section 2, the
implementation in Section 3, and its evaluation in Section 4.
Section 5 concludes with an outlook on possible
implementation improvements.
2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Design</title>
        <p>Overall, our design takes inspiration from as far
back as Benello et al. (1989) who used four
preceding words and one following word in a
feedforward neural network with backpropagation for
PoS tagging, builds upon the strong foundation
laid down by Collobert et al. (2011) for a
neural network (NN) architecture and learning
algorithm that can be applied to various natural
language processing tasks, and ultimately is a
variation of Nogueira dos Santos and Zadrozny (2014)
who trained a NN for PoS tagging, with
characterlevel and WE representations of words.</p>
        <p>
          Also note that an earlier version of the system
was used in Stemle (2016) to participate in the
EmpiriST 2015 shared task on automatic linguistic
annotation of computer-mediated communication
/ social media
          <xref ref-type="bibr" rid="ref26">(Beißwenger et al., 2016)</xref>
          .
2.1
        </p>
        <sec id="sec-2-2-1">
          <title>Word Embeddings</title>
          <p>
            Recently, state-of-the-art results on various
linguistic tasks were accomplished by architectures
using neural-network based WEs. Baroni et al.
(2014) conducted a set of experiments comparing
the popular w2v
            <xref ref-type="bibr" rid="ref19 ref19 ref20 ref20">(Mikolov et al., 2013a; Mikolov
et al., 2013b)</xref>
            implementation for creating WEs to
other distributional methods with state-of-the-art
results across various (semantic) tasks. These
results suggest that the word embeddings
substantially outperform the other architectures on
semantic similarity and analogy detection tasks.
Subsequently, Levy et al. (2015) conducted a
comprehensive set of experiments and comparisons that
suggest that much of the improved results are due
to the system design and parameter optimizations,
rather than the selected method. They conclude
that ”there does not seem to be a consistent
significant advantage to one approach over the other”.
          </p>
          <p>
            Word embeddings provide high-quality low
dimensional vector representations of words from
large corpora of unlabelled data, and the
representations, typically computed using NNs, encode
many linguistic regularities and patterns
            <xref ref-type="bibr" rid="ref19 ref20">(Mikolov
et al., 2013b)</xref>
            .
2.2
          </p>
        </sec>
        <sec id="sec-2-2-2">
          <title>Character-Level Sub-Word Information</title>
          <p>
            The morphology of a word is opaque to WEs, and
the relatedness of the meaning of a lemma’s
different word forms, i.e. its different string
representations, is not systematically encoded. This means
that in morphologically rich languages with
longtailed frequency distributions, even some WE
representations for word forms of common lemmata
may become very poor
            <xref ref-type="bibr" rid="ref16">(Kim et al., 2015)</xref>
            .
          </p>
          <p>We agree with Nogueira dos Santos and
Zadrozny (2014) and Kim et al. (2015) that
subword information is very important for PoS
tagging, and therefore we augment the WE
representations with character-level representations of
the word beginnings and endings; thereby, we
also stay language agnostic—at least, as much
as possible—by avoiding the need for, often
language specific, morphological pre-processing.
2.3</p>
        </sec>
        <sec id="sec-2-2-3">
          <title>Recurrent Neural Network Layer</title>
          <p>Language Models are a central part of NLP. They
are used to place distributions over word
sequences that encode systematic structural
properties of the sample of linguistic content they are
built from, and can then be used on novel content,
e.g. to rank it or predict some feature on it. For a
detailed overview on language modelling research
see Mikolov (2012).</p>
          <p>A straight-forward approach to incorporate
WEs into feature-based language models is to
use the embeddings’ vector representations as
features.2 Having said that, WEs are also used in NN
1http://www.evalita.it/2016/tasks/postwita
2For an overview see, e.g. Turian et al. (2010).
architectures, where they constitute (part of) the
input to the network.</p>
          <p>
            Neural networks consist of a large number of
simple, highly interconnected processing nodes in
an architecture loosely inspired by the structure of
the cerebral cortex of the brain
            <xref ref-type="bibr" rid="ref23">(O’Reilly and
Munakata, 2000)</xref>
            . The nodes receive weighted inputs
through these connections and fire according to
their individual thresholds of their shared
activation function. A firing node passes on an activation
to all successive connected nodes. During learning
the input is propagated through the network and
the output is compared to the desired output. Then,
the weights of the connections (and the thresholds)
are adjusted step-wise so as to more closely
resemble a configuration that would produce the desired
output. After all input cases have been presented,
the process typically starts over again, and the
output values will usually be closer to the correct
values.
          </p>
          <p>
            RNNs are NNs where the connections between
the elements are directed cycles, i.e. the networks
have loops, and this enables them to model
sequential dependencies of the input. However,
regular RNNs have fundamental difficulties
learning long-term dependencies, and special kinds of
RNNs need to be used
            <xref ref-type="bibr" rid="ref15">(Hochreiter, 1991)</xref>
            ; a very
popular kind is the so called long short-term
memory (LSTM) network proposed by Hochreiter and
Schmidhuber (1997).
          </p>
          <p>Overall, with this design we not only benefit
from available labelled data but also from
available general or domain-specific unlabelled data.
3</p>
        </sec>
      </sec>
      <sec id="sec-2-3">
        <title>Implementation</title>
        <p>We maintain the implementation in a source
code repository at https://github.com/
bot-zen/. The version tagged as 1.1
comprises the version that was used to generate the
results submitted to the shared task (ST).</p>
        <p>Our system feeds WEs and character-level
subword information into a single-layer RNN with a
LSTM architecture.
3.1</p>
        <sec id="sec-2-3-1">
          <title>Word Embeddings</title>
          <p>When computing WEs we take into consideration
Levy et al. (2015): they observed that one
specific configuration of w2v, namely the skip-gram
model with negative sampling (SGNS) ”is a robust
baseline. While it might not be the best method for
every task, it does not significantly underperform
in any scenario. Moreover, SGNS is the fastest
method to train, and cheapest (by far) in terms
of disk space and memory consumption”.
Coincidentally, Mikolov et al. (2013b) also suggest to
use SGNS. We incorporate w2v’s original C
implementation for learning WEs3 in an independent
pre-processing step, i.e. we pre-compute the WEs.
Then, we use gensim4, a Python tool for
unsupervised semantic modelling from plain text, to load
the pre-computed data, and to compute the vector
representations of input words for our NN.
3.2</p>
        </sec>
        <sec id="sec-2-3-2">
          <title>Character-Level Sub-Word Information</title>
          <p>Our implementation uses a one-hot encoding with
a few additional features for representing
subword information. The one-hot encoding
transforms a categorical feature into a vector where the
categories are represented by equally many
dimensions with binary values. We convert a letter to
lower-case and use the sets of ASCII characters,
digits, and punctuation marks as categories for the
encoding. Then, we add dimensions to represent
more binary features like ’uppercase’ (was
uppercase prior to conversion), ’digit’ (is digit),
’punctuation’ (is punctuation mark), whitespace (is white
space, except the new line character; note that this
category is usually empty, because we expect our
tokens to not include white space characters), and
unknown (other characters, e.g. diacritics). This
results in vectors with more than a single one-hot
dimension.
3.3</p>
        </sec>
        <sec id="sec-2-3-3">
          <title>Recurrent Neural Network Layer</title>
          <p>
            Our implementation uses Keras, a high-level NNs
library, written in Python and capable of running
on top of either TensorFlow or Theano
            <xref ref-type="bibr" rid="ref9">(Chollet,
2015)</xref>
            . In our case it runs on top of Theano,
a Python library that allows to define, optimize,
and evaluate mathematical expressions involving
multi-dimensional arrays efficiently
            <xref ref-type="bibr" rid="ref26">(The Theano
Development Team et al., 2016)</xref>
            .
          </p>
          <p>The input to our network are sequences of the
same length as the sentences we process. During
training, we group sentences of the same length
into batches and process the batches according to
sentence length in increasing order. Each single
word in the sequence is represented by its
subword information and two WEs that come from
two sources (see Section 4). For unknown words,
3https://code.google.com/archive/p/
word2vec/
4https://radimrehurek.com/gensim/
i.e. words without a pre-computed WE, we first try
to find the most similar WE considering 10
surrounding words. If this fails, the unknown word is
mapped to a randomly generated vector
representation. In Total, each word is represented by 2; 280
features: two times 500 (WEs), and sixteen times
80 for two 8-grams (word beginning and ending).
If words are shorter than 8 characters their 8-grams
are zero-padded.</p>
          <p>
            This sequential input is fed into a LSTM layer
that, in turn, projects to a fully connected output
layer with softmax activation function. During
training we use dropout for the projection into the
output layer, i.e. we set a fraction (0:5) of the input
units to 0 at each update, which helps prevent
overfitting
            <xref ref-type="bibr" rid="ref24">(Srivastava et al., 2014)</xref>
            . We use categorical
cross-entropy as loss function and
backpropagation in conjunction with the RMSprop
optimization for learning. At the time of writing, this was
the Keras default—or the explicitly documented
option to be used—for our type of architecture.
4
          </p>
        </sec>
      </sec>
      <sec id="sec-2-4">
        <title>Results</title>
        <p>We used our slightly modified implementation to
participate in the POS tagging for Italian Social
Media Texts (PoSTWITA) shared task (ST) of the
5th periodic evaluation campaign of Natural
Language Processing (NLP) and speech tools for the
Italian language EVALITA 2016. First, we
describe the corpora used for training, and then the
specific system configuration(s) for the ST.
4.1
4.1.1</p>
        <sec id="sec-2-4-1">
          <title>Training Data for w2v and PoS Tagging</title>
        </sec>
        <sec id="sec-2-4-2">
          <title>DiDi-IT (PoS, w2v)</title>
          <p>
            didi-it
            <xref ref-type="bibr" rid="ref11 ref26">(Frey et al., 2016)</xref>
            (version September
2016) is the Italian sub-part of the DiDi corpus,
a corpus of South Tyrolean German and Italian
from Facebook (FB) users’ wall posts, comments
on wall posts and private messages.
          </p>
          <p>The Italian part consists of around 100,000
tokens collected from 20 profiles of Facebook users
residing in South Tyrol. This version has about
20,000 PoS tags semi-automatically corrected by
a single annotator.</p>
          <p>The anonymised corpus is freely available for
research purposes.</p>
        </sec>
        <sec id="sec-2-4-3">
          <title>4.1.2 Italian UD (PoS, w2v)</title>
          <p>Universal Dependencies (UD) is a project that
is developing cross-linguistically consistent
treebank annotation for many languages.5</p>
          <p>
            italian-UD6 (version from January 2015)
corpus was originally obtained by conversion from
ISDT (Italian Stanford Dependency Treebank)
and released for the dependen
            <xref ref-type="bibr" rid="ref22">cy parsing ST of
EVALITA 2014</xref>
            <xref ref-type="bibr" rid="ref8">(Bosco et al., 2014)</xref>
            . The
corpus has semi-automatically converted PoS tags
from the original two Italian treebanks, differing
both in corpus composition and adopted
annotation schemes.
          </p>
          <p>The corpus contains around 317,000 tokens in
around 13,000 sentences from different sources
and genres. It is available under the CC
BY-NCSA 3.07 license.
4.1.3 PoSTWITA (PoS and w2v)
postwita is the Twitter data made available by the
organizers of the ST. It contains Twitter tweets
from the EVALITA2014 SENTIPLOC corpus: the
development and test set and additional tweets
from the same period of time were manually
annotated for a global amount of 6438 tweets (114,967
tokens) and were distributed as the development
set. The data is PoS tagged according to UD
but with the additional insertion of seven
Twitterspecific tags. All the annotations were carried out
by three different annotators. The data was only
distributed to the task participants.
4.1.4 C4Corpus (w2v)
c4corpus8 is a full documents Italian Web
corpus that has been extracted from CommonCrawl,
the largest publicly available general Web crawl
to date. See Habernal (2016) for details about the
corpus construction pipeline, and other
information about the corpus.</p>
          <p>
            The corpus contains about 670m tokens in 22m
sentences. The data is available under the
CreativeCommons license family.
4.1.5 PAISA` (w2v)
paisa
            <xref ref-type="bibr" rid="ref18">(Lyding et al., 2014)</xref>
            is a corpus of
authentic contemporary Italian texts from the web
(harvested in September/October 2010). It was created
5http://universaldependencies.org/
6http://universaldependencies.org/it/
overview/introduction.html
          </p>
          <p>7Creative Commons
Attribution-NonCommercialShareAlike 3.0 Unported, i.e. the data can be copied and
redistributed, and adapted for purposes other than
commercial ones. See https://creativecommons.org/
licenses/by-nc-sa/3.0/ for more details.</p>
          <p>8https://github.com/dkpro/
dkpro-c4corpus
in the context of the project PAISA` (P´ıattaforma
per l’Apprendimento dell’Italiano Su corpora
Annotati) with the aim to provide a large resource of
freely available Italian texts for language learning
by studying authentic text materials.</p>
          <p>The corpus contains about 270m tokens in
about 8m sentences. The data is available under
the CC BY-NC-SA 3.09 license.
4.2</p>
        </sec>
        <sec id="sec-2-4-4">
          <title>PoSTWITA shared task</title>
          <p>For the ST we used one overall configuration for
the system but three different corpus
configurations for training. However, only one corpus
configuration was entered into the ST: we used PoS
tags from didi-it + postwita (run 1), from
italianUD (run 2), and from both (run 3). For w2v
we trained a 500-dimensional skip-gram model
on didi-it + italian-UD + postwita that ignored
all words with less than 2 occurrences within
a window size of 10; it was trained with
negative sampling (value 15). We also trained a
500-dimensional skip-gram model on c4corpus +
paisa that ignored all words with less than 33
occurrences within a window size of 10; it was
trained with negative sampling (value 15).</p>
          <p>The other w2v parameters were left at their
default settings10.</p>
          <p>The evaluation of the systems was done by the
organisers on unlabelled but pre-tokenised data
(4759 tokens in 301 tweets), and was based on a
token-by-token comparison. The considered
metric was accuracy, i.e. the number of correctly
assigned PoS tags divided by the total number of
tokens.</p>
          <p>(1) didi-it + postwita
(2) italian-UD
(3) didi-it + postwita + italian-UD
Winning Team</p>
          <p>We believe, the unexpectedly little performance
gain from utilizing the much larger italian-UD
data over the rather small didi-it + postwita data
may be rooted in the insertion of Twitter-specific
tags into the data (see 4.1.3), something we did
not account for, i.e. 18; 213 of 289; 416 and more
9https://creativecommons.org/licenses/
by-nc-sa/3.0/
10-sample 1e-3 -iter 5 -alpha 0.025
importantly 7; 778 of 12; 677 sentences had
imperfect information during training.
5</p>
        </sec>
      </sec>
      <sec id="sec-2-5">
        <title>Conclusion &amp; Outlook</title>
        <p>We presented our submission to the PoSTWITA
task of EVALITA 2016, where we participated
with moderate results. In the future, we will try to
rerun the experiment with training data that takes
into consideration the Twitter-specific tags of the
task.</p>
      </sec>
      <sec id="sec-2-6">
        <title>Acknowledgments</title>
        <p>The computational results presented have been
achieved in part using the Vienna Scientific
Cluster (VSC).</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Jannis</surname>
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Androutsopoulos</surname>
          </string-name>
          .
          <year>2007</year>
          . Neue Medien - neue
          <source>Schriftlichkeit? Mitteilungen des Deutschen Germanistenverbandes</source>
          ,
          <volume>1</volume>
          :
          <fpage>72</fpage>
          -
          <lpage>97</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Timothy</given-names>
            <surname>Baldwin</surname>
          </string-name>
          , Paul Cook, Marco Lui, Andrew MacKinlay, and
          <string-name>
            <given-names>Li</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>How noisy social media text, how diffrnt social media sources</article-title>
          ?
          <source>In Proceedings of the Sixth International Joint Conference on Natural Language Processing</source>
          , pages
          <fpage>356</fpage>
          -
          <lpage>364</lpage>
          , Nagoya, Japan, October.
          <source>Asian Federation of Natural Language Processing</source>
          . http://aclweb. org/anthology/I13-1041.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>Marco</given-names>
            <surname>Baroni</surname>
          </string-name>
          , Georgiana Dinu, and
          <string-name>
            <given-names>German</given-names>
            <surname>Kruszewski</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Don't count, predict! A systematic comparison of context-counting vs. context-predicting semantic vectors</article-title>
          .
          <source>In Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</source>
          , pages
          <fpage>238</fpage>
          -
          <lpage>247</lpage>
          .
          <article-title>Association for Computational Linguistics</article-title>
          . http://www.aclweb.org/ anthology/P14-1023.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>Michael</given-names>
            <surname>Beißwenger</surname>
          </string-name>
          , Sabine Bartsch, Stefan Evert, and
          <string-name>
            <surname>Kay-Michael Wu</surname>
          </string-name>
          ¨rzner.
          <year>2016</year>
          .
          <article-title>EmpiriST 2015: A Shared Task on the Automatic Linguistic Annotation of Computer-Mediated Communication, Social Media and Web Corpora</article-title>
          .
          <source>In Proceedings of the 10th Web as Corpus Workshop</source>
          (
          <article-title>WAC-X) and the EmpiriST Shared Task</article-title>
          , pages
          <fpage>78</fpage>
          -
          <lpage>90</lpage>
          , Berlin, Germany. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Michael</given-names>
            <surname>Beißwenger</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Das Dortmunder Chat-Korpus: ein annotiertes Korpus zur Sprachverwendung und sprachlichen Variation in der deutschsprachigen Chat-Kommunikation</article-title>
          . LINSE - Linguistik
          <source>Server Essen</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>13</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>Julian</given-names>
            <surname>Benello</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Andrew W.</given-names>
            <surname>Mackie</surname>
          </string-name>
          , and
          <string-name>
            <surname>James</surname>
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Anderson</surname>
          </string-name>
          .
          <year>1989</year>
          .
          <article-title>Syntactic category disambiguation with neural networks</article-title>
          .
          <source>Computer Speech &amp; Language</source>
          ,
          <volume>3</volume>
          (
          <issue>3</issue>
          ):
          <fpage>203</fpage>
          -
          <lpage>217</lpage>
          , July. http:
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>Silvia</given-names>
            <surname>Bernardini</surname>
          </string-name>
          , Marco Baroni, and
          <string-name>
            <given-names>Stefan</given-names>
            <surname>Evert</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>A WaCky Introduction</article-title>
          .
          <source>In Wacky! Working papers on the Web as Corpus</source>
          , pages
          <fpage>9</fpage>
          -
          <lpage>40</lpage>
          . GEDIT, Bologna, Italy. http://wackybook.sslmit. unibo.it/pdfs/bernardini.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>Cristina</given-names>
            <surname>Bosco</surname>
          </string-name>
          , Felice Dell'Orletta, Simonetta Montemagni, Manuela Sanguinetti, and
          <string-name>
            <given-names>Maria</given-names>
            <surname>Simi</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>The EVALITA 2014 Dependency Parsing Task</article-title>
          .
          <source>In Proceedings of CLiC-it 2014 and EVALITA</source>
          <year>2014</year>
          , pages
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          . Pisa University Press.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>Franois</given-names>
            <surname>Chollet</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Keras: Deep Learning library for Theano and TensorFlow</article-title>
          . https://github. com/fchollet/keras.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>Ronan</given-names>
            <surname>Collobert</surname>
          </string-name>
          , Jason Weston, Le´on Bottou, Michael Karlen, Koray Kavukcuoglu, and
          <string-name>
            <given-names>Pavel</given-names>
            <surname>Kuksa</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Natural Language Processing (almost) from Scratch</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          ,
          <volume>12</volume>
          :
          <fpage>2493</fpage>
          -
          <lpage>2537</lpage>
          . https://arxiv.org/abs/ 1103.0398.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>Jennifer-Carmen</surname>
            <given-names>Frey</given-names>
          </string-name>
          , Aivars Glaznieks, and
          <string-name>
            <surname>Egon</surname>
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Stemle</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>The DiDi Corpus of South Tyrolean CMC Data: A multilingual corpus of Facebook texts</article-title>
          . Upcoming.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <given-names>Eugenie</given-names>
            <surname>Giesbrecht</surname>
          </string-name>
          and
          <string-name>
            <given-names>Stefan</given-names>
            <surname>Evert</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Is Part-ofSpeech Tagging a Solved Task? An Evaluation of POS Taggers for the German Web as Corpus</article-title>
          . Web as Corpus Workshop (WAC5). http://sigwac. org.uk/raw-attachment/wiki/WAC5/ WAC5_proceedings.pdf#page=
          <fpage>27</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>Ivan</given-names>
            <surname>Habernal</surname>
          </string-name>
          , Omnia Zayed, and
          <string-name>
            <given-names>Iryna</given-names>
            <surname>Gurevych</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>C4Corpus: Multilingual Web-size corpus with free license</article-title>
          .
          <source>In Proceedings of the 10th International Conference on Language Resources and Evaluation (LREC</source>
          <year>2016</year>
          ), page (to appear), Portorozˇ, Slovenia, May.
          <source>European Language Resources Association (ELRA).</source>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <given-names>Sepp</given-names>
            <surname>Hochreiter</surname>
          </string-name>
          and Ju¨rgen Schmidhuber.
          <year>1997</year>
          .
          <article-title>Long short-term memory</article-title>
          .
          <source>Neural Computation</source>
          ,
          <volume>9</volume>
          (
          <issue>8</issue>
          ):
          <fpage>1735</fpage>
          -
          <lpage>1780</lpage>
          , November. http://dx.doi. org/10.1162/neco.
          <year>1997</year>
          .
          <volume>9</volume>
          .8.1735.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <given-names>Sepp</given-names>
            <surname>Hochreiter</surname>
          </string-name>
          .
          <year>1991</year>
          .
          <article-title>Untersuchungen zu dynamischen neuronalen Netzen</article-title>
          .
          <source>diploma thesis</source>
          , TU Mu¨nchen.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <given-names>Yoon</given-names>
            <surname>Kim</surname>
          </string-name>
          , Yacine Jernite, David Sontag, and
          <string-name>
            <surname>Alexander</surname>
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Rush</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Character-Aware Neural Language Models</article-title>
          . CoRR, abs/1508.0. http:// arxiv.org/abs/1508.06615.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <surname>Omer</surname>
            <given-names>Levy</given-names>
          </string-name>
          , Yoav Goldberg, and
          <string-name>
            <given-names>Ido</given-names>
            <surname>Dagan</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Improving distributional similarity with lessons learned from word embeddings</article-title>
          .
          <source>Transactions of the Association for Computational Linguistics</source>
          ,
          <volume>3</volume>
          :
          <fpage>211</fpage>
          -
          <lpage>225</lpage>
          . https: //tacl2013.cs.columbia.edu/ojs/ index.php/tacl/article/view/570.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <given-names>Verena</given-names>
            <surname>Lyding</surname>
          </string-name>
          , Egon Stemle, Claudia Borghetti, Marco Brunello, Sara Castagnoli, Felice Dell Orletta, Henrik Dittmann, Alessandro Lenci, and
          <string-name>
            <given-names>Vito</given-names>
            <surname>Pirrelli</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>The PAIS A` Corpus of Italian Web Texts</article-title>
          .
          <source>In Proceedings of the 9th Web as Corpus Workshop (WaC-9)</source>
          , pages
          <fpage>36</fpage>
          -
          <lpage>43</lpage>
          , Gothenburg, Sweden. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <string-name>
            <given-names>Tomas</given-names>
            <surname>Mikolov</surname>
          </string-name>
          , Kai Chen, Greg Corrado, and
          <string-name>
            <given-names>Jeffrey</given-names>
            <surname>Dean</surname>
          </string-name>
          .
          <year>2013a</year>
          .
          <article-title>Efficient Estimation of Word Representations in Vector Space</article-title>
          . CoRR, abs/1301.3781. http://arxiv.org/abs/1301.3781.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <string-name>
            <given-names>Tomas</given-names>
            <surname>Mikolov</surname>
          </string-name>
          , Ilya Sutskever, Kai Chen, Greg Corrado, and
          <string-name>
            <given-names>Jeffrey</given-names>
            <surname>Dean</surname>
          </string-name>
          .
          <year>2013b</year>
          .
          <article-title>Distributed Representations of Words and Phrases and their Compositionality</article-title>
          .
          <source>CoRR, abs/1310</source>
          .4546,
          <string-name>
            <surname>October</surname>
          </string-name>
          . http: //arxiv.org/abs/1310.4546.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          <source>Toma´sˇ Mikolov</source>
          .
          <year>2012</year>
          .
          <source>Statistical Language Models Based on Neural Networks. Ph.D. thesis</source>
          , Brno University of Technology. http://www.fit.vutbr.cz/˜imikolov/ rnnlm/thesis.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          <article-title>C´ıcero Nogueira dos Santos</article-title>
          and
          <string-name>
            <given-names>Bianca</given-names>
            <surname>Zadrozny</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Learning Character-level Representations for Part-of-Speech Tagging</article-title>
          .
          <source>In Proceedings of the 31st International Conference on Machine Learning (ICML-14)</source>
          , pages
          <fpage>1818</fpage>
          -
          <lpage>1826</lpage>
          . http://jmlr.org/proceedings/ papers/v32/santos14.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          <string-name>
            <surname>Randall C. O'Reilly</surname>
            and
            <given-names>Yuko</given-names>
          </string-name>
          <string-name>
            <surname>Munakata</surname>
          </string-name>
          .
          <year>2000</year>
          .
          <article-title>Computational Explorations in Cognitive Neuroscience Understanding the Mind by Simulating the Brain</article-title>
          . MIT Press. http://books.google.com/ books?id=BLf34BFTaIUC{\&amp;}pgis=
          <fpage>1</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          <string-name>
            <given-names>Nitish</given-names>
            <surname>Srivastava</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Geoffrey E.</given-names>
            <surname>Hinton</surname>
          </string-name>
          , Alex Krizhevsky, Ilya Sutskever, and
          <string-name>
            <given-names>Ruslan</given-names>
            <surname>Salakhutdinov</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Dropout : A Simple Way to Prevent Neural Networks from Overfitting</article-title>
          .
          <source>Journal of Machine Learning Research (JMLR)</source>
          ,
          <volume>15</volume>
          :
          <fpage>1929</fpage>
          -
          <lpage>1958</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          <string-name>
            <given-names>Egon W.</given-names>
            <surname>Stemle</surname>
          </string-name>
          .
          <year>2016</year>
          . bot.zen @
          <article-title>EmpiriST 2015 - A minimally-deep learning PoS-tagger (trained for German CMC and Web data)</article-title>
          .
          <source>In Proceedings of the 10th Web as Corpus Workshop</source>
          (
          <article-title>WAC-X) and the EmpiriST Shared Task</article-title>
          , pages
          <fpage>115</fpage>
          -
          <lpage>119</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          <string-name>
            <given-names>The</given-names>
            <surname>Theano Development Team</surname>
          </string-name>
          , Rami Al-Rfou, Guillaume Alain, Amjad Almahairi, and et al.
          <year>2016</year>
          .
          <article-title>Theano: A Python framework for fast computation of mathematical expressions</article-title>
          .
          <source>CoRR, abs/1605</source>
          .02688. http://arxiv.org/abs/ 1605.02688.
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          <string-name>
            <given-names>Joseph</given-names>
            <surname>Turian</surname>
          </string-name>
          , Lev Ratinov, and
          <string-name>
            <given-names>Yoshua</given-names>
            <surname>Bengio</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Word representations: A simple and general method for semi-supervised learning</article-title>
          .
          <source>In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, ACL '10</source>
          , pages
          <fpage>384</fpage>
          -
          <lpage>394</lpage>
          , Stroudsburg, PA, USA.
          <article-title>Association for Computational Linguistics</article-title>
          . http://dl.acm.org/ citation.cfm?id=
          <volume>1858681</volume>
          .
          <fpage>1858721</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>