<!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>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Wiem Baazouzi</string-name>
          <email>wiem.baazouzi@ensi-uma.tn</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>MarouenKachroudi</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sami Faiz</string-name>
          <email>sami.faiz@insat.rnu.tn</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Université de Manouba, Ecole Nationale des sciences de l'informatique, Laboratoire de Recherche en génie logiciel</institution>
          ,
          <addr-line>Application distribuées, Manouba 2010, Tunis, Tunisie</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Université de Tunis El Manar, Ecole Nationale d'Ingénieurs de Tunis, Laboratoire de Télédétection et Systèmes d'Information à Référence Spatiale</institution>
          ,
          <addr-line>99/UR/11-11, 2092, Tunis, Tunisie</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Université de Tunis El Manar, Faculté des Sciences de Tunis</institution>
          ,
          <addr-line>Informatique Programmation Algorithmique et Heuristique, LR11ES14, 2092, Tunis, Tunisie</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <abstract>
        <p>In this article, we present our systemKepler-aSI, for the Semantic Web Challenge on Tabular Data to Knowledge Graph Matching (SemTab 2023). This is the fourth participation in the challenKge.pler-aSI is intended to participate in three content tasks: column type annotation (CTA), cell entity annotation (CEA), and column property annotation (CPA) K.epler-aSI still relies on SPARQL query to semantically annotate tables in Knowledge Graphs (KG), to solve critical task matching issues. The results obtained during the evaluation phase are encouraging and show the strengths of the proposed system.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Tabular Data</kwd>
        <kwd>Knowledge Graph</kwd>
        <kwd>Kepler-aSI</kwd>
        <kwd>Semantic Web Challenge</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Presentation of the system Kepler-aSI</title>
      <p>Kepler-aSI, as a table annotation system, can eficiently process three tabular data to knowledge
graph matching tasks: column type annotation (CTA), entity annotation of cell (CEA) and column
property annotation (CPA). Our system makes full use of the structure of tabular data and the
information provided by Knowledge Graphs (KG). The datasets demonstrate thKaetpler-aSI
has disambiguation capability and achieves performance with less query timKe.pler-aSI, is
implemented as a set of tools, used in order, to provide three main functionalities.
1. Spelling correction for natural language processing (NLP) which is deployed in multiple
applications such as information retrieval, information retrieval and search engines.
2. The annotation of tabular data is a central phase of the system. It allows us to extract
candidate annotations from Knowledge Graphs (such as Wikidata) using parameterized
SPARQL queries.
3. Disambiguation It is important to recognize that an entity within Knowledge Graphs
can be associated with multiple classes. The presence of several classes for an entity
enriches its representation and allows a more complete understanding of its semantic
context within Knowledge Graphs.</p>
      <p>To provide these functionalities,Kepler-aSI is structured as follows. The preprocessing
modules perform table cleanup and a first high-level characterization of their form and
content. After performing the various pre-processing treatments, the tabular data
annotation phase can be triggered and After having the candidate annotations, we move on to
ifltering through the Disambiguation phase.
2.1. System description
In order to address the above mentioned SemTab challenge tasKkse,pler-aSI is designed
according to the workflow depicted by Figure 1. There are three major complementary modules
which consist in, respectively, Preprocessing, Annotation context and Tabular data to KG
matching. The aforementioned steps are the same for each round, but the changes remain
minimal depending on the variations observed in each case. As shown in Figu1rePreprocessing
aims to prepare the data inside the considered table. While Annotation Context, seeks to create
a list of terms denoting the same context.
□ Preprocessing :</p>
      <p>The content of each table can vary significantly in terms of types and formats, such as
numeric, character strings, binary data, date/time, boolean, addresses, and more. This
diversity of data types makes the pre-processing step particularly crucial. The main objective
of preprocessing is to ensure that the processing of each table can proceed smoothly without
encountering any errors. This becomes especially challenging when dealing with data
that contains spelling errors. Consequently, resolving these issues becomes a prerequisite
before applying any further approach. In order to well carry out this step, we used several
techniques and libraries such as (Textbl1o,bPyspellchecker2, etc.) to rectify and correct
all the noisy textual data in the considered tables. As an example, we detect punctuation,
1https://textblob.readthedocs.io/en/dev/
2https://pypi.org/project/pyspellchecker/
□
□
□
parentheses, hyphen and apostrophe, and also stop words by using thPeandas3 library to
remove them. Like a classic treatment in this register, we ended this phase by transforming
all the upper case letters into lower case.</p>
      <sec id="sec-2-1">
        <title>Annotation context :</title>
        <p>During this phase, candidates for the annotation process are explicitly extracted. This
