<!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>Diachronic Analysis of the Italian Language exploiting Google Ngram</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Pierpaolo Basile</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Annalina Caputo</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Roberta Luisi</string-name>
          <email>2froby.luisig@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giovanni Semeraro</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science University of Bari Aldo Moro Via</institution>
          ,
          <addr-line>E. Orabona, 4 - 70125 Bari</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>English. In this paper, we propose several methods for the diachronic analysis of the Italian language. We build several models by exploiting Temporal Random Indexing and the Google Ngram dataset for the Italian language. Each proposed method is evaluated on the ability to automatically identify meaning shift over time. To this end, we introduce a new dataset built by looking at the etymological information reported in some dictionaries.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>by the need to reflect the continuous changes of
the world. The evolution of word meanings has
been studied for several centuries, but this kind of
investigation has been limited by the low amount
of data on which to perform the analysis.
Moreover, in order to reveal structural changes in word
meanings, this analysis has to explore long periods
of time.</p>
      <p>
        Nowadays, the large amount of digital content
opens new perspectives for the diachronic analysis
of language. This large amount of data needs
efficient computational approaches. In this scenario,
Distributional Semantic Models (DSMs) represent
a promising solution. DSMs are able to
represent words as points in a geometric space,
generally called WordSpace
        <xref ref-type="bibr" rid="ref11 ref12">(Schiitze, 1993; Sahlgren,
2006)</xref>
        simply analysing how words are used in a
corpus. However, a WordSpace represents a
snapshot of a specific corpus and it does not take into
account temporal information.
      </p>
      <p>
        Since its first release, the Google Ngram dataset
        <xref ref-type="bibr" rid="ref10">(Michel et al., 2011)</xref>
        has inspired a lot of works
on the analysis of cultural trends and linguistic
variations. Moving away from mere frequentist
approaches, Distributional Semantic Models have
proved to be quite effective in measuring a
meaning shift through the analysis of variation of word
co-occurrences. One of the earlier attempts can
be dated to Gulordava and Baroni (2011), where
a co-occurrence matrix is used to model the
semantics of terms. In this model, similarly to ours,
the cosine similarity between vectors representing
a term in two different periods is exploited as a
predictor of the meaning shift: low values suggest
a change in the words that co-occur with the
target. The co-occurrence matrix is computed with
local mutual information scores and the context
elements are fixed with respect to the different time
periods, hence the spaces are directly
comparable. However, this kind of direct comparison does
not hold when the vector representation is
manipulated, like in reduction methods (SVD), or learning
approaches (word2vec). In these cases, each space
has its own coordinate axis. Then, some kind of
alignment between spaces is required. To this end,
Hamilton et al. (2016) use orthogonal Procrustes,
while Kulkarni et al. (2015a) learn a
transformation matrix.
      </p>
      <p>
        In this paper, we propose an evolution of our
previous work
        <xref ref-type="bibr" rid="ref1 ref2 ref8 ref9">(Basile et al., 2014; Basile et al.,
2015)</xref>
        for analysing word meanings over time.
This model, differently from those of Hamilton et
al. (2016) and Kulkarni et al. (2015a), creates
different WordSpaces for each time period in terms
of the same common random vectors; then, the
resulting word vectors are directly comparable with
one another. In particular, we propose an
efficient method for building a DSM model which
takes into account temporal information relying on
a very large corpus: the Google Ngram for the
Italian language. Moreover, for the first time, we
provide a dataset for the evaluation of word meaning
change points detection specifically set up for the
Italian language.
      </p>
      <p>The paper is structured as follows: Section
2 provides details about our methodology, while
Section 3 describes the dataset that we have
developed and the results of a preliminary evaluation.
Section 4 reports final remarks and future work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Methodology</title>
      <p>
        Our method has its roots in a previous model based
on Temporal Random Indexing (TRI)
        <xref ref-type="bibr" rid="ref1 ref2 ref8 ref9">(Basile et
al., 2014; Basile et al., 2015)</xref>
        . In particular, we
