<!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>Analysis of Italian Word Embeddings</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Rocco Tripodi</string-name>
          <email>rocco.tripodi@unive.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Stefano Li Pira</string-name>
          <email>stefano.li-pira@wbs.ac.uk</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Ca' Foscari University of Venice</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Warwick</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>English. In this work we analyze the performances of two of the most used word embeddings algorithms, skip-gram and continuous bag of words on Italian language. These algorithms have many hyper-parameter that have to be carefully tuned in order to obtain accurate word representation in vectorial space. We provide an extensive analysis and an evaluation, showing what are the best configuration of parameters for specific analogy tasks.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        The distributional hypothesis of language, set
forth by Firth (1935) and Harris (1954), states
that the meaning of a word can be inferred from
the contexts in which it is used. Using the
cooccurrence of words in a large corpus, we can
observe for example that the contexts in which client
is used are very similar to those in which customer
occur, while less similar to those in which
waitress or retailer occur. A wide range of algorithms
have been developed to exploit these properties.
Recently, one of the most widely used method in
many natural language processing (NLP) tasks is
word embeddings
        <xref ref-type="bibr" rid="ref1 ref14 ref15 ref5">(Bengio et al., 2003; Mikolov et
al., 2010; Mikolov et al., 2013)</xref>
        . It is based on
neural network techniques and has demonstrated to
capture semantic and syntactic properties of words
taking as input raw texts without other sources of
information. It represents each word as a
vector such that words that appear in similar contexts
are represented with similar vectors
        <xref ref-type="bibr" rid="ref1 ref15 ref7">(Collobert and
Weston, 2008; Mikolov et al., 2013)</xref>
        . The
dimensions of the word are not easily interpretable and,
with respect to explicit representation, they do not
correspond to specific concepts.
      </p>
      <p>In Mikolov et al. (2013), the authors propose
two different models that seek to maximize,
respectively, the probability of a word given its
context (Continuous bag-of-word model), and the
probability of the surrounding words (before and
after the current word) given the current word
(Skip-gram model). In this work we seek to
further explore the relationships by generating word
embedding for over 40 different
parameterizations of the continuous bag-of-words (CBOW) and
the skip-gram (SG) architectures, since as shown
in Levy et al. (2015) the choice of the
hyperparameters heavily affect the construction of the
embedding spaces.</p>
      <p>
        Specifically our contributions include:
Word embedding. The analysis of how
different hyper-parameters can achieve
different accuracy levels in relation recovery tasks
        <xref ref-type="bibr" rid="ref1 ref15">(Mikolov et al., 2013)</xref>
        .
      </p>
      <sec id="sec-1-1">
        <title>Morpho-syntactic and semantic analysis.</title>
        <p>Word embeddings have demonstrated to capture
semantic and syntactic properties, we compare
two different objectives to recover relational
similarities for semantic and morph-syntactical
tasks.</p>
        <p>Qualitative analysis. We investigate
problematic cases.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Related works</title>
      <p>
        The interest that word embedding models have
achieved in the NLP international community has
recently been confirmed by the increasing
number of studies that are adopting these algorithms
in languages different from English. One of the
first example is the Polyglot project that produced
word embedding for 117 languages
        <xref ref-type="bibr" rid="ref1">(Al-Rfou et
al., 2013)</xref>
        . They demonstrated the utility of word
embedding, achieving, in a part of speech tagging
task, performances competitive with the
state-ofthe art methods in English. Attardi et al. (2014)
have done the first attempt to introduce word
embedding in Italian obtaining similar results. They
have shown that, using word embedding, they
obtained one of the best accuracy levels in a named
entity recognition task.
      </p>
      <p>However, these optimistic results are not
