<!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>A BiLSTM-CRF PoS-tagger for Italian tweets using morphological information</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Fabio Tamburini</string-name>
          <email>fabio.tamburini@unibo.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>FICLIT - University of Bologna</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>English. This paper presents some experiments for the construction of an highperformance PoS-tagger for Italian using deep neural networks techniques (DNN) integrated with an Italian powerful morphological analyser that has been applied to tag Italian tweets. The proposed system ranked third at the EVALITA2016PoSTWITA campaign.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        In recent years there were a large number of works
trying to push the accuracy of the PoS-tagging
task forward using new techniques, mainly from
the deep learning domain
        <xref ref-type="bibr" rid="ref1 ref12 ref2 ref3 ref6">(Collobert et al., 2011;
Søgaard, 2011; dos Santos and Zadrozny, 2014;
Huang et al., 2015; Wang et al., 2015; Chiu and
Nichols, 2016)</xref>
        .
      </p>
      <p>
        In this study, still work-in-progress, we set-up
a PoS-tagger for Italian able to gather the highest
classification performances by using any available
language resource and the most up-to-date DNN.
We used AnIta
        <xref ref-type="bibr" rid="ref10">(Tamburini and Melandri, 2012)</xref>
        ,
one of the most powerful morphological analysers
for Italian, based on a wide lexicon (about 110.000
lemmas), for providing the PoS-tagger with a large
set of useful information.
      </p>
      <p>
        The general PoS-tagger has been described in
        <xref ref-type="bibr" rid="ref11">(Tamburini, 2016)</xref>
        . This paper briefly describes
the adaptation process we made for annotating
Italian tweets.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2 Input features</title>
      <p>The set of input features for each token is basically
formed by two different components: the word
embedding and some morphological information.
2.1</p>
      <sec id="sec-2-1">
        <title>Word Embeddings</title>
        <p>
          All the embeddings used in our experiments were
extracted from a twitter corpus composed by
200 millions of tokens, belonging to 11
millions of tweets downloaded at the beginning of
2012 (February and March), by using the tool
word2vec1
          <xref ref-type="bibr" rid="ref8">(Mikolov et al., 2013)</xref>
          . We added
two special tokens to mark the sentence beginning
‘&lt;s&gt;’ and ending ‘&lt;/s&gt;’.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Morphological features, Unknown words handling and Sentence padding</title>
        <p>
          As described in
          <xref ref-type="bibr" rid="ref11">(Tamburini, 2016)</xref>
          , we extended
the word embeddings computed in a completely
unsupervised way by concatenating to them a
vector containing the possible PoS-tags provided by
the AnIta analyser. This tool is also able to
identify, through the use of simple regular expressions,
numbers, dates, URLs, emails, etc., and to assign
them the proper tag(s).
        </p>
        <p>With regard to unknown words handling and
sentence padding we followed the same procedure
for the general tagger described in the cited paper,
managing each sentence as one single sequence
padded at the borders.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3 (Deep) Learning Blocks</title>
      <p>
        All the experiments presented in this paper has
been performed using Keras2. Keras provides
some basic neural network blocks as well as
different learning procedures for the desired network
1https://code.google.com/archive/p/word2vec/
2https://github.com/fchollet/keras/tree/master/keras
configuration and simple tools for writing new
blocks. In our experiments we used Bidirectional
Long Short-Term Memory - LSTM
        <xref ref-type="bibr" rid="ref4 ref5">(Hochreiter
and Schmidhuber, 1997; Graves and
Schmidhuber, 2005)</xref>
        , and a new layer we wrote to handle
Conditional Random Fields (CRF). We did some
experiments stacking them after the softmax layer.
      </p>
      <p>
        Figure 1 shows the DNN structure used in our
experiments.
As for the general tagger
        <xref ref-type="bibr" rid="ref11">(Tamburini, 2016)</xref>
        , we