evolve the TRI approach in two directions: 1) we
improve the system in order to manage very large
datasets, such as Google Ngram; 2) we introduce
a new approach based on Reflective Random
Indexing (RRI)
        <xref ref-type="bibr" rid="ref3">(Cohen et al., 2010)</xref>
        with the aim of
identifying indirect inferences that can lead to the
discovery of implicit connections between word
meanings.
      </p>
      <p>The idea behind TRI is to build different
WordSpaces for each time period that we want to
analyse. The peculiarity of TRI is that word
vectors over different time periods are directly
comparable because they are built using the same random
vectors. In particular TRI works as follows:
1. Given a corpus C of documents and a
vocabulary V of terms1 extracted from C, the
method assigns a random vector ri to each
term ti 2 V . A random vector is a vector that
has values only in f-1, 0, 1g and it is sparse
with few non-zero elements distributed
randomly along its dimensions. The set of
random vectors assigned to all terms in V are
near-orthogonal;
2. The corpus C is split in different time periods
Tk using temporal information, for example
the year of publication;
3. For each period Tk, a WordSpace W Sk is
built. All the terms of V occurring in Tk are
represented by a semantic vector. The
semantic vector svik for the i-th term in Tk is built as
the sum of all the random vectors of the terms
co-occurring with ti in Tk. When
computing the sum, we weigh the random vector; in
this case we adopt a formula based on inverse
document frequency. Formally, the weight is
computed as w(ri) = log #Ctkik , where Ck
is the total number of occurrences in Tk and
#tik is the occurrences of the term ti in Tk.
The idea is to give less weight to the most
frequent words.</p>
      <p>In this way, the semantic vectors across all time
periods are comparable since they are the sum of
the same random vectors.</p>
      <p>RRI can be implemented by repeating the steps
2 and 3 several times. Where at each iteration
random vectors are replaced by the semantic vectors
built in the previous step. The idea is to model
implicit connections between terms that never
cooccur together, but that could occur frequently
with other shared terms.</p>
      <p>The next two sub-sections provide details about
the Google Ngram dataset and the method used to
automatically detect word meanings shift.
2.1</p>
      <sec id="sec-2-1">
        <title>Google Ngram</title>
        <p>Google Ngram is a very large dataset containing
all the n-grams (up to five) extracted from Google
Books. It is built by analysing over five millions
books spanning the years from 1500 to 2012,
but the developers estimate that the most reliable
period is from 1800 to 2012. The dataset covers
several languages including Italian. For each
1The terms that we want to analyse. Usually, the most n
frequent terms are extracted.
language, several compressed files are released.
Each file contains for each line the following
information: Ngram &lt;TAB&gt; year &lt;TAB&gt;
match count &lt;TAB&gt; volume count. For
example, the line “analysis is often
described as 1991 104 5” means that
the ngram “analysis is often described as” occurs
104 times in 5 books in the 1991 .</p>
        <p>We modify TRI for building the WordSpaces
directly from the Google Ngram dataset. In
particular, we need a pre-processing step in
which we split the n-grams in several files
according to the time periods we want to
analyse. For example, if we fix the dimension
of a time period to ten years from 1850 to
2012, we build several files for each period:
T1 = 1850-1859; T2 = 1860-1869; : : : ; T16 =
2000-2009; T17 = 2010-2012. Each file contains
only the n-grams that occur in the specific time
period. We remove information about the year and
the book count since they are not useful in the
subsequent steps. Considering the previous example,
the line “analysis is often described
as 104” will be stored in the file 1990-1999.</p>
        <p>After this pre-processing step, we can easily run
TRI and RRI, where RRI can be repeated multiple
times.
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Change point detection</title>
        <p>To track the word meaning change over time, for
