<!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>Language Agnostic Dictionary Extraction</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alfredo Alba</string-name>
          <email>aalba@us.ibm.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anni Coden</string-name>
          <email>anni@us.ibm.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anna Lisa Gentile</string-name>
          <email>annalisa.gentile@ibm.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Daniel Gruhl</string-name>
          <email>dgruhl@us.ibm.com</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Petar Ristoski</string-name>
          <email>petar.ristoski@ibm.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Steve Welch</string-name>
          <email>welchs@us.ibm.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>IBM Research Almaden</institution>
          ,
          <addr-line>CA</addr-line>
          ,
          <country country="US">US</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>IBM Watson Research Lab, NY</institution>
          ,
          <country country="US">US</country>
        </aff>
      </contrib-group>
      <fpage>2</fpage>
      <lpage>5</lpage>
      <abstract>
        <p>Ontologies are dynamic artifacts that evolve both in structure and content. Keeping them up-to-date is a very expensive and critical operation for any application relying on semantic Web technologies. In this paper we focus on evolving the content of an ontology by extracting relevant instances of ontological concepts from text. The novelty of this work is that we propose a technique which is (i) completely language independent, (ii) combines statistical methods with human-in-the-loop and (iii) exploits Linked Data as bootstrapping source. Experiments on a publicly available parallel medical corpus show comparable performances regardless of the chosen language.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        In this paper we focus on a computer/human partnership to more rapidly evolve
the content of an ontology through extraction of new relevant concepts from
text. The atomic operation behind this population step is the discovery of all
instances that belong to each concept. A plethora of solutions have been proposed
to populate ontologies or extract domain dictionaries from both unstructured
text [
        <xref ref-type="bibr" rid="ref10 ref4 ref6 ref7">4,6,7,10</xref>
        ] and semi-structured content [
        <xref ref-type="bibr" rid="ref12 ref5">5,12</xref>
        ], but the majority of extraction
