<!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>Cross-Language Record Linkage using Word Embedding driven Metadata Similarity Measurement</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yuting Song</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Taisuke Kimura</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Biligsaikhan Batjargal</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Akira Maeda</string-name>
          <email>amaeda@is.ritsumei.ac.jp</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>College of Information Science and Engineering, Ritsumeikan University</institution>
          ,
          <country country="JP">Japan</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Graduate School of Information Science and Engineering, Ritsumeikan University</institution>
          ,
          <country country="JP">Japan</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Research Organization of Science and Engineering, Ritsumeikan University</institution>
          ,
          <country country="JP">Japan</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Aiming to link the records that refer to the same entity across multiple databases in different languages, we address the mismatches of wordings between literal translations of metadata in source language and metadata in target language, which cannot be calculated by string-based measures. In this paper, we propose a method based on word embedding, which can capture the semantic similarity relationships among words. The effectiveness of this method is confirmed in linking the same records between Ukiyo-e (Japanese woodblock printing) databases in Japanese and English. This method could be applied to other languages since it makes little assumption about languages.</p>
      </abstract>
      <kwd-group>
        <kwd>Cross-language record linkage</kwd>
        <kwd>Similarity measurement</kwd>
        <kwd>Word embedding</kwd>
        <kwd>Semantic matching</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Cross-language record linkage is a task of finding pairs of records that refer to the