extraction is achieved through an analysis of the processing columns, which aims to
comprehend and define a set of regular expressions encompassing various units. These units
include area, currency, density, electric current, energy, flow rate, force, frequency, energy
eficiency, information unit, length, mass, numbers, population density, power, pressure,
speed, temperature, time, torque, voltage, and volume. By identifying and delimiting these
regular expressions, the relevant units are isolated and prepared for further annotation.
This step allows to identify multiple Regextypes using regular expressioen.sg.( numbers,
geographic coordinates, address, code, color, URL). Since all values of type text are selected,
preprocessing for natural languages was performed using lthaengrid4 library to detect
26 languages in our data. By the way, it’s a novelty for this year’s SemTab campai.gen.,,
which makes the task more dificult with the introduction of natural language barriers. The
langrid library serves as a standalone language identification tool and currently supports a
wide range of languages (97 in total). It eficiently handles correction, data type identification,
and language detection. By employing this library, the need for repetitive treatments in each
subtask and for every cell in the tables is significantly reduced. This reduction in efort and
cost can be substantial, as it allows us to avoid the massive repetition of these processes for
all table cells.</p>
      </sec>
      <sec id="sec-2-2">
        <title>Assigning a semantic type to a column (CTA) :</title>
        <p>The task is to annotate each entity column with elements from Wikidata (or possibly Dbpedia)
as its type identified during the preprocessing phase. Each item is marked with the tag in
Wikidata or Dbpedia. This treatment allows semantics identification. The CTA task can
be performed based on Wikidata or Dbpedia APIs which allows us to search for an item
according to its description. The main information collected about a given entity and used in
our approach are: a list of instances (expressed by thienstanceOf primitive and accessible
by the P31 code), the subclass of (expressed by thesubclassOf primitive and accessible by
code P279) and overlaps (expressed by thepartOf primitive and accessible by code P361). At
this point, we are able to process the CTA task using a SPARQL query. The SPARQL query is
our interrogation mean fed by the main information of the entity which governs the choice
of each data type, since they are a list of instances (P31), of subclasses (P279) or a part of a
class (P361). The result of the SPARQL query may return a single type but for some cases
the result is more than one type, so in this case no annotation is produced for the CTA task.</p>
      </sec>
      <sec id="sec-2-3">
        <title>Matching a cell to a KG entity (CEA) :</title>
        <p>3https://pandas.pydata.org
4https://github.com/openlangrid</p>
        <p>The CEA task involves annotating the cells of a given table with specific entities from
Wikidata or Dbpedia. Similar to the CTA task, our approach follows the same principles. We
leverage the results obtained from the CTA task process and make necessary modifications
to the SPARQL query for the CEA task. In cases where the operation returns more than one
annotation, we address the ambiguity problem by examining the context of the column in
question, relative to the results obtained from the CTA task. This contextual analysis helps
us overcome any ambiguities and refine the annotations for the table cells.
Once the cell values and their respective entity types have been annotated, the next step is
to identify relationships between two cells that appear in the same row using a property
through a SPARQL query. This task is known as the CPA task, which aims to annotate
the relationship between two cells in a row via a property. Similar to the CTA and CEA
tasks, the CPA task can be performed using a similar approach. However, in the CPA task,
the SPARQL query needs to select both the entity and its corresponding attributes. The
properties for establishing relationships are relatively easy to match since we have already
determined them during the CEA and CTA task processing. In summary, the CPA task
involves finding relationships between cell values using properties through SPARQL queries,
and it complements the CTA and CEA tasks in annotating and linking the information in
the given table.</p>
        <p>
          Disambiguation It is important to recognize that an entity in Knowledge Graphs can be
associated with multiple classes. This indicates that entities can have diferent classifications
in Knowledge Graphs, reflecting the diferent aspects, roles, and characteristics associated
with them. The presence of several classes for a enriches its representation and provides a
more complete understanding of its semantic context within Knowledge Graphs. ( For more
details [
          <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6 ref7">3, 4, 5, 6, 7</xref>
          ])
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Kepler-aSI performance and results</title>
      <p>
        In this section we will present the results oKfepler-aSI for the diferent matching tasks in
the 2 rounds of SemTab 2023 ( Table 1). We would like to report that the results are presented
according to two scenarios,i.e., before deadline and after deadline (since the organizers
allow participants a period of 1 month before freezing the values). These results highlight
the strengths of Kepler-aSI with its encouraging performance despite the multiplicity of
issues. To measure the efectiveness of the data repair and data augmentation features of the
Kepler-aSI.R.A process, we based on the results of Kepler-aSI, we used the following metrics
proposed in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] : Precision ( P) , Recall (R) and F-measure (F1). (P), (R) and (F1) of the mapping
between the datasets, the Wikidata KG and the DBpedia KG are calculated using the following
formula: where a perfect annotation refers to the annotation returned by our approach, which
corresponds to ground truth annotations, a submitted annotation refers to the annotation
returned by our approach and a ground truth of the annotations corresponds to the number of
annotations in the target tables. We combined the predefined measurements, which represent
the harmonic mean between P and R to calculate F1.
      </p>
      <p>The SemTab 2023 challeng5ehas been organized into two diferent courses: the Precision