did not test all the possible combinations; we used,
instead, the most common set-up of parameters
gathered from the literature. Table 1 outlines the
whole setup for the unmodified hyper-parameters.
      </p>
      <p>The DNN hidden layers were composed by 256
neurons.
4.2</p>
      <sec id="sec-3-1">
        <title>The Early Stopping procedure</title>
        <p>The usual way to set up an experiment following
this suggestions involves splitting the gold
standard into three different instance sets: the
training set, for training, the validation set, to
determine the stopping point, and the test set to
evaluate the system. However, we are testing our
systems on real evaluation data that has been already
word2vec Embed.</p>
        <p>Hyperpar. Value
type SkipGr.
size 100
(1/2) win. 5
neg. sampl. 25
sample 1e-4
iter 15</p>
      </sec>
      <sec id="sec-3-2">
        <title>Feature extraction</title>
      </sec>
      <sec id="sec-3-3">
        <title>Hyperpar. Value</title>
        <p>window 5</p>
      </sec>
      <sec id="sec-3-4">
        <title>Learning Params.</title>
        <p>batch (win) 1/4*NU
batch (seq) 1
Opt. Alg. Adam
Loss Func. Categ.CE
split by the organisers into development and test
set. Thus, we can divide the development set into
training/validation set for optimising the
hyperparameters and define the stopping epoch, but, for
the final evaluation, we would like to train the final
system on the complete development set to adhere
to the evaluation constraints and to benefit from
using more training data.</p>
        <p>Having two different training procedures for the
optimisation and evaluation phases leads to a more
complex procedure for determining the stopping
epoch. Moreover, the typical accuracy profile for
DNN systems is not smooth and oscillate
heavily during training. To avoid any problem in
determining the stopping point we smoothed all the
profiles using a bezier spline. The procedure we
adopted to determine the stopping epoch is (please
look at Fig. 2): (1) find the first maximum in the
validation smoothed profile - A; (2) find the
corresponding value of accuracy on the smoothed
training profile - B; (3) find the point in the smoothed
development set profile having the same accuracy
as in B - C; (4) select the epoch corresponding at
point C as the stopping epoch - D.
First of all we split the Development Set into a
proper training set (109,273 tokens) and a
validation set (12,132 tokens) for setting up the entire
system, to verify the correctness of the whole
tagging process and to derive a first estimate of the
tagger performances. We ran some experiments
with three different seeds and, after having applied
the early stop procedure described above, we
derived the optimal stopping epoch to be used for the
final testing and the tagging performances on the
training/validation pair. Table 2 outlines these
results.</p>
        <p>(A)
(B)
(C)
Avg.</p>
      </sec>
      <sec id="sec-3-5">
        <title>Tagging Accuracy</title>
        <p>95.56
95.49
95.53
95.53</p>
      </sec>
      <sec id="sec-3-6">
        <title>Stopping epoch</title>
        <p>12
13
10</p>
        <p>We presented two kinds of results for the final
evaluation: (1) the first official run was derived by
applying the same random seed as the
configuration (A), and (2) we submitted also, as an
unofficial run, a tagged version obtained by combining
all the three configurations using a voting scheme.</p>
        <p>In Table 3 we can see our system performances,
namely AnIta-BiLSTM-CRF (ABC), compared
with all the systems that participated at the
PoSTWITA 2016 task.
5</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusions and discussion</title>
      <p>The proposed system for PoS-tagging, integrating
DNNs and a powerful morphological analyser,
exhibited very good accuracy results when applied to
the PoSTWITA task of the EVALITA 2016
campaign.</p>
      <p>Looking at the official results, and comparing
them with the experiments we devised to set up
our system, it is easy to note the large
difference in performances. During the setup phase we
obtained coherent results well above 95% of
accuracy, while the best performing system in the
official evaluation exhibit performances slightly
above 93%. It is a huge difference for this kind
of task, rarely observed in real experiments.</p>
      <p>In my opinion there is only one reason that
