<!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>Reconciling Information in DBpedia through a Question Answering System</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Elena Cabrio</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alessio Palmero Aprosio</string-name>
          <email>aprosio@fbk.eu</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Serena Villata</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>EURECOM</institution>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Fondazione Bruno Kessler</institution>
          ,
          <addr-line>Trento</addr-line>
          ,
          <country country="IT">Italy -</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>INRIA Sophia Antipolis</institution>
          ,
          <country country="FR">France -</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Results obtained querying language-speci c DBpedia chapters SPARQL endpoints for the same query can be related by several heterogenous relations, or contain an inconsistent set of information about the same topic. To overcome this issue in question answering systems over language-speci c DBpedia chapters, we propose the RADAR framework for information reconciliation. Starting from a categorization of the possible relations among the resulting instances, such framework: (i) classi es such relations, (ii) reconciles the obtained information using argumentation theory, (iii) ranks the alternative results depending on the con dence of the source in case of inconsistencies, and (iv) explains the reasons underlying the proposed ranking.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>In the Web of Data, it is possible to retrieve heterogeneous information items
concerning a single real-world object coming from di erent data sources, e.g.,
the results of a single SPARQL query on di erent endpoints. These results may
con ict with each other, or they may be linked by some other relation like a
speci cation. The automated detection of the kind of relationship holding between
di erent instances about a single object with the goal of reconciling them is an
open problem for consuming in the Web of Data. In particular, this problem
arises while querying the language-speci c chapters of DBpedia, that may
contain di erent information with respect to the English version. This issue becomes
therefore particularly relevant in Question Answering (QA) systems exploiting
DBpedia language-speci c chapters as referential data set, since the user expects
a unique (and possibly correct) answer to her factual natural language question.</p>
      <p>
        In this demo, we propose the RADAR (ReconciliAtion of Dbpedia through
ARgumentation) framework that: i) adopts a classi cation method to return
the relation holding between two information items; ii) applies abstract
argumentation theory [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] for reasoning about con icting information and assessing
the acceptability degree of the information items, depending on the kind of
relation linking them; and iii) returns the graph of the results set, together with the
acceptability degree of each information item, to motivate the resulting
information ranking. We have integrated RADAR into the QA system QAKiS [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], that
queries language-speci c DBpedia chapters using a natural language interface.
      </p>
      <p>
        RADAR: a Framework for Information Reconciliation
The RADAR framework (Fig. 1) takes as input a collection of results from
the same SPARQL query raised against the language-speci c DBpedia chapters
SPARQL endpoints, and retrieves: (i) the sources proposing each particular
element of the results set, and (ii) the elements of the results set themselves. The
rst module of RADAR (Source con dence assignment score, Fig. 1) takes each
information source, and following two di erent heuristics, i.e., Wikipedia page
length (the chapter of the longest language-speci c Wikipedia page describing
the queried entity is rewarded w.r.t. the others) and entity geo-localization (the
chapter of the language spoken in the places linked to the page of the entity is
rewarded with respect to the others), assigns a con dence degree to the source.
Such metrics are summed, and normalized (0 score 1), where 0 is the less
reliable chapter for a certain entity and 1 is the most reliable one. Such
condence degree will a ect the reconciliation if inconsistencies arise: information
proposed by the more reliable source will obtain a higher acceptability degree.
The second module
(Relation classi cation module,
Fig. 1) starts from the
results set, and it matches
every element with all the
other returned elements,
detecting the kind of
relation holding between
this pair of elements,
following the categorization
of [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Such categories
correspond to the
linguistic phenomena (mainly
discourse and lexical se- Fig. 1: RADAR framework architecture.
mantics relations)
holding among heterogeneous
values obtained querying two DBpedia language-speci c chapters, given a certain
subject and a certain ontological property. RADAR clusters the relations of
identity, disambiguated entity and coreference into a unique category, called surface
variants of the entity, and automatically detects such relation among two
entities applying one of the following strategies: cross-lingual links (using WikiData),
text identity (i.e., string matching), Wikipedia redirection and disambiguation
pages. Moreover, RADAR integrates into a unique category geo-speci cation
and renaming, and classi es a relation of this category when in GeoNames one
entity results as contained in the other one. We also consider the alternative
names gazette included in GeoNames, and geographical information extracted
from English Wikipedia infoboxes, such as Infobox former country. Finally,
RADAR clusters meronymy, hyponymy, metonymy and identity:stage name into
a unique category, called inclusion, and detects it exploiting a set of features
extracted from heterogeneous resources: MusicBrainz, NCF Thesaurus,
DBpedia, WikiData and Wikipedia hierarchical information. Concerning inconsistent
data in DBpedia language-speci c chapters, RADAR labels a relation between
entities/objects as negative, if every attempt to nd one of the positive relations
described above fails. The output consists in a graph composed by the elements
of the results set connected with each other by the identi ed relations. Both the
sources associated with a con dence score and the results set under the form of
a graph are then provided to the third module of RADAR, the Argumentation
module (Fig. 1). Its aim is to reconcile the results set: it considers all positive
relations as a support relation and all negative relations as an attack relation,
building a bipolar argumentation graph where each element of the results set
is seen as an argument. Finally, adopting a bipolar fuzzy labeling algorithm [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]
relying on the source's con dence to decide the acceptability of the information,
the module returns the acceptability degree of each argument, i.e., element of the
results set. RADAR provides as output: i) the acceptable elements (a threshold
is adopted), and ii) the graph of the results set, i.e., the explanation about the
choice of the acceptable elements returned.
      </p>
      <p>
        Integrating RADAR into QAKiS. QAKiS addresses the task of QA over
