<!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 semantic matching for discovering links to e-gov services in the LOD cloud</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Fedelucio Narducci</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Matteo Palmonari</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giovanni Semeraro</string-name>
          <email>giovanni.semeraro@uniba.it</email>
          <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</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Information Science</institution>
          ,
          <addr-line>Systems Theory</addr-line>
          ,
          <institution>and Communication University of Milano-Bicocca</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The large di usion of e-gov initiatives is increasing the attention of public administrations towards the Open Data initiative. The adoption of open data in the e-gov domain produces di erent advantages in terms of more transparent government, development of better public services, economic growth and social value. However, the process of data opening should adopt standards and open formats. Only in this way it is possible to share experiences with other service providers, to exploit best practices from other cities or countries, and to be easily connected to the Linked Open Data (LOD) cloud. In this paper we present CroSeR (Cross-language Service Retriever), a tool able to match and retrieve cross-language e-gov services stored in the LOD cloud. The main goal of this work is to help public administrations to connect their e-gov services to services, provided by other administrations, already connected to the LOD cloud. We adopted a Wikipedia-based semantic representation in order to overcome the problems related to match really short textual descriptions associated to the services. A preliminary evaluation on an open catalog of e-gov services showed that the adopted techniques are promising and are more e ective than techniques based only on keyword representation.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The main motivation behind the success of the Linked Open Data (LOD)