confirmed by more recent studies. Indeed the
performance of word embedding are not directly
comparable in the accuracy test to those obtained in
the English language. For example, Attardi and
Simi (2014) combining the word embeddings in
a dependency parser have not observed
improvements over a baseline system not using such
features. Berardi et al. (2015) found a 47% accuracy
on the Italian versus 60% accuracy on the English.
The results may be a sign of a higher complexity
of Italian with respect to English as we will see
section 4.1.</p>
      <p>
        Similarly, recent work that trained word
embeddings on tweets have highlighted some
criticalities. One of these aspects is how the morphology
of a word is opaque to word embeddings. Indeed,
the relatedness of the meaning of a lemma’s
different word forms, its different string representations,
is not systematically encoded. This means that in
morphologically rich languages with long-tailed
frequency distributions, even some word
embedding representations for word forms of common
lemmata may become very poor
        <xref ref-type="bibr" rid="ref11">(Kim et al.,
2016)</xref>
        .
      </p>
      <p>For this reason, some recent contribution on
Italian tweets have tried to capture these aspects.
Tamburini (2016) trained SG on a set of 200
million tweets. He proposed a PoS-tagging system
integrating neural representation models and a
morphological analyzer, exhibiting a very good
accuracy. Similarly, Stemle (2016) proposes a
system that uses word embeddings and augment the
WE representations with character-level
representations of the word beginnings and endings.</p>
      <p>
        We have observed that in these studies the
authors used either the most common set-up of
parameters gathered from the literature
        <xref ref-type="bibr" rid="ref16 ref17 ref6">(Tamburini,
2016; Stemle, 2016; Berardi et al., 2015)</xref>
        or an
arbitrary number
        <xref ref-type="bibr" rid="ref12 ref2 ref3 ref4">(Attardi and Simi, 2014; Attardi
et al., 2016)</xref>
        . Despite the relevance given to these
parameters in the literature
        <xref ref-type="bibr" rid="ref9">(Goldberg, 2017)</xref>
        we
have not seen studies that analyze the different
strategies behind the possible parametrization. In
the next section, we propose a model to deepen
these aspects.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3 Italian word embeddings</title>
      <p>
        Previous results on the word analogy tasks have
been reported using vectors obtained with
proprietary corpora
        <xref ref-type="bibr" rid="ref6">(Berardi et al., 2015)</xref>
        . To make the
experiments reproducible, we trained our
models on a dump of the Italian Wikipedia (dated
2017.05.01), from which we used only the body
text of each articles. The obtained texts have
been lowercased and filtered according to the
corresponding parameter of each model. The
corpus consists of 994.949 sentences that result in
470.400.914 tokens.
      </p>
      <p>The hyper-parameters used to construct the
different embeddings for the SG and the CBOW
models are: the size of the vectors (dim), the
window size of the words contexts (w), the minimum
number word occurrences (m) and the number of
negative samples (n). The values that these
hyperparameters can take are shown in Table 1.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Evaluation</title>
      <p>
        The obtained embedding1 spaces are evaluated
on an word analogy task, using a enriched
version of the Google word analogy test
        <xref ref-type="bibr" rid="ref1 ref15">(Mikolov
et al., 2013)</xref>
        , translated in Italian by
        <xref ref-type="bibr" rid="ref6">(Berardi et
al., 2015)</xref>
        . It contains 19.791 questions and covers
19 relations types. 6 of them are semantic and 13
morphosyntactic (see Table 2). The proportions of
1The trained vectors with the best performances are
available at http://roccotripodi.com/ita-we
Morphosyntactic
adjective-to-adverb
opposite
comparative
superlative (assoluto)
present-participle (gerundio)
nationality-adjective
past-tense
plural
plural-verbs (3rd person)
plural-verbs (1st person)
remote-past-verbs (1st person)
noun-masculine-feminine-singular
noun-masculine-feminine-plural
#10.876
these two types of question is balanced as shown
in Table 2.
      </p>
      <p>
        To recover these relations two different