explains this difference in performances: the
documents in the test set are not drawn from the same
kind of corpus as the development set and this
is not a desirable condition unless you explicitly
organise a domain adaptation task. The TS, as
well as the DS, have been inherited from the
SENTIPOLC task of the same evaluation campaign,
thus the problem could be the same also for other
tasks of the same evaluation campaign.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Jason</given-names>
            <surname>Chiu</surname>
          </string-name>
          and
          <string-name>
            <given-names>Eric</given-names>
            <surname>Nichols</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Sequential Labeling with Bidirectional LSTM-CNNs</article-title>
          .
          <source>In Proc. International Conf. of Japanese Association for NLP</source>
          , pages
          <fpage>937</fpage>
          -
          <lpage>940</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <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>J. Mach. Learn. Res.</source>
          ,
          <volume>12</volume>
          :
          <fpage>2493</fpage>
          -
          <lpage>2537</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <source>Cicero dos Santos and Bianca Zadrozny</source>
          .
          <year>2014</year>
          .
          <article-title>Learning character-level representations for partof-speech tagging</article-title>
          .
          <source>In Proc. of the 31st International Conference on Machine Learning, JMLR</source>
          , volume
          <volume>32</volume>
          . JMLR
          <string-name>
            <surname>W</surname>
          </string-name>
          &amp;CP.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>Alex</given-names>
            <surname>Graves</surname>
          </string-name>
          and Ju¨rgen Schmidhuber.
          <year>2005</year>
          .
          <article-title>Framewise phoneme classification with bidirectional lstm and other neural network architectures</article-title>
          .
          <source>Neural Networks</source>
          ,
          <volume>18</volume>
          (
          <issue>5-6</issue>
          ):
          <fpage>602</fpage>
          -
          <lpage>610</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <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>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>Zhiheng</given-names>
            <surname>Huang</surname>
          </string-name>
          , Wei Xu,
          <string-name>
            <given-names>and Kai</given-names>
            <surname>Yu</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Bidirectional LSTM-CRF Models for Sequence Tagging</article-title>
          . ArXiv e-prints,
          <volume>1508</volume>
          .
          <year>01991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>D.P.</given-names>
            <surname>Kingma</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.L.</given-names>
            <surname>Ba</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Adam: a method for stochastic optimization</article-title>
          .
          <source>In Proc. International Conference on Learning Representations - ICLR.</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>13</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <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>In Proc. of Workshop</source>
          at ICLR.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>Anders</given-names>
            <surname>Søgaard</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Semi-supervised condensed nearest neighbor for part-of-speech tagging</article-title>
          .
          <source>In Proc. of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies</source>
          , pages
          <fpage>48</fpage>
          -
          <lpage>52</lpage>
          , Portland, Oregon, USA.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>Fabio</given-names>
            <surname>Tamburini</surname>
          </string-name>
          and
          <string-name>
            <given-names>Matias</given-names>
            <surname>Melandri</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>AnIta: a powerful morphological analyser for Italian</article-title>
          .
          <source>In Proc. 8th International Conference on Language Resources and Evaluation - LREC</source>
          <year>2012</year>
          , pages
          <fpage>941</fpage>
          -
          <lpage>947</lpage>
          , Istanbul.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>Fabio</given-names>
            <surname>Tamburini</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>(Better than) State-of-the-Art PoS-tagging for Italian Texts</article-title>
          .
          <source>In Proc. Third Italian Conference on Computational</source>
          Linguistics - CLiC-it, Napoli.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <given-names>Peilu</given-names>
            <surname>Wang</surname>
          </string-name>
          , Yao Qian, Frank. K Soong,
          <string-name>
            <surname>Lei He</surname>
            , and
            <given-names>Hai</given-names>
          </string-name>
          <string-name>
            <surname>Zhao</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>A Unified Tagging Solution: Bidirectional LSTM Recurrent Neural Network with Word Embedding</article-title>
          . ArXiv e-prints,
          <volume>1511</volume>
          .
          <fpage>00215</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>