each term ti we build a time series (ti) taking
into account several methods. A time series is a
sequence of values, one value for each time
period, that indicates the semantic shift of that term
in the specific period. We adopt several strategies
for building time series. The first strategy is based
on term log-frequency; each value in the series is
defined as: k(ti) = log( #Ctkik ).</p>
        <p>In order to exploit the ability of our methods
in computing vectors similarity over time periods,
we define two strategies for building the time
series:
point-wise: k(ti) is defined as the cosine
similarity between svik and svik 1. In this way,
we want to capture vector changes between
two time periods;
cumulative: we build a cumulative vector
sviCk 1 = Pjk=01 svij and compute the cosine
similarity with respect to the vector svik.
The idea is that the semantics at point k 1
depends on the semantic of all the previous
time periods.</p>
        <p>
          Given a time series we need a method for
finding significant change points in the series. We
adopt the strategy proposed in
          <xref ref-type="bibr" rid="ref8 ref9">(Kulkarni et al.,
2015b)</xref>
          based on the Mean shift model
          <xref ref-type="bibr" rid="ref13">(Taylor,
2000)</xref>
          . According to this model, we define a mean
shift of a general time series pivoted at time
period j as:
        </p>
        <p>K( ) =</p>
        <p>1
l
j</p>
        <p>l</p>
        <p>X
k=j+1
k</p>
        <p>j
1 X
j
k=1
k
(1)</p>
        <p>
          In order to understand if a mean shift is
statistically significant at time j, a bootstrapping
          <xref ref-type="bibr" rid="ref5">(Efron
and Tibshirani, 1994)</xref>
          approach under the null
hypothesis that there is no change in the mean is
adopted. In particular, statistical significance is
computed by first constructing B bootstrap
samples by permuting (ti). Second, for each
bootstrap sample P, K(P ) is calculated to provide
its corresponding bootstrap statistic and statistical
significance (p-value) of observing the mean shift
at time j compared to the null distribution.
Finally, we estimate the change point by considering
the time point j with the minimum p-value score.
Since multiple words can have the same p-value,
we sort them according to their frequency. The
output of this process is a ranking of words that
potentially have changed meaning.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Evaluation</title>
      <p>The goal of the evaluation is twofold: 1) to build
a standard benchmarking for meaning shift
detection for the Italian language; 2) to evaluate the
performance of the proposed methods and compare
them with the baseline model based on the word
frequency.</p>
      <p>A list of meaning shifts for the Italian language
is not available, then we build a new dataset using
a pooling strategy. In particular, we retrieve the
list of meaning shifts, as explained in Section 2.2,
using the cumulative strategy for each of the
following methods: word frequency, TRI, TRRI with
one iteration and TRRI with two iterations.</p>
      <p>Taking into account the first 50 words for each
system, we manually check for each word if a
meaning shift occurs by exploiting some
dictionaries. We use two dictionaries: the “Sabatino
Coletti” available on-line2 and the “Dizionario
Eti2http://dizionari.corriere.it/
dizionario_italiano/
mologico Zanichelli” available on CD-ROM.
Finally, we obtain a gold standard that consists of 40
words and their corresponding change points.</p>
      <p>All the methods, with exception of word
frequency, are built using co-occurrences
information extracted from 5-grams in the Google Ngram
dataset for the Italian. The vector dimension is set
to 1,000 for all the approaches based on Random
Indexing using two non-zero elements in the
random vector.</p>
      <p>We adopt accuracy as evaluation metric. Given
a list of n change points returned by the
system, we compute the ratio between the number of
change points correctly identified in the gold
standard3 and n. In order to identify the correct change
points, we consider not only the word4, but also
the year of the change point. In particular, the year
predicted by the system must be equal or greater
than one of the years reported in the gold standard.
We compute the accuracy using different values of
n (10, 100, ALL). Results of the evaluation are
reported in Table 1. In particular, we evaluate 7
systems: logf req is the baseline based on word
frequency; T RI is the Temporal Random Indexing
method, T RRI1 is the Temporal Reflective
Random Indexing with one iteration, while T RRI2
adopts two iterations. For the methods based on
Random Indexing, we investigate both the
pointwise and the cumulative strategy to compute the
change points.</p>
      <p>The analysis of the results shows that T RI