methods are used: 3COSADD (Eq. 1)
        <xref ref-type="bibr" rid="ref1 ref15">(Mikolov et al.,
2013)</xref>
        and 3COSMUL (Eq. 2)
        <xref ref-type="bibr" rid="ref12">(Levy et al., 2014)</xref>
        to compute vectors analogies:
3COSADD argmax cos(b ; b
b 2V
a + a )
(1)
3COSMUL argmax
b 2V
cos(b ; b)cos(b ; a )
cos(b ; a) +
(2)
These two measures try to capture different
relations between word vectors. The idea behind
these measures is to use the cosine similarity to
recover the vector of the hidden word (b ) that has
to be the most similar vector given two positive
and one negative word. In this way, it is possible
to model relations such as queen is to king what
woman is to man. In this case, the word queen
(b ) is represented by a vector that has to be
similar to king (b) and woman (a ) and different to man
(a). The two analogy measures slightly differ in
how they weight each aspect of the similarity
relation. 3COSADD allows one sufficiently large term
to dominate the expression
        <xref ref-type="bibr" rid="ref12">(Levy et al., 2014)</xref>
        ,
3COSMUL achieves a better balance amplifying
the small differences between terms and reducing
the larger ones
        <xref ref-type="bibr" rid="ref12">(Levy et al., 2014)</xref>
        . As explained in
Levy et al. (2014), we expect 3COSMUL to
overperform 3COSADD in evaluating both the
syntactic and the semantic tasks as it tries to normalize
the strength of the relationships that the hidden
term has both with the attractor terms and with the
repellers term.
The results of our evaluation are presented in
Figure 1. The main trend that it is possible to notice
is that accuracy increases as the number of
dimensions of the embedded vectors increases. This
indicates that Italian language benefits of a rich
representation that can account for its rich
morphology. Another important trend that emerges is the
fact that the parameters have the same effect on
both algorithms and that they perform very
differently on all the tasks. CBOW has very low
accuracy compared to SG. We can also see that the dim
hyper-parameter is not correlated with the
dimension of the vocabulary (model complexity) as one
should expect. In fact, with increasing values of
dim the accuracy increases whatever is the value
of m. This hyper-parameter heavily affects the
vocabulary length (see Table 3). However the dim
hyper-parameter seems to be correlated only with
the accuracy in the semantic tasks while the
performances on the morpho-syntactic tasks seems
not to have a big bust increasing the
dimensionality.
      </p>
      <p>With respect to the size of the context (w) used
to create the words representations we do not
observe a clear difference between the 18 pairs both
in the SG and in the CBOW. On the contrary a
clear trend can be observed varying the n
hyperparameter, with n = 1 the accuracy was
significantly lower than the one we obtained with n = 5
or n = 10. Increasing the number of negative
samples constantly increases the accuracy.</p>
      <p>
        These results support also the claim put forward
by
        <xref ref-type="bibr" rid="ref12">(Levy et al., 2014)</xref>
        that the 3COSMUL method
is more suited to recover analogy relations. In fact,
we can see that on average the right bars of the
plots are higher than the left.
4.2
      </p>
      <sec id="sec-4-1">
        <title>Error analysis</title>
        <p>If we restrict the error analysis to the most