techniques are language dependent, i.e., they rely on Natural Language
Processing (NLP) operations and tools that are language speci c, such as parsing, part
of speech tagging, etc. We propose glimpseLD a novel solution that builds upon
our previous work [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and revolves around three main aspects: (i) it is a
statistical method which extracts dictionary items based on context patterns; (ii)
it relies on human feedback to automatically tune scores and thresholds for the
extraction patterns; (iii) uses Linked Data (when available, even in small
quantities) to bootstrap the process. We demonstrate that our approach (i) has similar
performances in all languages and that (ii) exploiting Linked Data to bootstrap
the method maintains the same comparable performances in all languages, while
reducing the number of required human-in-the-loop iterations by at least half.
There is a vast amount of literature devoted to ontology population from text,
with a number of established initiatives to foster research on the topic, such
as the Knowledge Base Population task at TAC,3 the TREC Knowledge Base
Acceleration track,4 and the Open Knowledge Extraction (OKE) Challenge,5 to
name a few. In these initiatives, systems are compared on the basis of
recognizing individuals belonging to a few selected ontology classes, spanning from
the common Person, Place and Organization,6 to more speci c classes such as
Facility, Weapon, Vehicle7 or Drug,8 among others. The evaluation focus is
usually on the speci c sub-tasks involved in the process, such as Entity Recognition,
Linking and Typing. Several solutions have been proposed in the literature,
spanning from general purpose comprehensive approaches [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] to more domain-speci c
ones [
        <xref ref-type="bibr" rid="ref10 ref6 ref7">6,7,10</xref>
        ]. The majority of available methods operate (and are assessed) for
the English language and although speci c initiatives are aimed at encouraging
replicable studies in other languages,9 we argue that truly language-independent
methods for this task are not yet widespread and often limited to portability
from one language to another [
        <xref ref-type="bibr" rid="ref1 ref11 ref9">11,9,1</xref>
        ]. These methods often exploit linguistic
features, which extraction relies on NLP tools - and thus does out-of-the-box
portability to di erent languages is not guaranteed. We propose a
human-inthe-loop approach where the human works in partnership with the statistical
method to drive the semantic of the task e ectively and e caciously. Moreover
we use Linked Data to bootstrap the process. While its usage has been vastly
explored for many Information Extraction tasks and speci cally for dictionary
extraction [
        <xref ref-type="bibr" rid="ref3 ref5 ref8">3,8,5</xref>
        ], the applicability of the models to multiple languages has not
been extensively explored.
3
      </p>
      <p>
        Extracting Dictionaries with glimpse and glimpseLD
Glimpse is a statistical algorithm for dictionary extraction based on SPOT [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
The input is a large text corpus whose content is relevant to the domain of the
dictionary to be extracted. Besides the corpus, glimpse needs one or more
examples (seeds) of the dictionary items to extract. Starting from these it evaluates
the contexts (the set of words surrounding an item) in which the seeds occur
and identi es \good" contexts to identify further terms or phrases in the
corpus, presented to a human to be accepted/rejected (full details of the method
can be found in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]). In this work we synthetically evaluate that glimpse is
language independent and we prove that using Linked Data to seed the method
(glimpseLD ) can signi cantly improve the performance, allowing it to extract a
higher number of terms in fewer human iterations.
      </p>
      <p>
        As dataset we use EM EA10 (European Medicines Agency documents), a
parallel corpus comprised of PDF documents from the European Medicines Agency,
3 http://www.nist.gov/tac/2015/KBP
4 http://trec-kba.org/
5 https://2016.eswc-conferences.org/eswc-16-open-knowledge-extraction-oke-challenge
6 http://www.cnts.ua.ac.be/conll2003/ner/
7 https://www.ldc.upenn.edu/collaborations/past-projects/ace
8 In Semeval-2013, task 9 https://www.cs.york.ac.uk/semeval-2013/task9/.
9 Named Entity Recognition and Linking in Italian Tweets: http://www.evalita.it/2016/tasks/
neel-it
10 http://opus.lingfil.uu.se/EMEA.php
related to medical products and their translations into 22 o cial languages of the
European Union. The documents have been sentence aligned within the OPUS
project [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. We select the English, Spanish, Italian and German portion of the
dataset and we use it for the task of constructing a dictionary of drugs in the
various languages.
      </p>
      <p>From the EM EA corpus - and using a standard drug dataset (RxNorm)
we select drugs that appear in all the corpora with the same name. Despite the
target terms being the same in all languages, their context is highly language
dependent. The selected drugs (363 in total) are consider as Gold Standard and
we start with one seed only in every language (speci cally we used the drug
irbesartan) to automatically build a drug dictionary in every target language.
The behavior of glimpse is homogeneous in every language, with similar discovery
growth at each iteration. With 20 iterations glimpse discovered more than 300
drugs in each language (out of the 363 of the GS, with average accuracy 11
&gt;85%). The average Pearson correlation amongst the results in all languages is
&gt; 0.99. The discovery growth - the ratio of new correct terms added - is a useful
indication of performance in a real scenario, where no gold standard is available,
but correctness of extraction is assured by human-in-the-loop.</p>
      <p>We repeat the experiment with glimpseLD. We build a truly multi-language
GS crawling instances of drugs from Linked Data, making sure to cover the same
drugs in all languages. Particularly, we use two of the biggest cross-domain LOD
datasets, DBpedia12 and Wikidata.13 We select all the entities of type dbo:Drug 14
from DBpedia and all the entities of type wikidata:Q11173 from Wikidata. For all
of the selected entities, we retrieve the corresponding labels in English, German,
Spanish and Italian and consider this our gold standard dictionary. We then
select 20% as seeds and measure the performance of recreating the remaining
80% by using glimpseLD. We perform 5-fold cross validation without repetition
and randomly select the 20% of seeds at each iteration (making sure that the
seeds represent the same drugs for all 4 languages), to test if the choice of initial
seeds impacts the results. Fig. 1b and 1c show that the discovery growth is
comparable for all languages, with correlation always above 0.98.
4</p>
    </sec>
    <sec id="sec-2">
      <title>Conclusions and future work</title>
      <p>This paper proposes a language-independent solution to discover new instances
for populating ontology concepts. Our algorithm is iterative and purely
statistical, hence does not require any feature extraction which can be di cult and
expensive in di erent languages and texts. It leverages Linked Data to seed the
process, and integrates human feedback to improve the accuracy and the
control concept drift at every iteration cycle. We show extremely similar discovery
growth extracting drug names on four languages over parallel corpora of medical
text.
11 Note that as irrelevant terms are manually rejected in a human-in-the-loop approach it does not
make sense to calculate Precision, as retained terms are all correct by design.
12 http://.dbpedia.org
13 https://www.wikidata.org/
14 dbo: http://dbpedia.org/ontology/, wikidata: http://www.wikidata.org/entity/</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>A.</given-names>
            <surname>Ben Abacha</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. F. M. Chowdhury</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Karanasiou</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Mrabet</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Lavelli</surname>
            , and
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Zweigenbaum</surname>
          </string-name>
          .
          <article-title>Text mining for pharmacovigilance: Using machine learning for drug name recognition and drug-drug interaction extraction and classi cation</article-title>
          .
          <source>Journal of Biomedical Informatics</source>
          ,
          <volume>58</volume>
          :
          <fpage>122</fpage>
          {
          <fpage>132</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>A.</given-names>
            <surname>Coden</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Gruhl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Tanenblatt</surname>
          </string-name>
          , and
          <string-name>
            <surname>J. Terdiman. SPOT</surname>
          </string-name>
          <article-title>the drug! An unsupervised pattern matching method to extract drug names from very large clinical corpora</article-title>
          .
          <source>HISB</source>
          <year>2012</year>
          , pages
          <fpage>33</fpage>
          {
          <fpage>39</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>J.</given-names>
            <surname>Dolby</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fokoue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kalyanpur</surname>
          </string-name>
          , E. Schonberg, and
          <string-name>
            <given-names>K.</given-names>
            <surname>Srinivas</surname>
          </string-name>
          .
          <article-title>Extracting enterprise vocabularies using linked open data</article-title>
          .
          <source>ISWC</source>
          <year>2009</year>
          , pages
          <fpage>779</fpage>
          {
          <fpage>794</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>A.</given-names>
            <surname>Gangemi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Presutti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. Reforgiato</given-names>
            <surname>Recupero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. G.</given-names>
            <surname>Nuzzolese</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Draicchio</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Mongiov</surname>
          </string-name>
          .
          <article-title>Semantic web machine reading with fred</article-title>
          .
          <source>Semantic Web</source>
          , (Preprint):
          <volume>1</volume>
          {
          <fpage>21</fpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>A. L.</given-names>
            <surname>Gentile</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , I. Augenstein, and
          <string-name>
            <given-names>F.</given-names>
            <surname>Ciravegna</surname>
          </string-name>
          .
          <article-title>Unsupervised wrapper induction using linked data</article-title>
          .
          <source>In K-CAP'13</source>
          , pages
          <fpage>41</fpage>
          {
          <fpage>48</fpage>
          . ACM,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Qadir</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Hasan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Datla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Prakash</surname>
          </string-name>
          , J. Liu, and
          <string-name>
            <given-names>O.</given-names>
            <surname>Farri</surname>
          </string-name>
          .
          <article-title>Adverse drug event detection in tweets with semi-supervised convolutional neural networks</article-title>
          .
          <source>In WWW'17</source>
          , pages
          <fpage>705</fpage>
          {
          <fpage>714</fpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>S.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Chen</surname>
          </string-name>
          , and
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <article-title>E ects of semantic features on machine learning-based drug name recognition systems: Word embeddings vs. Manually constructed dictionaries</article-title>
          .
          <source>Information (Switzerland)</source>
          ,
          <volume>6</volume>
          (
          <issue>4</issue>
          ):
          <volume>848</volume>
          {
          <fpage>865</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>P.</given-names>
            <surname>Mitzias</surname>
          </string-name>
          , M. Riga, E. Kontopoulos,
          <string-name>
            <given-names>T. G.</given-names>
            <surname>Stavropoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Andreadis</surname>
          </string-name>
          , G. Meditskos,
          <string-name>
            <surname>and I. Kompatsiaris.</surname>
          </string-name>
          <article-title>User-driven ontology population from linked data sources</article-title>
          .
          <source>In KESW 2016</source>
          , pages
          <fpage>31</fpage>
          {
          <fpage>41</fpage>
          . Springer,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>A.</given-names>
            <surname>Pappu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Blanco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Mehdad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Stent</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Thadani</surname>
          </string-name>
          .
          <article-title>Lightweight multilingual entity extraction and linking</article-title>
          .
          <source>In WSDM '17</source>
          , pages
          <fpage>365</fpage>
          {
          <fpage>374</fpage>
          . ACM,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. N. Prollochs, S. Feuerriegel, and
          <string-name>
            <given-names>D.</given-names>
            <surname>Neumann</surname>
          </string-name>
          .
          <article-title>Generating Domain-Speci c Dictionaries using Bayesian Learning</article-title>
          . Ecis, (
          <year>2015</year>
          ):
          <volume>0</volume>
          {
          <fpage>14</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>M.</given-names>
            <surname>Sahlgren</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Karlgren</surname>
          </string-name>
          .
          <article-title>Automatic bilingual lexicon acquisition using random indexing of parallel corpora</article-title>
          .
          <source>Nat. Lang</source>
          . Eng.,
          <volume>11</volume>
          (
          <issue>3</issue>
          ):
          <volume>327</volume>
          {
          <fpage>341</fpage>
          ,
          <string-name>
            <surname>Sept</surname>
          </string-name>
          .
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12. H.
          <article-title>-</article-title>
          <string-name>
            <surname>J. Song</surname>
            ,
            <given-names>S.-B.</given-names>
          </string-name>
          <string-name>
            <surname>Park</surname>
            , and
            <given-names>S.-Y.</given-names>
          </string-name>
          <string-name>
            <surname>Park</surname>
          </string-name>
          .
          <article-title>An automatic ontology population with a machine learning technique from semi-structured documents</article-title>
          .
          <source>In ICIA'09</source>
          , pages
          <fpage>534</fpage>
          {
          <fpage>539</fpage>
          . IEEE,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>J.</given-names>
            <surname>Tiedemann</surname>
          </string-name>
          .
          <article-title>News from OPUS-A collection of multilingual parallel corpora with tools and interfaces</article-title>
          .
          <source>RANLP</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>