structured knowledge-bases (e.g., DBpedia) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], where the relevant information
is expressed also in unstructured forms (e.g., Wikipedia pages). It implements
a relation-based match for question interpretation, to convert the user
question into a query language (e.g., SPARQL), making use of relational patterns
(automatically extracted from Wikipedia and collected in the WikiFramework
repository) that capture di erent ways to express a certain relation in a given
language. In QAKiS, the SPARQL query created after the question
interpretation phase is sent to a set of language-speci c DBpedia chapters SPARQL
endpoints for answer retrieval. The set of retrieved answers from each endpoint
is then sent to RADAR for answers reconciliation1. The user can select the
DBpedia chapter she wants to query besides English (that must be selected as it
is needed for Named Entity (NE) recognition), i.e., French or German. After
writing a question or selecting it among the proposed examples, the user has
to click on the tab RADAR where a graph with the answers provided by the
di erent endpoints and the relations among them is shown. Each node has an
associated con dence score, resulting from the fuzzy labeling algorithm.
Moreover, each node is related to the others by a relation of support or attack, and a
further speci cation of such relations according to the identi ed categories [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] is
provided to the user as justi cation of the performed reconciliation and ranking.
      </p>
      <p>
        To evaluate RADAR integration into QAKiS, we extract from QALD-2 data
set2 the questions currently addressed by QAKiS (i.e., questions containing a
NE related to the answer through one single ontological property),
corresponding to 58 questions (26 in the training, 32 in the test set). The discarded
questions require either some forms of reasoning on data, aggregation from data sets
other than DBpedia, involve n-relations, or are boolean questions. We submit
1 A demo of RADAR integrated into QAKiS can be tested at http://qakis.org.
2 http://bit.ly/QALD2014
such questions to QAKiS on the English, German and French DBpedia
chapters. Since QALD-2 questions were created to query the English chapter only,
it turned out that only in 25/58 cases at least two endpoints provide an answer
(in all the other cases the answer is provided by the English chapter only, not
useful for our purposes). For instance, given the question Who developed Skype?
the English DBpedia provides Skype Limited as the answer, while the French
one returns Microsoft. We evaluate the ability of RADAR to correctly classify
the relations among the answers provided to the same query by the di erent
language-speci c endpoints, w.r.t. a manually annotated goldstandard (built
according to [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]'s guidelines), carrying out two sets of experiments: i) we start from
the answers provided by the di erent DBpedia endpoints to the 25 QALD
questions, and we run RADAR on it; ii) we add QAKiS in the loop, meaning that the
data we use as input for the argumentation module are directly provided by the
system. We obtain the following results: RADAR achieves a
precision/recall/fmeasure of 1 in the classi cation of surface form and inclusion relations (overall
positive: p/r/f=1); QAKiS+RADAR obtains p=1, r=0.60 and f=0.75 on
surface form, p/r/f of 1 on inclusion (overall positive: p/r/f= 1/0.63/0.77). Since
QALD-2 data was created to query the English chapter only, this small data set
does not capture the variability of possibly inconsistent answers among DBpedia
language-speci c chapters. Only two categories of relations are present in this
data, i.e., surface forms, and inclusion, and for this reason RADAR has
outstanding performances when applied on the correct mapping between NL
questions and SPARQL queries. When QAKiS is added into the loop, its mistakes
in translating the NL question into the correct SPARQL query are propagated.
3
      </p>
    </sec>
    <sec id="sec-2">
      <title>Future Perspectives</title>
      <p>
        This demo improves the results of [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] as the categorization is more speci c thus
producing a more insightful explanation graph, and more performing techniques
are applied to extract the relations. As future work, we will address a user
evaluation to check whether QAKiS answer explanation suits data consumers'
needs, and we will explore the possibility to leave the data consumer herself to
assign the con dence degree to the sources depending on searched information.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Cabrio</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cojan</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gandon</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Mind the cultural gap: bridging language speci c dbpedia chapters for question answering</article-title>
          . In: Cimiano,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Buitelaar</surname>
          </string-name>
          , P. (eds.)
          <source>Towards the Multilingual Semantic Web</source>
          . Springer Verlag (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Cabrio</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cojan</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Villata</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gandon</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Argumentation-based inconsistencies detection for question-answering over dbpedia</article-title>
          .
          <source>In: NLP-DBPEDIA@ISWC</source>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Cabrio</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Villata</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gandon</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Classifying inconsistencies in dbpedia language speci c chapters</article-title>
          .
          <source>In: LREC-2014</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Dung</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games</article-title>
          .
          <source>Artif. Intell</source>
          .
          <volume>77</volume>
          (
          <issue>2</issue>
          ),
          <volume>321</volume>
          {
          <fpage>358</fpage>
          (
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>