macroscopic differences in figure 1 we can compare
three different parametrizations: SG-200
w5-m5n1, SG-500 w5-m5-n1, SG-500 w5-m5-n10. In
this way we can analyze the results obtained
changing the number of dimensions of the vectors
and the role played by n. In Table 4 the total
number of errors and the number of different words
that have not been recovered by each
parametrization are presented. From this table we can see that
most of the errors are done one a relatively small
set of words. This phenomenon can be studied
analyzing the most problematic cases. In Table
5 we can see the list of the most common errors
ranked by frequency for each method. As we can
SG-200-w5-m5-n10 # SG-500 w5-m5-n1 # SG-500 w5-m5-n10 #
california 328 california 349 california 287
texas 223 texas 224 texas 165
arizona 164 arizona 164 arizona 145
florida 144 ohio 142 florida 124
ohio 135 florida 140 ohio 112
see from these lists the errors are done on the same
words and this because they are the most common
in the dataset (e.g.: in the dataset there are 217
queries that require Florida as answer compared to
the 55 of Italia). However if we compare the
frequency of these errors in the analogy test within
the three parametrisation we can observe an
improvement of approximately 15% in accuracy with
SG-500 w5-m5-n10. Indeed, despite many errors
are not recovered for any of the parametrisation,
we can observe that approximately 21% of the
errors are recovered under certain parametrizations
(Table 6). To further investigate these
improvements related to the aforementioned
parametrisation we focused on one of the most frequent
errors in the analogy test, the word California. As
we can see from the list of the analogy test solved
(Table 7) different parametrizations are helpful to
solve different types of analogies. For example
an increase in the dimensionality increases the
accuracy, but mainly in analogy test with words
that have a representation in the training data
related to a wider set of contexts (Houston:Texas;
Chicago:Illinois). The best parametrisation is
obtained increasing the negative sampling. As we
can see from the examples provided, the
analogies are resolved thanks to a contextual similarity
between the two pairs (Huntsville:Alabama;
Oakland:California). In these cases the negative
sampling could help to filter out from each
representation those words that are not expected to be
relevant for the words embeddings.</p>
        <p>Similar types of improvement are noticed on
analogy tests that contain a challenging word
predire (predict). The results of this analysis are
presented in Table 9 where it is possible to see that
an higher dimensionality improves the accuracy
of analogical tests containing open domain verbs
(e.g.: descrivere, vedere). Similarly to the
previous case, an higher dimensionality allows for fine
grained partitions improving the correct
associations between terms. However, also in in this case,
the best parametrizations are obtained increasing
the negative sampling or both the parameters. As
we can see here both the present participle and the
past tense pairs are correctly solved. These
example provide a preliminary evidence of how
negative sampling, filtering out non informative words
from the relevant context of each word, is able to
build representation by opposition that are
beneficial both for semantic and syntactic associations.</p>
        <p>Examples of words that almost always are
not recovered correctly are presented in Table
10. A selected list of words problematic for all
parametrizations is shown in Table 8. It contains
plurals, feminine, currencies, superlatives and
ambiguous words. The low performances on these
cases can be explained by the poor coverage of
these categories in the training data. In particular,
it would be interesting to study the case of
feminine and to analyze if it is due to a gender bias
in the Italian Wikipedia, as a preliminary analysis
of the most frequent errors that persist in all the
parametrization seems to suggest. The words that
have been benefited by the increase of n are:
the errors that have been introduced increasing this
parameter are related to the words in Table 11. It is
interesting to notice that given an error in an
analogy test, it is possible to find the correct answer in
the top five most similar words to the query.
Precisely we observed this phenomenon in 26% of the
cases for SG-200-w5-m5-n10, in 27% of the cases
for SG-500-w5-m5-n1 and in 25% for
SG-500w5-m5-n1. Furthermore, approximately in 50% of
these cases the correct answer is the second most
similar. Most of the recovery errors are due to
vocabulary issues. In fact, many words of the test set
have no correspondence in the developed
embedding spaces. This is due to the low frequency of
many words that are not in the training corpus or
that have been removed from the vocabulary
because of their (low) frequency. For this reason we
kept the m hyper-parameter very low (e.g., 1 and
5), in counter-tendency with recent works that use
larger corpora and then remove infrequent words
setting m with high values (e.g., 50 or 100). In
fact, with increasing value of m the number of not
given answers increases rapidly. It passes from
300 (m = 1) to 893 (m = 5).</p>
        <p>Some of the words that are not present in the
