<!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>Kepler-aSI : Kepler as A Semantic Interpreter</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Wiem Baazouzi</string-name>
          <email>wiem.baazouzi@ensi-uma.tn</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marouen Kachroudi</string-name>
          <email>marouen.kachroudi@fst.rnu.tn</email>
          <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="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institut Superieur Des Arts Multimedias De Manouba, UR Teledetection Et Systemes D'informations A Reference Spatiale</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Laboratoire de Recherche en genie logIciel, Application distribuees , systemes Decisionnels et Imagerie intelligente,National School of Computer Science</institution>
          ,
          <country>Tunis</country>
        </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>
      <abstract>
        <p>This paper presents our system Kepler-aSI, for the Semantic Web on Tabular Data Challenge to Knowledge Graph Correspondence (SemTab 2020).Kepler-aSI analyze tabular data and detect the correct matches in Wikidata, where data and values are annotated with a unique tag. Indeed, this task is di cult for machines to identify the right meaning of a given annotation. Kepler-aSI uses the SPARQL query to semantically annotate tables in Knowledge Graphs (KG), in order to solve the critical problems of the matching tasks, namely, CTA columns annotation.</p>
      </abstract>
      <kwd-group>
        <kwd>Tabular Data - Knowledge Graph - Kepler-aSI - SPARQL</kwd>
        <kwd>- Semantic Web Challenge</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The World Wide Web contains vast quantities of textual information in
several forms: unstructured text, template-based semi-structured Web pages (which
present data in key-value pairs and lists), and obviously tables. Methods which
aim to extract information from these resources to convert them into a structured
form have been the subject of several works. As an observation, it is obvious that
there is a lack of understanding for the semantic structure which can hamper the
process of data analysis. Gaining this semantic understanding will therefore be
very useful for data integration, data cleaning, data mining, machine learning,
and knowledge discovery tasks. For example, understanding data can help assess
the appropriate types of transformation on it.</p>
      <p>Tabular data is routinely transferred on the Web in a variety of formats.
Most of these data sets are available in tabular formats (e.g., CSV, Excel). The
main reason of this format popularity is simplicity: many common o ce tools
Copyright © 2020 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0)
(e.g., Excel) are available to facilitate their generation and exploitation. Tables
on the Web are the source of a highly valuable data. The addition of semantic
information to Web tables may enhance a wide range of applications, such as
Web search, Question Answering, and Knowledge Base (KB) building.</p>
      <p>Researchers have largely di erent problems about the data when they extract
tabular data from the Web, such as learning with limited labeled data, de ning
(or avoiding de ning) ontologies, making use of prior knowledge, and scaling
solutions on the Web. This task is often di cult in practice due to metadata
(e.g., table and column names) being missing, incomplete or ambiguous.</p>
      <p>
        In recent years, we have identi ed several works that can be mainly classi ed