course, which is the standard course ofered in previous editions, which focuses on applications
in real-world contexts where the output of matching systems can contribute. In this section
we will present the results of Kepler-aSI for the diferent matching tasks in the two rounds
of SemTab 2023. These results highlight the strengths of Kepler-aSI with its encouraging
performance despite the multiplicity of issues.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion &amp; Future Work</title>
      <p>In this paper, we presented our contribution to the SemTab2023 challengKee, pler-aSI. We
tackled the several proposed tasks. Our solution is based on a generic SPARQL query using the
cell contents as a description of a given item. In each round, despite the time allocated by the
organizers running out, we continued the work and the improvements, having the conviction
that each efort counts and brings us closer to the good control of the studied fieldK.epler-aSI is
a promising approach but which will be further improved: First, we will apply several methods
yet to correct spelling mistakes and other typos in the source data. Finally, we will try to develop
our system by integrating new data processing techniques (some Big Data oriented paradigms).
Indeed, the parallel implementation will allow us to circumvent the data size problem, which is
the major gap for our current machines. Eventually, the idea of moving to a data representation
using indexes would be a good track to investigate in order to master the search space, formed
by the considered tabular data.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Jiménez-Ruiz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Horrocks</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Sutton</surname>
          </string-name>
          ,
          <article-title>Colnet: Embedding the semantics of web tables for column type prediction</article-title>
          ,
          <source>in: Proceedings of the AAAI Conference on Artificial Intelligence</source>
          , volume
          <volume>33</volume>
          ,
          <year>2019</year>
          , pp.
          <fpage>29</fpage>
          -
          <lpage>36</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Malyshev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Krötzsch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>González</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gonsior</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bielefeldt</surname>
          </string-name>
          ,
          <article-title>Getting the most out of wikidata: Semantic technology usage in wikipedia's knowledge graph</article-title>
          , in: International Semantic Web Conference, Springer,
          <year>2018</year>
          , pp.
          <fpage>376</fpage>
          -
          <lpage>394</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>W.</given-names>
            <surname>Baazouzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kachroudi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Faiz</surname>
          </string-name>
          ,
          <article-title>A matching approach to confer semantics over tabular data based on knowledge graphs, in: Model and Data Engineering: 11th International Conference</article-title>
          , MEDI 2022, Cairo, Egypt,
          <source>November 21-24</source>
          ,
          <year>2022</year>
          , Proceedings, Springer,
          <year>2022</year>
          , pp.
          <fpage>236</fpage>
          -
          <lpage>249</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>W.</given-names>
            <surname>Baazouzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kachroudi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Faiz</surname>
          </string-name>
          ,
          <article-title>Towards an eficient fairification approach of tabular data with knowledge graph models</article-title>
          ,
          <source>Procedia Computer Science</source>
          <volume>207</volume>
          (
          <year>2022</year>
          )
          <fpage>2727</fpage>
          -
          <lpage>2736</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>W.</given-names>
            <surname>Baazouzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kachroudi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Faiz</surname>
          </string-name>
          ,
          <article-title>Kepler-asi: Kepler as a semantic interpreter</article-title>
          ., in: SemTab@ ISWC,
          <year>2020</year>
          , pp.
          <fpage>50</fpage>
          -
          <lpage>58</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>W.</given-names>
            <surname>Baazouzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kachroudi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Faiz</surname>
          </string-name>
          , Kepler-asi at semtab
          <year>2021</year>
          ., in: SemTab@ ISWC,
          <year>2021</year>
          , pp.
          <fpage>54</fpage>
          -
          <lpage>67</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>W.</given-names>
            <surname>Baazouzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kachroudi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Faiz</surname>
          </string-name>
          ,
          <article-title>Yet another milestone for kepler-asi at semtab 2022, Semantic Web Challenge on Tabular Data to Knowledge Graph Matching (SemTab), CEURWS</article-title>
          . org (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>E.</given-names>
            <surname>Jiménez-Ruiz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Hassanzadeh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Efthymiou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Srinivas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Cutrona</surname>
          </string-name>
          ,
          <source>Results of semtab</source>
          <year>2020</year>
          , in: CEUR Workshop Proceedings, volume
          <volume>2775</volume>
          ,
          <year>2020</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>