vocabulary with m = 1 include plural verbs (1st
person), that probably are not used by a typical
Wikipedia editor and remote past verbs (1st
person), a tense that in recent years is disappearing
from written and spoken Italian. Some of these
verbs are:
giochiamo
affiliamo
rallentiamo
zappiamo
implementai
rallentai
mescolai
nuotai</p>
        <p>In Berardi et al. (2015) the number of not given
answer is 1.220. The accuracy of their
embeddings, obtained using a larger corpus and using
the hyper-parameters that perform well on English
language, is always lower than those obtained with
our setting, in both the morphosyntactic and the
semantic tasks. This confirms that the
regularization of the parameters is crucial for good
representation of the embeddings, since the Berardi
et al. (2015)’s model has been trained on a much
larger corpus and for this should outperform ours.
Furthermore, this model seems to have some
tokenization problem.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>We have tested two word representation methods:
SG and CBOW training them only on a dump of
the Italian Wikipedia. We compared the results of
the two models using 12 combinations of
hyperparameters.</p>
      <p>We have adopted a simple word analogy test
to evaluate the generated word embeddings. The
results have shown that increasing the number of
pilotesse
pere
real
kwanza
aquila
migliore colori meloni
matrigna figliastra sua
lev yen mamma
vantaggiosissimo urlano stimano
eroina programmato impossibilmente
dim = 500 &amp; n = 10 solo n = 10
dire detto predire predetto cantare cantato predire predetto
mescolare mescolando predire predicendo correre correndo predire predicendo
predire predicendo generare generando generare generando predire predicendo
rallentare rallentando predire predicendo predire predicendo programmare programmando
scoprire scoprendo predire predicendo scrivere scrivendo predire predicendo
solo dim = 500
descrivere descritto predire predetto
vedere visto predire predetto
dimensions and the number of negative examples
improve the performance of both the models.</p>
      <p>These types of improvement seems to be
beneficial only for the semantic relationships. On
the contrary the syntactical relationship are
negatively affected by the low frequency of many of
its terms. This should be related to the
morphological complexity of Italian. In the future it would be
helpful to represent the spatial relationship
regarding specific syntactical domain in order to
evaluate the contribution of hyper-parametrization to
syntactical relationship accuracy. Moreover future
work will include the testing of these word
embedding parametrizations in practical applications
(e.g. analysis of patents’descriptions and books’
corpora).</p>
      <sec id="sec-5-1">
        <title>Acknowledgments</title>
        <p>Part of this work has been conducted during a collaboration