generally provides better results than T RRI.
Moreover, the point-wise strategy always outperforms
the cumulative one. With respect to the baseline,
it has the same accuracy of T RI for both acc@10
3The gold standard adopted in this evaluation is available
here: https://dl.dropboxusercontent.com/u/
16026979/data/TRI_CLIC_2016_change_word.</p>
      <p>4The word matching is performed taking into account also
the inflected forms.
and acc@100, while it performs worse than T RI
and T RRI1 when the accuracy is computed over
the whole list of terms (ALL). These results
suggest that, while there are not too many differences
between the two methods considering smaller lists
of results, T RI is actually able to detect more
meaning shifts on a larger set of terms. T RRI2
always provides the worst results; we speculate
that two iterations introduce too much noise in the
model. A closer scrutiny to the list of words
provided by T RRI2 highlights the presence of many
foreign words: a simplistic conclusion may
suggest that this approach is able to identify foreign
terms that are introduced in the Italian language.
However, we think that the output of this method
deserves more investigations carried out by
designing an ad-hoc evaluation.</p>
      <p>The evaluation is based on the predicted year,
which has to be equal or greater than one of the
years reported in the gold standard, we conduct
a further analysis to measure how far the
prediction is from the exact value. In particular, we
compute the mean and the standard deviation
taking into account the differences between the
predicted and the exact year. The results of this
analysis are reported in Table 2. We observe the both
T RRI1cum and T RRI2cum produce the best
results despite their low accuracy, while T RIcum
reports the best trade-off between accuracy and
precision in detecting the correct year. It is important
to underline that the size of the time interval
influences this kind of analysis since if the algorithm
predicts 1900, the change point could happen in
the interval 1900-19095. We plan to design a more
accurate analysis by exploring a time interval set
to one year as future work.</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>In this work we proposed several methods based
on Random Indexing for the diachronic
analysis of the Italian language. We built a dataset
for the evaluation of meaning shift by exploiting
etymological information taken from two Italian
dictionaries. We compared our approaches with
respect a baseline based on word frequency
obtaining promising results. In particular, the TRI
method showed its better capability in retrieving
more meaning shifts on a longer list of terms. As
future work, we plan to extend the dataset with
further words and to investigate other methods based
on word-embeddings.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgement</title>
      <p>This work is partially supported by the project