as supervised (in the form of annotated tables to carry out the learning task) [1{
5] or unsupervised (tables whose data is not dedicated to learning) [
        <xref ref-type="bibr" rid="ref5 ref6">6, 5</xref>
        ]. To solve
these problems, we propose a global approach named Kepler-aSI, which
addresses the challenge of matching tabular data to knowledge graphs.This method
is based on previous work, which deals with ontology alignment. [7{9].
      </p>
      <p>In this challenge, the input is a CSV le, but three di erent challenges had
to be met :
1. CTA : A type of the Wikidata ontology had to be assigned a class KG to
a column (Column-Type Annotation ).
2. CEA : A wikidata entity had to be matched to the di erent cells
(Cell</p>
      <p>Entity Annotation).
3. CPA : A KG property had to be assigned to the relationship between two
columns (Columns Property Annotation).</p>
      <p>Data annotation is a fundamental process in tabular data analysis, it allows
to infer the meaning of other information. Then deduce the meaning of a tabular
knowledge graph. The data we used was based on Wikidata. We would like to
mention, in a more general context, that Wikidata is made up of several types
of documents, which obey the triples format : subject (S), a predicate (P) and
an object (O)</p>
      <p>Indeed, Cell Entity Annotation (CEA) matches a cell to a KG entity. At
this level, we have to annotate each individual element of the subject (S) and
the object (O). Column Property Annotation (CPA) assigns a KG property to
the relationship between two columns. The task is to nd out which property of
the two columns are connected to Wikidata. Column Type Annotation (CTA)
assigns connected semantic type to a column. This work means another topic
that can be described by including tags corresponding to the topic in Wikidata
in common.
2
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>Knowledge Graph &amp; Tabular Data</title>
      <sec id="sec-2-1">
        <title>Tabular Data</title>
        <p>S is a two-dimensional tabular structure made up of an ordered set of N rows
and M columns ( Fig 1). ni is a row of the table (i = 1 ... N), mj is a column of
the table (j = 1 ... M). The intersection between a row ni and a column mj is
ci;j , which is a value of the cell Si;j . The table contents can have di erent types
(string, date, oat, number, etc.).</p>
        <p>{ Target Table (S): M × N.
{ Subject Cell: S(i;0) (i = 1, 2 ... N).
{ Object Cell: S(i;j) (i = 1, 2 ... M),(j = 1, 2 ... N).</p>
        <p>Col0
Row1 0 S1;0 : : :</p>
        <p>B ... . . .</p>
        <p>BBB ... . . .</p>
        <p>Rowj BB Sj;0 : : :</p>
        <p>B@BBB ...... .. .. ..</p>
        <p>RowM SM ;0 : : :</p>
        <p>Coli
: : :
. . .
. . .</p>
        <p>Sj;i
. . .
. . .
: : :</p>
        <p>
          ColN
: : : S1;N 1
. . . ... C
. . . ... CCC
: : : Sj;N CC
.. .. .. ...... CCCAC
: : : SM ;N
Knowledge Graphs have been in the focus of research since 2012, resulting in
a wide variety of published descriptions and de nitions. The lack of a common
core, a fact that is also indicated by Paulheim [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] in 2015. Paulheim listed in
his survey of Knowledge Graph re nement, the minimum set of characteristics
that must be present to distinguish knowledge graphs from other knowledge
collections, which basically restricts the term to any graph based knowledge
representation. In the online reviewing [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ], authors agreed that a more precise
de nition was hard to nd at that point. This statement points out the demand
for closer investigation and deeper re ection in this area.
        </p>
        <p>
          Farber et al. de ned a Knowledge Graph as an Resource Description
Framework (RDF) graph and stated that the term KG was coined by Google to describe
any graph-based knowledge base (KB) [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. Although this de nition is the only
formal one, it contradicts with more general de nitions as it explicitly requires
the RDF data model.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>System Description</title>
      <p>
        The proposed system solve only CTA task. Our system consists of three phases
as agged by Figure 2. Although there are a number of methods available,
several ideas have been tried, but the most e ective according to our objective was
the idea used in the Mantistable approach [
        <xref ref-type="bibr" rid="ref12 ref5">5, 12</xref>
        ], we have indeed adopted the
following phases:
      </p>
      <p>Phase 1 Data preparation: This phase is used to prepare the data inside
the table.</p>
      <p>Phase 2 Column Analysis: In this phase, we determined the semantic
classi cation of the columns to determine Named-Entity column (NE-column),
Literal column (L-column) or Subject column (S-column).</p>
      <p>Column-Type Annotation (CTA) which deals with mappings between columns
and semantic elements in a knowledge graph KG by using a SPARQL query. In
the next section, you will nd detailed information about each phase.</p>
      <sec id="sec-3-1">
        <title>Data Preparation</title>
        <p>
          Data preparation aims to clean and standardize the data within the table. The
transformations applied to tables are as follows:
1. The deletion of certain characters : For each of the cell values, we rst clean
them by retaining only the part that comes before a `(' or `[' and by removing
all `
2. The transformation of text into lowercase, deletion of text in brackets,
resolution of acronyms and abbreviations, and normalisation of units of
measurement to decipher acronyms and abbreviations.
3. The normalization of the units of measurement is performed by applying
regular expression treatments, as described in [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
        </p>
        <p>The use of regular expressions allows to devour a complete set of units, which
includes area, currency, density, electric current, energy, ow, strength, frequency,
energy e ciency, unit of information, length, linear mass density, mass, numbers,
population density, power, pressure, speed, temperature, time, torque, voltage
and volume.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Column Analysis</title>
        <p>In this task we have classi ed the columns into several types with columns
named entity (NE-column) or literal column (L-column) and detected of the
subject column (S-column).</p>
        <p>To accomplish this task, we consider 16 regular expressions that identify
multiple Regextypes (for example, numbers, geographic coordinates, address,
hexadecimal color code, URL).</p>
        <p>To accomplish this task, we consider 16 regular expressions that identify
multiple Regextypes (eg, numbers, geographic coordinates, address, hexadecimal
color code, URL). Then, we set a threshold (equal to 0.7), if the number of
occurrences of the Regextype in a column (for example an address) is the most
frequent and exceeding this threshold, then this column is annotated as Column
L, otherwise, it is annotated as NE-column. After the detection of this column
(L-column or NE-column), we identi ed the subject column S-column.</p>
        <p>
          Finaly to de ne the S-column as the main column of the table according to
di erent statistical characteristics, namely [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] :
{ aw: the average number of words in each cell.
{ emc: the fraction of empty cells in the column.
{ uc: the fraction of cells with unique content.
{ df: the distance of the rst NE-column.
        </p>
        <p>
          These characteristics are combined to calculate the sub-column score (cj ) for
each NE-column as follows [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] :
subcol(cj ) =
2ucnorm(cj ) + awnorm(cj )
        </p>
        <p>emcnorm(cj )
pdf (cj ) + 1
(1)
Concept and data type annotation deals with mappings between columns and
semantic elements (concepts or data types) in a KG. Figure ( Fig 3) shows the
four stages of our architecture for CTA. In the rst concept annotation step,
we started with an entity link found in KG with a column from a table, from
common CSV les, then in the second step we fetched the contents of a column
like ItemDescription in our SPARQL query to query wikidata, in order to nd
the caption of the winning class. The ItemDescription "%s" ( Listing 1.1) on a
Wikidata entry is a short phrase designed to disambiguate items with the same
or similar labels. A description does not need to be unique; multiple items can
have the same description, however no two items can have both the same label
and the same description. If multiple entities were returned for a cell, the one
with the number of occurrences was taken. For Correspondence of columns with
Knowledge KG entities, All the inferred column types were taken into account
using a simple SPARQL query:
Listing 1.1. SPARQL query to retrieve a set of entities eligible for the content of a
column.</p>
        <p>f
g</p>
        <p>SELECT ? i t e m L a b e l ? c l a s s
WHERE f
? item ? i t e m D e s c r i p t i o n "%s "@en .</p>
        <p>? item wdt : P31 ? c l a s s
g
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Evaluation results</title>
      <p>In this section, the results of the Kepler-aSI approach during Rounds 1, 2, 3
and 4 of the challenge are presented. F1-Score and Precision values are listed in
Table 1 for the CTA task.</p>
      <p>The values obtained in the 3 rounds are encouraging in relation to the
volumes of data and the limits of the machines. This means that there are ways
to investigate in terms of new technologies that can allow us to get around this
kind of problem.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion Future Work</title>
      <p>To sum up, we have developed a simple approach for automatic table
annotation. While there are several techniques available, we have chosen a simpler
approach. Our main e ort was in the CTA task and how to proceed using a
content-based SPARQL query, but our approach misses the preprocessing phase
and data correction. Several techniques were tried during preprocessing, but
the most e ective was spell checking. This pre-treatment may be improved to
increase the precision values. We try to improve on this weak point of our
approach in future work. We also have other problems, one run may take 12 hours
due to the limitation of our machines. The execution of our system Kepler-aSI
requires a lot of instruction of reading and writing, to consult Wikidata. This
requires a great resource in terms of RAM and processor, to improve the matching
processes. We plan to investigate this lead in the near future to identify which
resource needs to be further improved. So for a large data set running a job
locally was not possible in our case.</p>
      <p>In this article, we presented our contribution to the SemTab2020 challenge,
Kepler-aSI. We tackled a posed task, the CTA. We base our solution only
on SPARQL queries using the cell contents as a description of a given item.
Our main e ort was in using the cell contents as a description of a given item.
Kepler-aSI is a simple approach but we will improve our preprocessing phase
for two main purposes: First, we will apply a method to correct spelling mistakes
and other typos in the source data. Second, we'll determine the data type of each
column. Although the system distinguishes more types of data: OBJECT, DATE,
STRING and NUMBER. Finally, due to the small size of the used machines
during in the di erent evaluation phases (Intet (R) Core (TM) i5-7200U CPU @
2.50GHZ, 2701 MHz, 2 cores 4 processors, with 8 GB of RAM ), we will try to
develop our system by integrating new data processing techniques. 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. In addition, the processing
parallelism will allow us to circumvent the problem of the data size which is the
major gap for our current machines.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Pham</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alse</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Knoblock</surname>
            ,
            <given-names>C.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Szekely</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Semantic labeling: a domainindependent approach</article-title>
          . In: International Semantic Web Conference, Springer (
          <year>2016</year>
          )
          <volume>446</volume>
          {
          <fpage>462</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Taheriyan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Knoblock</surname>
            ,
            <given-names>C.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Szekely</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ambite</surname>
            ,
            <given-names>J.L.</given-names>
          </string-name>
          :
          <article-title>Learning the semantics of structured data sources</article-title>
          .
          <source>Journal of Web Semantics</source>
          <volume>37</volume>
          (
          <year>2016</year>
          )
          <volume>152</volume>
          {
          <fpage>169</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Ramnandan</surname>
            ,
            <given-names>S.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mittal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Knoblock</surname>
            ,
            <given-names>C.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Szekely</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Assigning semantic labels to data sources</article-title>
          .
          <source>In: European Semantic Web Conference</source>
          , Springer (
          <year>2015</year>
          )
          <volume>403</volume>
          {
          <fpage>417</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Knoblock</surname>
            ,
            <given-names>C.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Szekely</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ambite</surname>
            ,
            <given-names>J.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goel</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gupta</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lerman</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Muslea</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Taheriyan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mallick</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Semi-automatically mapping structured sources into the semantic web</article-title>
          .
          <source>In: Extended Semantic Web Conference</source>
          , Springer (
          <year>2012</year>
          )
          <volume>375</volume>
          {
          <fpage>390</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Cremaschi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Paoli</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rula</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Spahiu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>A fully automated approach to a complete semantic table interpretation</article-title>
          .
          <source>Future Generation Computer Systems</source>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>E ective and e cient semantic table interpretation using tableminer+</article-title>
          .
          <source>Semantic Web</source>
          <volume>8</volume>
          (
          <issue>6</issue>
          ) (
          <year>2017</year>
          )
          <volume>921</volume>
          {
          <fpage>957</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kachroudi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Diallo</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Ben</given-names>
            <surname>Yahia</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.:</surname>
          </string-name>
          <article-title>OAEI 2017 results of KEPLER</article-title>
          .
          <source>In: Proceedings of the 12th International Workshop on Ontology Matching co-located with the 16th International Semantic Web Conference (ISWC</source>
          <year>2017</year>
          ), Vienna, Austria, October
          <volume>21</volume>
          ,
          <year>2017</year>
          . Volume 2032 of CEUR Workshop Proceedings., CEUR-WS.org (
          <year>2017</year>
          )
          <volume>138</volume>
          {
          <fpage>145</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Kachroudi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Ben</given-names>
            <surname>Yahia</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          :
          <article-title>Dealing with direct and indirect ontology alignment</article-title>
          .
          <source>J. Data Semant</source>
          .
          <volume>7</volume>
          (
          <issue>4</issue>
          ) (
          <year>2018</year>
          )
          <volume>237</volume>
          {
          <fpage>252</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Kachroudi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Diallo</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Ben</given-names>
            <surname>Yahia</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.:</surname>
          </string-name>
          <article-title>KEPLER at OAEI 2018</article-title>
          .
          <source>In: Proceedings of the 13th International Workshop on Ontology Matching co-located with the 17th International Semantic Web Conference, OM@ISWC</source>
          <year>2018</year>
          , Monterey, CA, USA, October
          <volume>8</volume>
          ,
          <year>2018</year>
          . Volume 2288 of CEUR Workshop Proceedings., CEUR-WS.org (
          <year>2018</year>
          )
          <volume>173</volume>
          {
          <fpage>178</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Ehrlinger</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          , Wo , W.:
          <article-title>Towards a de nition of knowledge graphs</article-title>
          .
          <source>SEMANTiCS (Posters</source>
          , Demos, SuCCESS)
          <volume>48</volume>
          (
          <year>2016</year>
          ) 1{
          <fpage>4</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. Farber,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Bartscherer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Menne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Rettinger</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>Linked data quality of dbpedia, freebase, opencyc, wikidata, and yago</article-title>
          .
          <source>Semantic Web</source>
          <volume>9</volume>
          (
          <issue>1</issue>
          ) (
          <year>2018</year>
          )
          <volume>77</volume>
          {
          <fpage>129</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Cremaschi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Avogadro</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chieregato</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Mantistable: an automatic approach for the semantic table interpretation</article-title>
          . In: SemTab@ ISWC. (
          <year>2019</year>
          )
          <volume>15</volume>
          {
          <fpage>24</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Ritze</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lehmberg</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Matching html tables to dbpedia</article-title>
          .
          <source>In: Proceedings of the 5th International Conference on Web Intelligence, Mining and Semantics</source>
          . (
          <year>2015</year>
          ) 1{
          <fpage>6</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>