initiative is related to well-known advantages coming from the interconnection of
information sources, such as improved discoverability, reusability, and utility of
information [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. In the last years, many governments decided to make public
their data about spending, service provision, economic indicators, and so on.
These datasets are also known as Open Government Data (OGD). As of
February 2013, more than 1,000,000 OGD datasets have been put online by national
and local governments from more than 40 countries in 24 di erent languages3.
      </p>
    </sec>
    <sec id="sec-2">
      <title>3 http://logd.tw.rpi.edu/iogds data analytics</title>
      <p>
        As the interest of governments in LOD has grown over the last years, a roadmap
consisting of three data-processing stages, namely the open stage, the link stage,
and the reuse stage, has been proposed to drive the transition from OGD to
Linked Open Government Data (LOGD) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>The SmartCities project4 is worth of mentioning in this context. The general
aim of that project is to create an innovation network between governments and
academic partners leading to excellence in the domain of the development and
uptake of e-services, setting a new baseline for e-service delivery in the whole
North Sea region. The project involves seven countries of the North Sea region:
England, Netherlands, Belgium, Germany, Scotland, Sweden, and Norway. One
of the main interesting results of this project is the European Local Government
Service List (LGSL) as part of the Electronic Service Delivery (ESD)-toolkit
website5. The goal of the LGSL is to build standard lists (i.e, ESD-standards)
which de ne the semantics of public sector services. Each country involved into
the project is responsible to build and maintain its list of public services delivered
to the citizens, and all of those services are interlinked to the services delivered
by other countries. The ESD-standards are already linked to the LOD cloud6.</p>
      <p>
        LGSL is a great opportunity for local and national governments all over
Europe. Linking national or local service catalogs to LGSL allows to make local or
national services searchable in several languages, improving also the capability
of EU citizens to access services in a foreign language country, an explicit
objective of the Digital Agenda for Europe (DAE) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Moreover, local and national
governments can learn best practices of service o erings across Europe and
compare their service to make their service o ering more valuable [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Finally, by
linking e-service catalogs to LGSL additional information can be exploited, e.g.,
services in the LGSL are linked to a taxonomy of life events, which is useful to
enrich the service catalogs and support navigation. However, manually linking
e-service catalogs, often consisting of several hundreds - or thousands - of
services, to LGLS requires a lot of e ort, which often prevents administrations from
taking advantage of becoming part of the LOD cloud.
      </p>
      <p>
        Automatic cross-language ontology matching methods can support local and
national administrations in linking their service catalogs to LGSL, and therefore
to the LOD cloud, by reducing the cost of this activity. Although some
crosslanguage ontology matching methods have been proposed [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], the application of
these methods to the problem of linking local and national service catalogs has to
deal with the poor quality of the descriptions available in the catalogs. Services
are represented by minimal descriptions that often consist of the name of the
service and very few other data. Furthermore, as showed in Figure 1, the labels
associated with services linked in the LGSL are not a mere translation from a
language to another. As an example, the German service (literally translated
as) Acquisition of children daycare contributions and the Dutch service (literally
translated as) Grant Babysitting/Child Services have been manually linked to
      </p>
    </sec>
    <sec id="sec-3">
      <title>4 http://www.smartcities.info/aim</title>
    </sec>
    <sec id="sec-4">
      <title>5 http://www.esd.org.uk/esdtoolkit/</title>
    </sec>
    <sec id="sec-5">
      <title>6 http://lod-cloud.net/</title>
      <p>the English service Nursery education grant by domain experts. Therefore, the
automatic matching of the service text labels is not a trivial task.</p>
      <p>In this paper we propose Cross-language Service Retriever (CroSeR), a tool
to support the linkage of a source e-service catalog represented in any language
to a target catalog represented in English, where both the source and target
catalogs are characterized by minimal descriptions. Ultimately, the aim of CroSeR
is to support human annotators in order to simplify the selection of possibly
matching services. Our tool exploits a cross-language ontology matching
technique that uses an o -the-shelve machine translation tool and annotates the
translated descriptions with Wikipedia concepts in order to extrapolate
semantic representations of the services; candidate links are retrieved by evaluating
the similarity between the extracted semantic representations. Our method is
independent from the language adopted in the source catalog and does not
assume the availability of further information about the services other than very
short text descriptions used as names for the services.</p>
      <p>
        We conduct an experiment using the English, German and Dutch catalogs
from the LGSL dataset. In the experiment we compare several con gurations
of our system that leverage di erent semantic annotation tools and the Explicit
Semantic Analysis (ESA) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] method. Our preliminary results show that the
method based on ESA outperforms both the methods based on other annotation
tools and a baseline where no semantic representation is used.
      </p>
      <p>The rest of this paper is organized as follows. Section 2 analyzes the state of
the art. Section 3 describes the general architecture of our system, and Section
4 shows the tools exploited for obtaining a Wikipedia-based representation of
e-gov services. Finally, experimental results are presented in Section 5 and in
Section 6 the conclusion and the future work are summarized.</p>
      <sec id="sec-5-1">
        <title>Related Work</title>
        <p>
          Ontology matching, link discovery, and entity linking are tightly related research
areas. In all of these areas, automatic or semi-automatic matching techniques
are applied to discover correspondences among semantically related entities that
appear in a source and a target information source [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. Di erent types of
correspondences have been addressed (e.g., equivalence, subclass, same as, and so
on), depending on the types of considered entities (e.g., ontology concepts,
ontology instances, generic RDF resources) and information sources (web
ontologies, linked datasets, semi-structured knowledge bases). Cross-language ontology
matching is the problem of matching a source ontology that uses terms from a
natural language L with a target ontology that uses terms from another
natural language L0 (e.g., L is German and L0 is English) [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]; multi-lingual
ontology matching is the problem of matching two ontologies that use more than
one language each, where the languages used in each ontology can also
overlap [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. These de nitions can be easily extended to semantic matching tasks
over other types of information sources (e.g., cross-language and multi-lingual
matching of two document corpuses). In the following we discuss the most
relevant approaches to cross-language matching proposed over di erent information
sources.
        </p>
        <p>
          The most adopted approach for cross-language ontology matching is based on
transforming a cross-lingual matching problem into a monolingual one by
leveraging automatic machine translation tools [
          <xref ref-type="bibr" rid="ref17 ref19 ref6">17, 6, 19</xref>
          ]. However, the accuracy of
automatic machine translation tools is limited and several strategies have been
proposed to improve the quality of the nal matchings. One of the most recent
approaches uses a Support Vector Machine (SVM) to learn a matching function
for ontologies represented in di erent languages [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. This method uses features
de ned by combining string-based and structural similarity metrics. A
translation process powered by Microsoft Bing7 is used to build the feature vectors in a
unique reference language (English). A rst di erence with respect to our work
is that the proposed approach is deeply based on structural information derived
from the ontology; this information is very poor in our scenario and is not used
in our method. Also other translation-based approaches use structural
information, i.e., neighboring concepts [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] and instances [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ], which is not available in
our scenario.
        </p>
        <p>
          Two ontology matching methods have been recently proposed, which use
the concepts' names, labels, and comments to build search keywords and query
web data. A rst approach queries a web search engine and uses the results
to compute the similarity between the ontology concepts [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. The system
supports also cross-language alignment leveraging the Bing API to translate the
keywords. A second approach submit queries to the Wikipedia search engine [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
The similarity between a source and target concept is based on the similarity
of the Wikipedia articles retrieved for the concepts. Cross-language matching is
supported by using the links between the articles written in di erent languages,
7 http://www.bing.com/translator
which are available in Wikipedia, and by comparing the articles in a common
language. The authors observe that their approach has problems when it tries to
match equivalent ontology elements that use a di erent vocabulary and lead to
very di erent translations (e.g., Autor von(de) and has written(en)). Despite we
do also leverage Wikipedia, our matching process uses semantic annotation tools
and ESA. We can therefore incorporate light-weight disambiguation techniques
(provided by the semantic annotation tools) and match entities that, when
translated, are represented with signi cantly di erent terms (in particular when the
system use the ESA model).
        </p>
        <p>
          Another interesting work presented in literature applies the Explicit
Semantic Analysis (ESA) for cross-language link discovery [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. The goal of that paper
is to investigate how to automatically generate cross-language links between
resources in large document collections. The authors show that the semantic
similarity based on ESA is able to produce results comparable to those achieved by
graph-based methods. However, in this speci c domain, algorithms can leverage
a signi cant amount of text that is not available in our case.
        </p>
        <p>
          Finally, the impact of the translation quality on the quality matching in
cross-lingual scenarios is investigated in [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. From that research it emerges that
good translation quality is a prerequisite for achieving good quality cross-lingual
matches. However, this is likely true only compared to accuracy of monolingual
matching [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ].
3
        </p>
      </sec>
      <sec id="sec-5-2">
        <title>CroSeR: Cross-language Service Retriever</title>
        <p>
          We assume that each service is labeled by a short textual description (called
service label in the following), e.g., see examples in Figure 1, and represents
an abstract service, i.e., a high-level description of concrete services o ered by
one or more providers8 [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. The intuitive semantics of a link between a source
8 http://www.smartcities.info/ les/Smart Cities Brief What is a service list.pdf
and a target service description is that the two descriptions refer to the same
abstract service. Although service descriptions conceptually represent categories
of concrete services, which are o ered by actual providers, these descriptions are
represented as ontology instances and, consistently with the ESD approach, we
represent the links with owl:sameAs relations. In order to discover links between
a source list of services described in an arbitrary language L, and a target list
of services described in English (LGSL), we design a matching algorithm for
retrieving the top-k services that are best candidate to be linked to a given
source service. We implemented the matching algorithm in a system called
CrossLanguage Service Retriever (CroSeR).
        </p>
        <p>Given a source service described in an arbitrary language L, and a target list
of services described in English (LGSL), the CroSeR system returns a ranked
list of k services in LGSL that are candidate to be owl:sameAs -related to the
source service. The user will use the service list returned by CroSeR to validate
the link between the source and the target service.</p>
        <p>The architecture of CroSeR is depicted in Figure 2. The CroSeR system
consists of two components: the Content Analyzer analyzes the service descriptions
in the source and target lists and builds a semantic annotation for each
service; the Retriever discovers the links between the source and target services by
computing the similarity between the semantic annotations.</p>
        <p>Content Analyzer. The input to the Content Analyzer are the service
catalogs in di erent languages to be linked to the LGSL. The rst step performed
by this component is to translate the service labels in English by leveraging the
Bing API9. Next, the translated labels are exploited for obtaining the
Wikipediabased annotation of the services. For each service s, a set of Wikipedia concepts
Ws semantically related to the service label is generated; we call Wikipedia-based
annotation of s the set Ws. The set Ws is built by processing the short text in
the label of the service with semantic annotation techniques. The Wikipedia
concepts are generated for all the services (English ones, as well), since we need
to adopt an uni ed representation.</p>
        <p>The Wikipedia-based annotation aim to capture the main topics (represented
by the corresponding Wikipedia concepts) related to a service. In this context,
a Wikipedia concept is de ned as the title of a Wikipedia article. This
solution is also able to perform a sort of word sense disambiguation of a natural
language text without the application of elaborate algorithms based on lexical
ontologies such as Wordnet10. Furthermore, the annotation of a service with a
set of Wikipedia concepts represents an additional link between the service and
the LOD cloud (by using DBpedia as input).</p>
        <p>Retriever. The Retriever adopts the Vector Space Model (VSM) for
representing services in a multidimensional space where each dimension is a Wikipedia
concept. Therefore, each service is represented as a point in that space. In this
rst implementation we weighing each concept in Ws by adopting the simplest
schema represented by the number of occurrences of the concept in Ws.
For</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>9 http://www.microsoft.com/en-us/translator/ 10 http://wordnet.princeton.edu/</title>
      <p>
        mally, each service is represented as a vector s =&lt; w1; : : : ; wn &gt; where wk is
the occurrence of the the Wikipedia concept k in Ws. We guess that more
sophisticated weighing measures such as TF-IDF and BM25 [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] do not improve
the performance of our system at this step.
      </p>
      <p>Finally, the similarity between two services (vectors) is computed in terms
of cosine similarity. Therefore, given a service in one of the supported languages
(the query), the retriever is able to return a ranked list of the most similar
English services from the LGSL.</p>
      <p>Please, note that we adopt a variety of techniques (described in details in
Section 4) for annotating the services, each of which represents a di erent CroSeR
con guration. In addition to those Wikipedia-based con gurations, we evaluated
our system also by setting hybrid con gurations obtained by merging the
keywords extracted from the label associated to s with the corresponding Wikipedia
concepts in Ws. In that case, all the above-mentioned de nitions are still valid,
with the slight di erence that the vector space is built both on keywords and
Wikipedia concepts (instead of Wikipedia concepts alone).
4</p>
      <sec id="sec-6-1">
        <title>Semantic annotation of e-gov services</title>
        <p>We exploited di erent techniques for semantically annotate service labels with
a set of Wikipedia concepts. In particular, we adopted three well-known on-line
services that perform semantic annotation, namely Wikipedia Miner, Tagme,
DBpedia Spotlight, and we implemented a semantic feature generation tool based
on the Explicit Semantic Analysis (ESA) technique. The on-line services take
as input a text description (the service label), and return a set of Wikipedia
concepts that emerge from the input text. Also ESA generates a set of Wikipedia
concepts as output, but the insight behind it is quite di erent. All those services
allow to con gure some parameters in order to favor recall or precision. Given
the conciseness of the input text in our domain, we set those parameters for
improving the recall instead of precision.</p>
        <p>
          Wikipedia Miner. Wikipedia Miner is a tool for automatically
cross-referencing documents with Wikipedia [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. The software is trained on Wikipedia
articles, and thus learns to disambiguate and detect links in the same way as
Wikipedia editors [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. The rst step is the disambiguation of terms within the
text by means of a classi er. Several features are exploited for learning the
classi er. The two main features are commonness and relatedness [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. The
commonness of a Wikipedia article is de ned by the number of times it is used
as destination from some anchor text. For example, the anchor text tree has
a higher commonness value for the article Tree (plant) than the article Tree
(data structure). However, this feature is not su cient to disambiguate a term.
Therefore, the algorithm compares each possible sense (Wikipedia article) for a
given term with its surrounding context by computing the relatedness value. This
measure computes the similarity of two articles by comparing their incoming and
outgoing links.
        </p>
        <p>
          Tagme. Tagme is a system that performs an accurate and on-the- y
semantic annotation of short texts via Wikipedia as knowledge base [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. The
annotation process is composed of two main phases: the anchor disambiguation and
the anchor pruning. The disambiguation is based on a process called "collective
agreement". Given an anchor text a associated with a set of candidate Wikipedia
pages Pa, each other anchor in the text casts a vote for each candidate
annotation in Pa. As in Wikipedia Miner, the vote is based on the commonness and
the relatedness between the candidate page pi 2 Pa and the candidate pages
associated to the other anchors in the text. Subsequently, an anchor pruning is
performed by deleting the candidate pages in Pa considered to be not
meaningful. This process takes into account the probability of the anchor text to be
used as link in Wikipedia and the coherence between the candidate page and
the candidate pages of other anchors in the text.
        </p>
        <p>
          DBpedia Spotlight. DBpedia Spotlight [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] was designed with the explicit
goal of connecting unstructured text to the LOD cloud by using DBpedia as
hub. Also in this case the output is a set of Wikipedia articles related to a text
retrieved by following the URI of the DBpedia instances. The annotation process
works in four-stages. First, the text is analyzed in order to select the phrases that
may indicate a mention of a DBpedia resource. In this step any spots that are
only composed of verbs, adjectives, adverbs and prepositions are disregarded.
Subsequently, a set of candidate DBpedia resources is built by mapping the
spotted phrase to resources that are candidate disambiguations for that phrase.
As in the abovementioned tools, the disambiguation process uses the context
around the spotted phrase to decide for the best choice amongst the candidates.
Finally, there is a con guration step whose goal is to set the best parameter
values for the text to be disambiguated.
        </p>
        <p>
          Explicit Semantic Analysis. Explicit Semantic Analysis (ESA) is a
technique proposed by Gabrilovich and Markovitch [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], that uses Wikipedia as a
space of concepts explicitly de ned and described by humans. The idea is that
the meaning of a generic term (e.g. ball ) can be described by a list of concepts
it refers to (e.g. the Wikipedia articles: volleyball, soccer, football,...). Formally,
given the space of Wikipedia concepts C = fc1; c2; :::; cng, a term ti can be
represented by its semantic interpretation vector vi =&lt; wi1; wi2; :::; win &gt;, where
wij represents the strength of the association between ti and cj . Weights are
obtained from a matrix T , called esa-matrix, in which each of the n columns
corresponds to a concept, and each row corresponds to a term of the Wikipedia
vocabulary, i.e. the set of distinct terms in the corpus of all Wikipedia articles.
Cell T [i; j] contains wij , the tf-idf value of term ti in the article (concept) cj .
The semantic interpretation vector for a text fragment f (i.e. a sentence, a
document, a service label) is obtained by computing the centroid of the semantic
interpretation vectors associated with terms occurring in f .
        </p>
        <p>We can observe that while the intuition behind Wikipedia Miner, Tagme,
and DBpedia Spotlight is quite similar, ESA implements a di erent approach.
Indeed, the rst three tools identify Wikipedia concepts already present in the
text, conversely ESA generates new articles related to a given text by using
Wikipedia as knowledge base. As an example, let us suppose that we want to
annotate the service label Home Schooling. Wikipedia Miner, Tagme and
DBpedia Spotlight link it to the Wikipedia article Homeschooling, while ESA generates
(as centroid vector) the Wikipedia articles Home, School, Education, Family, ....
Hence, we can state that the three rst tools perform a sort of topic identi cation
of a given text, while ESA performs a feature generation process by adding new
knowledge to the input text. Another example enforces the motivation behind
the need of producing a sematic annotation of the service labels. Let's consider
the English service label Licences - entertainment and the corresponding Dutch
service in LGSL Vergunning voor Festiviteiten (translated as: Permit for
Festivities). A keyword-based approach never matches these two services. Conversely,
the Tagme annotation generates for the English Service the Wikipedia concepts
License, Entertainment, and for the translated Dutch label the concepts License,
Festival.
5</p>
      </sec>
      <sec id="sec-6-2">
        <title>Experimental Evaluation</title>
        <p>In this experiment we evaluated the di erent con gurations in terms of:
(1) e ectiveness in retrieving the correct service in a list of k service to be
presented to the user, (2) capability in boosting the correct service in the rst
positions of the ranked list.</p>
        <p>
          Design and Dataset. We adopted two di erent metrics: Accuracy@n (a@n)
and Mean Reciprocal Rank (MRR) [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. The a@n is calculated considering only
the rst n retrieved services. If the correct service occurs in the top-n items,
the service is marked as correctly retrieved. We considered di erent values of
n = 1; 3; 5; 10; 20; 30. The second metric (MRR) considers the rank of the correct
retrieved service and is de ned as follows:
        </p>
        <p>M RR =</p>
        <p>PN 1
i=1 ranki ;</p>
        <p>N
(1)
where ranki is the rank of the correctly retrieved servicei in the ranked list, and
N is the number of the services correctly retrieved. The higher is the position of
the services correctly retrieved in the list, the higher is the MRR value for a given
con guration. We decided to adopt this normalization instead of considering
N as the total number of the services in the catalogue in order to evaluate
the ranking of each con guration independently from its coverage. Hence, a
con guration with a good ranking, but a small coverage will obtain a higher
MRR value than a con guration with a better coverage, but a worse ranking.</p>
        <p>The dataset is extracted from the esd-toolkit catalogue freely available
online11. We indexed English, Dutch, and German services. The number of Dutch
services is 225, and the number German services is 190. For each service we
extracted and represented its textual label in terms of Wikipedia concepts by
exploiting the methods described in Section 4. The labels have an average length
of about three words.
11 http://standards.esd-toolkit.eu/EuOverview.aspx</p>
        <p>Results. The baseline of our experiment is the keyword-based con guration.
For that con guration, only stemming and stopword elimination are performed
on the text. We compared the baseline with the above-mentioned four di erent
Wikipedia-based con gurations (i.e., Wikipedia Miner, Tagme, DBpedia
Spotlight, ESA) as well as with a combination of keywords and Wikipedia con
gurations. The latter con gurations were obtained by adding to the keywords the
corresponding Wikipedia concepts generated by the di erent methods.</p>
        <p>Results for the Dutch language are reported in Table 1. We can observe that
the best con guration in terms of a@n is ESA. The con guration becomes more
e ective by returning several services (n &gt; 5), since the matching is particularly
di cult in this domain. The worst con guration is that based on Wikipedia
Miner. This is likely due to a low e ectiveness of Wikipedia Miner in identifying
topics from very short text. Most con gurations seem to improve their accuracy
by merging the Wikipedia concepts with keywords; however they do not generally
overcome the baseline. The only tool for which the keywords do not generally
improve the performance is ESA. However, by analyzing the MRR values we can
observe that ESA produces the worst ranking of the retrieved list of services.
Conversely, the method with the best ranking is Wikipedia Miner, but it has a
very small coverage (only 24 services). Hence, we can state that ESA is able to
identify the correct correspondence for the largest number of services ( 82%
of services) but under the condition to extend the list of retrieved service. Very
similar results are shown for the German services (see Table 2). Also in this
experiment ESA is the con guration with the best accuracy, while Wikipedia
Miner achieves the best ranking. These results are very promising since the
service labels in LGSL are written and matched by human experts and they are
not always mere translations of the English labels.
In this paper we proposed a tool called CroSeR that is able to perform a
crosslanguage matching of e-gov services. Four di erent semantic Wikipedia-based
representations were investigated. The most accurate representation turned out
to be ESA that, given a Dutch or German service, is able to retrieve the
corresponding English service for most of services. Hence, adding new external
knowledge for representing a very short textual description is an e ective
solution in this speci c domain. However, the correct service is generally not boosted
in the rst positions of the ranked list. Therefore, as a future work we want to
combine di erent representations to generate the ranked list. For example, we
can start by adopting the representation with the highest MRR value, and then
shifting to the representations with a worse ranking but a better accuracy. We
want also to extend the experiment to the other languages in the esd-toolkit
catalogue (Belgian, Norwegian, Swedish). Another idea is to exploit also the
other relations stored into the catalogue (life event, interactions) for improving
the service matching. Finally, we will carry out a user study where users can
directly formulate their information need instead of using the service label as
query.
7</p>
      </sec>
      <sec id="sec-6-3">
        <title>Acknowledgments</title>
        <p>The work presented in this paper has been partially supported by the Italian
PON project PON01 00861 SMART (Services and Meta-services for smART
eGovernment).</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>European</given-names>
            <surname>Commission</surname>
          </string-name>
          .
          <article-title>A digital agenda for europe</article-title>
          .
          <source>COM</source>
          (
          <year>2010</year>
          ) 245 nal/2,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>L.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Peristeras</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Hausenblas</surname>
          </string-name>
          .
          <article-title>Linked Open Government Data</article-title>
          .
          <source>IEEE Intelligent Systems</source>
          ,
          <volume>27</volume>
          (
          <issue>3</issue>
          ):
          <volume>11</volume>
          {
          <fpage>15</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Samuel</given-names>
            <surname>Fernando</surname>
          </string-name>
          , Mark Hall, Eneko Agirre, Aitor Soroa, Paul Clough, and
          <string-name>
            <given-names>Mark</given-names>
            <surname>Stevenson</surname>
          </string-name>
          .
          <article-title>Comparing taxonomies for organising collections of documents</article-title>
          .
          <source>In Proceedings of COLING '12</source>
          , pages
          <fpage>879</fpage>
          {
          <fpage>894</fpage>
          .
          <string-name>
            <surname>The</surname>
            <given-names>COLING</given-names>
          </string-name>
          2012
          <string-name>
            <given-names>Organizing</given-names>
            <surname>Committee</surname>
          </string-name>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>P.</given-names>
            <surname>Ferragina</surname>
          </string-name>
          and
          <string-name>
            <given-names>U.</given-names>
            <surname>Scaiella</surname>
          </string-name>
          . Tagme:
          <article-title>on-the- y annotation of short text fragments (by Wikipedia entities)</article-title>
          .
          <source>In Proceedings of CIKM '10</source>
          , pages
          <fpage>1625</fpage>
          {
          <fpage>1628</fpage>
          . ACM,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>B.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Brennan</surname>
          </string-name>
          , and
          <string-name>
            <surname>D.</surname>
          </string-name>
          <article-title>O'Sullivan. Cross-lingual ontology mapping | an investigation of the impact of machine translation</article-title>
          .
          <source>In Proceedings of ASWC '09</source>
          , pages
          <fpage>1</fpage>
          <lpage>{</lpage>
          15. Springer-Verlag,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>B.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Brennan</surname>
          </string-name>
          , and
          <string-name>
            <surname>D. O'Sullivan</surname>
          </string-name>
          .
          <article-title>Using pseudo feedback to improve crosslingual ontology mapping</article-title>
          .
          <source>In Proceedings of ESWC '11</source>
          , pages
          <fpage>336</fpage>
          {
          <fpage>351</fpage>
          .
          <string-name>
            <surname>SpringerVerlag</surname>
          </string-name>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>E.</given-names>
            <surname>Gabrilovich</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Markovitch</surname>
          </string-name>
          .
          <article-title>Wikipedia-based semantic interpretation for natural language processing</article-title>
          .
          <source>Journal of Arti cial Intelligence Research (JAIR)</source>
          ,
          <volume>34</volume>
          :
          <fpage>443</fpage>
          {
          <fpage>498</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>S.</given-names>
            <surname>Hertling</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Paulheim</surname>
          </string-name>
          .
          <article-title>WikiMatch - Using Wikipedia for Ontology Matching</article-title>
          .
          <source>In Proceedings of the 7th International Workshop on Ontology Matching (OM</source>
          <year>2012</year>
          ). CEUR,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>P.</given-names>
            <surname>Knoth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zilka</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zdrahal</surname>
          </string-name>
          .
          <article-title>Using explicit semantic analysis for crosslingual link discovery</article-title>
          .
          <source>In Proceedings of 5th International Workshop on Cross Lingual Information Access: Computational Linguistics and the Information Need of Multilingual Societies</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>O.</given-names>
            <surname>Medelyan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.H.</given-names>
            <surname>Witten</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Milne</surname>
          </string-name>
          .
          <article-title>Topic indexing with Wikipedia</article-title>
          .
          <source>In Proceedings of AAAI Workshop on Wikipedia and Arti cial Intelligence: an Evolving Synergy</source>
          , pages
          <volume>19</volume>
          {
          <fpage>24</fpage>
          . AAAI Press,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>P. N.</given-names>
            <surname>Mendes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jakob</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Garc</surname>
          </string-name>
          a-Silva, and
          <string-name>
            <given-names>C.</given-names>
            <surname>Bizer</surname>
          </string-name>
          . DBpedia Spotlight:
          <article-title>Shedding light on the web of documents</article-title>
          .
          <source>In Proceedings of I-SEMANTICS '10</source>
          , pages
          <fpage>1</fpage>
          <article-title>{8</article-title>
          . ACM,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>D.</given-names>
            <surname>Milne</surname>
          </string-name>
          and
          <string-name>
            <given-names>I. H.</given-names>
            <surname>Witten</surname>
          </string-name>
          .
          <article-title>Learning to link with Wikipedia</article-title>
          .
          <source>In Proceedings of CIKM '08</source>
          , pages
          <fpage>509</fpage>
          {
          <fpage>518</fpage>
          . ACM,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>M. Palmonari</surname>
            , G. Viscusi, and
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Batini</surname>
          </string-name>
          .
          <article-title>A semantic repository approach to improve the government to business relationship</article-title>
          .
          <source>Data Knowl. Eng.</source>
          ,
          <volume>65</volume>
          (
          <issue>3</issue>
          ):
          <volume>485</volume>
          {
          <fpage>511</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14. H. Paulheim.
          <article-title>WeSeE-Match results for OEAI 2012</article-title>
          .
          <source>In Proceedings of the 7th International Workshop on Ontology Matching (OM</source>
          <year>2012</year>
          ),
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Robertson</surname>
          </string-name>
          and
          <string-name>
            <given-names>Hugo</given-names>
            <surname>Zaragoza</surname>
          </string-name>
          .
          <article-title>The probabilistic relevance framework: BM25 and beyond</article-title>
          .
          <source>Found. Trends Inf. Retr.</source>
          ,
          <volume>3</volume>
          (
          <issue>4</issue>
          ):
          <volume>333</volume>
          {
          <fpage>389</fpage>
          ,
          <string-name>
            <surname>April</surname>
          </string-name>
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>P.</given-names>
            <surname>Shvaiko</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Euzenat</surname>
          </string-name>
          .
          <article-title>Ontology matching: State of the art and future challenges</article-title>
          .
          <source>IEEE Trans. Knowl</source>
          . Data Eng.,
          <volume>25</volume>
          (
          <issue>1</issue>
          ):
          <volume>158</volume>
          {
          <fpage>176</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>D.</given-names>
            <surname>Spohr</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Hollink</surname>
          </string-name>
          , and
          <string-name>
            <surname>P. Cimiano.</surname>
          </string-name>
          <article-title>A machine learning approach to multilingual and cross-lingual ontology matching</article-title>
          .
          <source>In Proceedings of ISWC 2011</source>
          , pages
          <fpage>665</fpage>
          {
          <fpage>680</fpage>
          . Springer-Verlag,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <given-names>E. M.</given-names>
            <surname>Voorhees</surname>
          </string-name>
          .
          <article-title>TREC-8 question answering track report</article-title>
          .
          <source>In Proceedings of TREC-8</source>
          , pages
          <fpage>77</fpage>
          {
          <fpage>82</fpage>
          . NIST Special Publication 500-
          <issue>246</issue>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Isaac</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Schopman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Schlobach</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L. Van Der</given-names>
            <surname>Meij</surname>
          </string-name>
          .
          <article-title>Matching multi-lingual subject vocabularies</article-title>
          .
          <source>In Proceedings of ECDL '09</source>
          , pages
          <fpage>125</fpage>
          {
          <fpage>137</fpage>
          , Berlin, Heidelberg,
          <year>2009</year>
          . Springer-Verlag.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>