same entity across multiple databases in different languages. It is crucial to various
fields, such as federated search and data integration. Furthermore, the metadata of
identical records in different languages are helpful to build multilingual Linked Data.
Cross-language record linkage consists of two steps. First, the metadata of a record,
e.g. title, author, publisher, in the source language are translated into the target
language based on bilingual dictionaries. Next, identical records are determined by
calculating the similarities between metadata within one language, which is similar to the
monolingual record linkage [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        In monolingual record linkage, the mismatches are mainly due to the typographical
variations of string data, which can be measured by string-based comparison.
Nevertheless, when it comes to cross-language record linkage, the mismatches of wordings
between literal translations and metadata in target language cannot be measured by
simple metrics. Figure 1 gives an example of this type of mismatch. The word “白雨”
in Japanese is translated into “rainfall” by a Japanese-English bilingual dictionary.
However, the corresponding word in English title is “storm”, which is translated by a
human expert translator. Such a mismatch is due to the use of different wordings to
express the same meaning, which cannot be measured by string-based similarity.
Some approaches exploit the network structure of records deeply in knowledge bases
to determine the identical records [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. However, in most databases, unlike Wikipedia
or WordNet, the network structure of records cannot be obtained easily.
      </p>
      <p>Japanese database
English database
作品名(Title):
作家(Artist):
山下白雨
葛飾北斎
Step1: Translating
mount, under, rainfall</p>
      <p>Step2: Matching</p>
      <p>Title: Storm below Mount Fuji
Artist: Katsushika Hokusai</p>
      <p>Storm below Mount Fuji</p>
      <p>
        In this paper, we propose a method for cross-language record linkage that can
measure the similarities between metadata with the same meaning but in different
wordings. Our method is based on distributed representations of words [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] (a.k.a.
word embedding), in which semantically similar words are closer in vector space. The
effectiveness of this approach is evaluated in the record linkage across Ukiyo-e
databases in Japanese and English.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Methodology</title>
      <p>As mentioned above, cross-language record linkage can be divided into two steps:
translating and matching. We focus on the second step, especially the matching
among non-proper nouns in metadata. The reason is that non-proper nouns are more
likely to be translated into different words than proper nouns. Proper nouns can
usually be transliterated, which have a one-to-one mapping.
2.1</p>
      <sec id="sec-2-1">
        <title>Learning Distributed Representations of Words</title>
        <p>
          Distributed representations for words are dense, low-dimensional and real-valued
vectors, which were firstly proposed by Rumelhart et al. [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. Recently, the distributed
skip-gram model for learning word representations was introduced by Mikolov et al.
[
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. This model employs simple neural network architecture, which can be trained on
a large amount of unstructured text data in a short time (billions of words in hours).
Besides, the distributed representations of words learnt by this model can capture
semantic similarity relationships. Considering the advantages above, we utilize the
skip-gram model of Mikolov et al. for learning word representations in our method.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Similarity Measurement between Metadata</title>
        <p>In the proposed method, the similarity metric between the literal translations of
metadata in source language (  ) and metadata in target language (  ) is defined in
Formula 1.  (  ),  (  ) are the number of non-proper nouns in   and  
respectively.   is a non-proper noun in   .  (  ) is the number of candidate
translations of   .   is the distributed representation of a candidate translation of
  . Similarly,   is the distributed representation of a non-proper noun in   .
 (  ) is the matching degree of   , which is the maximal value of similarity
between candidate translations of   and non-proper nouns in   .  (  ,   ) is
the cosine similarity between   and   .   means the number of matched proper
nouns.   and   are weights of proper nouns and non-proper nouns respectively. L
is the total number of words in   .</p>
        <p>S(  ,   ) = [   ∙   +   ∙ ∑ =1(  ) 
where</p>
        <p>(  ) = max [ ∑ =( 1  ) ∑ =1(  ) 
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Experiments</title>
      <p>(  ) ]⁄
(  ,   ) ]
(1)
In this section, we evaluate the effectiveness of our proposed method in linking the
same Ukiyo-e prints between the databases in Japanese and English.
3.1</p>
      <sec id="sec-3-1">
        <title>Experimental Setup</title>
        <p>The titles of Ukiyo-e prints are used to identify the same records. The experimental
data set consists of 243 Japanese titles of Ukiyo-e prints in the Edo-Tokyo Museum1
and 3,293 English titles in the Metropolitan Museum of Art2, in which each Japanese
title has at least one corresponding English title. Among the 243 Japanese titles, 143
titles are descriptive titles that contain at least one non-proper noun.</p>
        <p>
          Here we translate non-proper nouns of Japanese titles into English by using EDR
Japanese-English bilingual dictionary3. The proper nouns are transliterated by
Hepburn Romanization system4. Distributed representations of words are learnt from the
text data in English Wikipedia dump that contains more than 3 billion words. The
similarities between the literal translations of Japanese titles and English titles are
calculated by our proposed method (Formula 1). Besides, we use a baseline for
com1 http://digitalmuseum.rekibun.or.jp/app/selected/edo-tokyo
2 http://www.metmuseum.org/
3 http://www2.nict.go.jp/out-promotion/techtransfer/EDR/index.html
4 https://en.wikipedia.org/wiki/Hepburn_romanization
parison experiments. It is using string matching to measure the similarities among
words in titles [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], which is shown in Formula 2.   and   are the number of
matched proper nouns and non-proper nouns in literal translations of Japanese titles
respectively.   and   are their weights. L is the total number of words in a
Japanese title. We set   ,   equal to 2 and 1 respectively, which is the same as [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
Here, proper nouns are given a higher weight than non-proper nouns, because proper
nouns are representative features for calculating similarity in our proposed method.
        </p>
        <p>Similarity metric = (  ∙   +  
∙   )⁄
(2)
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Experimental Results</title>
        <p>The precision of descriptive titles
The precision of all titles</p>
        <p>Baseline
Our method
0.31</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>In this paper, we proposed a method that employs the distributed representations of
words to measure metadata similarities for cross-language record linkage.
Experimental results have shown that this approach improves the precision of
crosslanguage record linkage between Ukiyo-e databases in Japanese and English. In the
future, we plan to improve the similarity metric by measuring the degree of similarity
between word embedding.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Elmagarmid</surname>
            ,
            <given-names>A.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ipeirotis</surname>
            ,
            <given-names>P.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verykios</surname>
            ,
            <given-names>V.S.</given-names>
          </string-name>
          :
          <article-title>Duplicate Record Detection: A Survey</article-title>
          .
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          ,
          <volume>19</volume>
          (
          <issue>1</issue>
          ),
          <fpage>1</fpage>
          -
          <lpage>16</lpage>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Pilehvar</surname>
            ,
            <given-names>M.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Navigli</surname>
          </string-name>
          .R.:
          <article-title>A Robust Approach to Aligning Heterogeneous Lexical Resources</article-title>
          .
          <source>In ACL</source>
          ,
          <fpage>468</fpage>
          -
          <lpage>478</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Efficient Estimation of Word Representations in Vector Space</article-title>
          .
          <source>arXiv preprint arXiv:1301</source>
          .
          <fpage>3781</fpage>
          . (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Rumelhnrt</surname>
            ,
            <given-names>D.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hinton</surname>
            ,
            <given-names>G.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Williams</surname>
            ,
            <given-names>R.J.</given-names>
          </string-name>
          :
          <article-title>Learning Representations by BackPropagating Errors</article-title>
          .
          <source>Nature</source>
          .
          <volume>323</volume>
          ,
          <fpage>533</fpage>
          -
          <lpage>536</lpage>
          (
          <year>1986</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Kimura</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Batjargal</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kimura</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maeda</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Finding the Same Artworks from Multiple Databases in Different Languages</article-title>
          . In Conference Abstracts of Digital Humanities (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>