“Multilingual Entity Liking” funded by the
Apulia Region under the program FutureInResearch.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Pierpaolo</given-names>
            <surname>Basile</surname>
          </string-name>
          , Annalina Caputo, and
          <string-name>
            <given-names>Giovanni</given-names>
            <surname>Semeraro</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Analysing word meaning over time by exploiting temporal random indexing</article-title>
          . In Roberto Basili, Alessandro Lenci, and Bernardo Magnini, editors,
          <source>First Italian Conference on Computational Linguistics</source>
          CLiC-it
          <year>2014</year>
          . Pisa University Press.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Pierpaolo</given-names>
            <surname>Basile</surname>
          </string-name>
          , Annalina Caputo, and
          <string-name>
            <given-names>Giovanni</given-names>
            <surname>Semeraro</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Temporal random indexing: A system for analysing word meaning over time</article-title>
          .
          <source>Italian Journal of Computational Linguistics</source>
          ,
          <volume>1</volume>
          (
          <issue>1</issue>
          ):
          <fpage>55</fpage>
          -
          <lpage>68</lpage>
          ,
          <fpage>12</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>Trevor</given-names>
            <surname>Cohen</surname>
          </string-name>
          , Roger Schvaneveldt, and
          <string-name>
            <given-names>Dominic</given-names>
            <surname>Widdows</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Reflective random indexing and indirect inference: A scalable method for discovery of implicit connections</article-title>
          .
          <source>Journal of biomedical informatics</source>
          ,
          <volume>43</volume>
          (
          <issue>2</issue>
          ):
          <fpage>240</fpage>
          -
          <lpage>256</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Ferdinand De Saussure</surname>
          </string-name>
          .
          <year>1983</year>
          .
          <article-title>Course in general linguistics</article-title>
          .
          <source>La Salle</source>
          , Illinois: Open Court.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Bradley</given-names>
            <surname>Efron and Robert J Tibshirani</surname>
          </string-name>
          .
          <year>1994</year>
          .
          <article-title>An introduction to the bootstrap</article-title>
          .
          <source>Chapman</source>
          and Hall/CRC.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>Kristina</given-names>
            <surname>Gulordava</surname>
          </string-name>
          and
          <string-name>
            <given-names>Marco</given-names>
            <surname>Baroni</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>A distributional similarity approach to the detection of semantic change in the google books ngram corpus</article-title>
          .
          <source>In Proceedings of the GEMS 2011 Workshop on GEometrical Models of Natural Language Semantics</source>
          , pages
          <fpage>67</fpage>
          -
          <lpage>71</lpage>
          , Edinburgh,
          <string-name>
            <surname>UK</surname>
          </string-name>
          , July. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>William L. Hamilton</surname>
            , Jure Leskovec, and
            <given-names>Dan</given-names>
          </string-name>
          <string-name>
            <surname>Jurafsky</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Diachronic word embeddings reveal statistical laws of semantic change</article-title>
          .
          <source>CoRR, abs/1605</source>
          .09096.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>Vivek</given-names>
            <surname>Kulkarni</surname>
          </string-name>
          , Rami Al-Rfou,
          <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>
          . 2015a.
          <article-title>Statistically significant detection of linguistic change</article-title>
          .
          <source>In Proceedings of the 24th International Conference on World Wide Web, WWW '15</source>
          , pages
          <fpage>625</fpage>
          -
          <lpage>635</lpage>
          , New York, NY, USA. ACM.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>Vivek</given-names>
            <surname>Kulkarni</surname>
          </string-name>
          , Rami Al-Rfou,
          <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>
          . 2015b.
          <article-title>Statistically significant detection of linguistic change</article-title>
          .
          <source>In Proceedings of the 24th International Conference on World Wide Web</source>
          , pages
          <fpage>625</fpage>
          -
          <lpage>635</lpage>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Jean-Baptiste</surname>
            <given-names>Michel</given-names>
          </string-name>
          , Yuan Kui Shen, Aviva Presser Aiden, Adrian Veres, Matthew K Gray, Joseph P Pickett, Dale Hoiberg, Dan Clancy,
          <string-name>
            <given-names>Peter</given-names>
            <surname>Norvig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Jon</given-names>
            <surname>Orwant</surname>
          </string-name>
          , et al.
          <year>2011</year>
          .
          <article-title>Quantitative analysis of culture using millions of digitized books</article-title>
          .
          <source>science</source>
          ,
          <volume>331</volume>
          (
          <issue>6014</issue>
          ):
          <fpage>176</fpage>
          -
          <lpage>182</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>Magnus</given-names>
            <surname>Sahlgren</surname>
          </string-name>
          .
          <year>2006</year>
          .
          <article-title>The word-space model: Using distributional analysis to represent syntagmatic and paradigmatic relations between words in highdimensional vector spaces</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <given-names>Hinrich</given-names>
            <surname>Schiitze</surname>
          </string-name>
          .
          <year>1993</year>
          .
          <article-title>Word space</article-title>
          .
          <source>Advances in neural information processing systems</source>
          ,
          <volume>5</volume>
          :
          <fpage>895</fpage>
          -
          <lpage>902</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>Wayne A</given-names>
            <surname>Taylor</surname>
          </string-name>
          .
          <year>2000</year>
          .
          <article-title>Change-point analysis: a powerful new tool for detecting changes</article-title>
          .
          <source>Taylor Enterprises</source>
          , Inc.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>