of the first author with DocFlow Italia. All the experiments in
this paper have been conducted on the SCSCF multiprocessor
cluster system at University Ca’ Foscari of Venice.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Rami</given-names>
            <surname>Al-Rfou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Bryan</given-names>
            <surname>Perozzi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Steven</given-names>
            <surname>Skiena</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Polyglot: Distributed word representations for multilingual nlp</article-title>
          .
          <source>CoNLL-2013</source>
          , page 183.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Giuseppe</given-names>
            <surname>Attardi</surname>
          </string-name>
          and
          <string-name>
            <given-names>Maria</given-names>
            <surname>Simi</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Dependency parsing techniques for information extraction</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>Giuseppe</given-names>
            <surname>Attardi</surname>
          </string-name>
          , Vittoria Cozza, and
          <string-name>
            <given-names>Daniele</given-names>
            <surname>Sartiano</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Adapting linguistic tools for the analysis of italian medical records</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>Giuseppe</given-names>
            <surname>Attardi</surname>
          </string-name>
          , Daniele Sartiano, Chiara Alzetta,
          <source>Federica Semplici, and Largo B Pontecorvo</source>
          .
          <year>2016</year>
          .
          <article-title>Convolutional neural networks for sentiment analysis on italian tweets</article-title>
          . In CLiC-it/EVALITA.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Yoshua</given-names>
            <surname>Bengio</surname>
          </string-name>
          , Réjean Ducharme, Pascal Vincent, and
          <string-name>
            <given-names>Christian</given-names>
            <surname>Jauvin</surname>
          </string-name>
          .
          <year>2003</year>
          .
          <article-title>A neural probabilistic language model</article-title>
          .
          <source>Journal of machine learning research</source>
          ,
          <volume>3</volume>
          (Feb):
          <fpage>1137</fpage>
          -
          <lpage>1155</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>Giacomo</given-names>
            <surname>Berardi</surname>
          </string-name>
          , Andrea Esuli, and Diego Marcheggiani.
          <year>2015</year>
          .
          <article-title>Word embeddings go to italy: A comparison of models and training datasets</article-title>
          .
          <source>In IIR.</source>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>Ronan</given-names>
            <surname>Collobert</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jason</given-names>
            <surname>Weston</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>A unified architecture for natural language processing: Deep neural networks with multitask learning</article-title>
          .
          <source>In Proceedings of the 25th international conference on Machine learning</source>
          , pages
          <fpage>160</fpage>
          -
          <lpage>167</lpage>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>John Rupert Firth</surname>
          </string-name>
          .
          <year>1935</year>
          .
          <article-title>The technique of semantics</article-title>
          .
          <source>Transactions of the philological society</source>
          ,
          <volume>34</volume>
          (
          <issue>1</issue>
          ):
          <fpage>36</fpage>
          -
          <lpage>73</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>Yoav</given-names>
            <surname>Goldberg</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Neural network methods for natural language processing</article-title>
          .
          <source>Synthesis Lectures on Human Language Technologies</source>
          ,
          <volume>10</volume>
          (
          <issue>1</issue>
          ):
          <fpage>1</fpage>
          -
          <lpage>309</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Zellig S Harris</surname>
          </string-name>
          .
          <year>1954</year>
          .
          <article-title>Distributional structure</article-title>
          . word,
          <volume>10</volume>
          (
          <issue>2- 3</issue>
          ):
          <fpage>146</fpage>
          -
          <lpage>162</lpage>
          . reprinted in fodor,
          <source>j. a and katz</source>
          ,
          <source>jj (eds.)</source>
          ,
          <article-title>readings in the philosophy of language.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>Yoon</given-names>
            <surname>Kim</surname>
          </string-name>
          , Yacine Jernite, David Sontag, and
          <string-name>
            <surname>Alexander M Rush</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Character-aware neural language models</article-title>
          .
          <source>In AAAI</source>
          , pages
          <fpage>2741</fpage>
          -
          <lpage>2749</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>Omer</surname>
            <given-names>Levy</given-names>
          </string-name>
          , Yoav Goldberg, and
          <string-name>
            <surname>Israel</surname>
          </string-name>
          Ramat-Gan.
          <year>2014</year>
          .
          <article-title>Linguistic regularities in sparse and explicit word representations</article-title>
          .
          <source>In CoNLL</source>
          , pages
          <fpage>171</fpage>
          -
          <lpage>180</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <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>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <given-names>Tomas</given-names>
            <surname>Mikolov</surname>
          </string-name>
          , Martin Karafiát, Lukas Burget, Jan Cernocky`, and
          <string-name>
            <given-names>Sanjeev</given-names>
            <surname>Khudanpur</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Recurrent neural network based language model</article-title>
          .
          <source>In Interspeech</source>
          , volume
          <volume>2</volume>
          , page 3.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <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>2013</year>
          .
          <article-title>Efficient estimation of word representations in vector space</article-title>
          .
          <source>arXiv preprint arXiv:1301</source>
          .
          <fpage>3781</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <surname>Egon W Stemle</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>bot. zen@ evalita 2016-a minimallydeep learning pos-tagger (trained for italian tweets)</article-title>
          . In CLiC-it/EVALITA.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <given-names>Fabio</given-names>
            <surname>Tamburini</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>A bilstm-crf pos-tagger for italian tweets using morphological information</article-title>
          . In CLiCit/EVALITA.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>