<!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>A Journey From Simple to Complex Alignment on Real-World Ontologies</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>DaSe Lab, Wright State University</institution>
          ,
          <addr-line>Dayton OH 45435</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Ontology alignment has been an active research topic for over a decade. Over that time, many developers have focused on creating alignment systems and methods to nd simple 1-to-1 equivalence matches between two ontologies. However, very few alignment systems focus on nding complex correspondences. There are several reasons for this limitation. First, there are no widely accepted alignment benchmarks that contain such complex relationships. Second, the traditional evaluation metrics like precision, recall, and f-measure are not accurate enough to evaluate the performance of a complex alignment system. And third, the approaches most commonly used to nd simple equivalences do not handle the increased computational complexity of nding complex equivalences well. Therefore, it becomes a big challenge for many developers to create and evaluate the systems. In this paper, in order to advance the development of ontology matching, we seek to address the problem by rst developing potential complex alignment benchmarks from realworld ontologies. In addition, we utilize traditional automated alignment systems to suggest complex correspondences, and nally plan to achieve our ultimate goal of creating and evaluating our own complex alignment system based on logical RDF data compression.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Similar to database integration, ontology alignment is an important process in
enabling computers to query and reason across the many linked open datasets on
the semantic web. This is a di cult challenge because the ontologies underlying
di erent linked datasets can vary in terms of subject area coverage, level of
abstraction, ontology modeling philosophy, and even language.</p>
      <p>
        In order to solve this problem, an ontology alignment system aims to
identify the entity relationships between two and more ontologies. Such relationships
have a wide range of complexity, from basic 1-to-1 equivalence to arbitrary
mto-n relationships. However, over a decade, the majority of the studies in the
eld still focuses on the simplest end of this scale { nding 1-to-1 equivalence
relations between ontologies. Very few ontology alignment systems and methods
are developed to uncover complex relations. The reasons for this limitation may
lie in the following. First, there are no widely used and accepted ontology
alignment benchmarks that involve complex relations. Without these benchmarks,
even if there were a complex alignment system, it is not only very hard to
evaluate if this system could correctly detect the complex correspondences, but also
it is a challenge to evaluate whether the system is comprehensive enough to
nd all di erent kinds of complex patterns. Second, the traditional approach of
precision, recall, and f-measure does not seem ne-grained enough to evaluate
complex correspondences. A better version of precision and recall is needed [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>This work seeks to progress in the direction of fostering the development of
research activities in the eld of complex ontology alignment. We rstly show
that real-world ontologies involve many complex relations. And based on these
real-world datasets, we develop high quality complex alignment benchmarks,
including creating complex alignments and categorizing them into complex
patterns. In addition, to decrease the complexity of detecting complex relations, we
leverage automated alignment systems to uncover and suggest possible complex
relations. Moreover, we plan to apply logical RDF compression with the results
that are generated by traditional automated alignment systems to create a new
complex alignment system.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Relevancy</title>
      <p>
        Ontology alignment seeks to address the conceptual heterogeneities between
ontologies. Over a decade, the community of this eld remains on creating and
improving the algorithms of nding simple alignments. The reason that the
researchers do not really dig into the complex alignment for such a long time, is
that the community is still discovering and analyzing how to reach the goal.
Nowadays, the research related to simple alignment has been well studied. It is
actually a good timing to move on to complex ontology alignment, because more
and more good alignment systems and algorithms have been published, and also
more and more data are populated into ontologies and published as linked open
data, the applications that utilize these LODs are required to involve ontology
matching and data integration processes [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. In addition, due to the complexity
of the alignments between ontologies, only identifying traditional simple 1-to-1
alignment is not enough to ful ll the growing high demand of most of these
applications. Therefore, it is necessary to create complex alignment systems and
methods to uncover complex relations in real-world use cases.
      </p>
      <p>This work focuses on addressing the problem from several di erent
perspectives. We prepared benchmarks that involve complex relations from real-world
ontologies and will try to distribute them as a new track in the Ontology
Alignment Evaluation Initiative (OAEI), which was started in 2005 with the intent
to allow researchers in the eld to compare the performance of their approaches
on a consistent set of benchmarks over time. Since then, it has been more
convenient for researchers from di erent organizations to test their methods. Second,
as we've seen, it is a di cult challenge to detect complex relations. This work
seeks to narrow down this issue by leveraging traditional alignment systems to
suggest possible complex candidates. This would be a valuable starting point for
determining the exact relation. Moreover, our ultimate goal in this work is to
create a complex alignment system that has better performance than traditional
automated alignment systems.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Related work</title>
      <p>
        Regarding the creation of complex alignment benchmarks, Thieblin [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] is
creating a complex alignment benchmark using the Conference track ontologies within
the OAEI. This work is partially completed, and at the time of this writing it
covers three of the seven ontologies. In addition, we are collaborating with them
(under their direction) to complete the dataset and prepare a new task in OAEI
to evaluate complex alignment systems.
      </p>
      <p>
        However, even though there are no widely accepted and used benchmarks
that involve complex relations, some researchers still tried to create alignment
systems and evaluate them using their ow manually developed reference
alignment. BLOOMS [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] is an alignment system based on Wikipedia to detect the
subsumption relations. Other subsumption systems have evaluated the precision
of their approach by manually validating relations produced by their system,
while foregoing an assessment of recall [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. There are some more general
approaches based on complex patterns to detect complex correspondences. Ritze
et al [
        <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
        ] proposed several complex correspondences patterns. Such as: Class
by Attribute Value, Class by Attribute Type, Class by Inverse Attribute Type,
Inverse Properties, and Property Chain. In addition, Ritze also utilized linguistic
analysis techniques, like detection of antonymy, active form, etc to help detect
these complex patterns. Other similar work was done by Svab-Zamazal and
Svatek [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. It rstly detected N-ary relations in the source ontology. And then,
it matched the detected N-ary relations to an object property in the target
ontology.
      </p>
      <p>Our work di ers from the above methods in several aspects. First, we focus
on real-world ontologies, which we found that these datasets are not only used
by academic researchers, but also the industries and governments to develop
applications for the usage of normal human life. There are some interesting
relations that have not yet been mentioned in the current benchmark from OAEI.
In addition, the instance data of these real-world ontologies are ready to be used
as additional information to help improve the performance of alignment process.
In contrast to this, signi cant instance data is not readily available for most of
the OAEI Conference Track ontologies. Moreover, regarding the creation of a
complex alignment, instead of comparing each entity in the source ontology to
each entity in the target ontology, we apply logical RDF compression to list a
set of available rules, and narrow down them based on the suggestion generated
by traditional alignment systems to nally output the complex relation. More
details are discussed in Section 5.</p>
    </sec>
    <sec id="sec-4">
      <title>Research Questions and Hypotheses</title>
      <p>The research questions that we plan to address are listed as follows:
1. Do real-world ontology alignments contain complex relations?
2. How well do traditional automated alignment systems work on real-world
matching tasks that contain complex relations?
3. Can we create an automated alignment system that performs better than
traditional alignment systems on nding complex relations that exist between
ontologies?
Our hypotheses associated to the above research questions are the following:
1. Most real-world ontologies contain many complex relations.
2. Traditional automated alignment systems may not be able to identify
complex relationships directly, but they may be able to suggest the atomic
entities involved in such relations.
3. A complex alignment system that leverages logical RDF compression can
e ectively identify complex relations between ontologies.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Approach</title>
      <p>
        Hypothesis 1 Our previous work with the NSF EarthCube Initiative and the
US Geological Survey involved the time consuming task of manually aligning
several real-world ontologies. These alignments have been discussed and
evaluated by domain experts and ontology engineers to guarantee that they are of
high quality. We will inventory these alignments, along with any other real-world
alignments we can acquire, to answer the rst research question: Do real-world
ontology alignments contain complex relations?
Hypothesis 2 To answer the second research question, \How well do
traditional automated alignment systems perform on real-world matching tasks that
contain complex relations?", we plan to rst evaluate several state of the art
alignment systems on the alignment tasks mentioned above. Since traditional
alignment systems only attempt to identify simple relations between ontologies,
their performance will be limited to the percentage of the alignments that
involve these types of relations. However, it is possible that these systems, while
they cannot identify the precise relationship that holds between an entity in the
source ontology and two or more entities in the target ontology, they can at
least identify the entities involved in the relationship. For example, in the
relation below, the class M ischaakusaakihiikin in Cree ontology is equivalent to
the intersection of instances of LakeOrP ond and entities that isContainedBy
a SwampOrM arsh in the SWO ontology. While a traditional alignment
system cannot identify things like intersection or value restrictions, it may be able
to determine that LakeOrP ond, isContainedBy, and SwampOrM arsh are
related in some way to M ischaakusaakihiikin. To check this, for each entity es
in source ontology Os, we will use the automated alignment systems to give a
list of candidates et in the target ontology Ot, ordered by the similarity assigned
to them by the alignment system. We will evaluate the performance against the
benchmark using mean reciprocal rank [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <sec id="sec-5-1">
        <title>EquivalentClasses(cree:Mischaakusaakihiikin</title>
      </sec>
      <sec id="sec-5-2">
        <title>ObjectIntersectionOf(swo:LakeOrPond</title>
      </sec>
      <sec id="sec-5-3">
        <title>ObjectSomeValuesFrom(swo:isContainedBy swo:SwampOrMarsh)))</title>
        <p>
          Hypothesis 3 As we mentioned, the ultimate goal of this work is to see if
we can create an automated alignment system that e ectively identi es
complex relationships that exist between two ontologies. Our planned approach is
to create an extensional matcher (i.e. one that relies upon instance data) that
leverages logical RDF compression [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. Logical RDF compression uses the
FPGrowth data mining algorithm to generate rules that can be stored in lieu of
the triples they are based on. For example, say that a linked dataset contains
triples about university students. There might be many triples of the form &lt;ind1
hasMajor ComputerScience&gt; and many corresponding triples of the form &lt;ind1
isEnrolledIn CollegeOfEngineering&gt; because, according to this dataset, all
Computer Science majors are enrolled in the College of Engineering. Logical RDF
compression would replace the second set of triples with a single rule: if x is
hasMajor ComputerScience then x isEnrolledIn CollegeOfEngineering, and these
triples could then be generated on-the- y in response to queries, thereby saving
space in the linked dataset. While logical RDF compression seeks to nd any
rules that can be used to shrink the dataset, it is possible that some of these
rules represent meaningful semantic relations that hold between entities. For
example, if hasMajor ComputerScience exists in one ontology and isEnrolledIn
CollegeOfEngineering exists in another ontology, then it may be possible to infer
the relation below.
Because the FP-Growth algorithm underlying logical RDF compression can
generate a very large number of rules, some mechanism must be put in place to
choose the more semantically meaningful rules rather than the ones that result
in the most compression. Our planned approach for this is to choose rules that
involve the entities suggested by traditional alignment systems.
        </p>
        <p>
          The overall work ow is shown in Figure 1. We rst apply the traditional
alignment systems to suggest the candidates as we described above. And then,
we use RDF compression [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] on the source ontology to list a set of compression
rules. Based on the suggested candidates from traditional alignment systems,
we can create a lter to pick up the compression rules, and nally output the
complex relations.
We have some preliminary results in terms of nding complex relations from
realworld ontologies. There are two di erent datasets that we are currently working
on. One dataset is from GeoLink project1 that was funded under the U.S.
National Science Foundation's EarthCube initiative. Another dataset is a set of
ontologies from surface water domain. Based on these two sets of ontologies, we
have developed the alignments in consultation with domain experts from di
erent institutions. In GeoLink datasets, the number of classes, object properties,
and data properties in GeoLink base ontology (GBO) and GeoLink modular
ontology (GMO) are showed in Table 1. We found that the 87 out of 111 relations
in them are complex relations, including not only class subsumption, property
subsumption, property chain equivalence, and property chain subsumption that
were introduced in [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], but also some typecasting relations. The idea of
typecasting, and why it is important in ontology modeling, is formally introduced and
discussed in [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. Moreover, the alignment is also available in both EDOAL and
rules syntax for the purpose of manipulating and reading respectively. The full
dataset has been uploaded to the FigShare2. We also wrote a paper to describe
the creation and submitted to ISWC2018, which is currently under-review.
        </p>
        <p>
          In hydrography dataset, it consists of four ontologies. (a) The Surface
Water Ontology (SWO), which was originally presented in [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], was developed by
the US Geological Survey (USGS). (b) The Hydro3 ontology was developed by
individuals at the University of Maine in order to support expanded gazetteer
functions using topology and semantic inference [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. (c) The HydrOntology is a
non-English ontology, which was developed by the Spanish National Geographic
Institute (IGN) [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. (d) Cree surface water ontology is in a language, Cree, which
1 https://www.geolink.org/
2 https://doi.org/10.6084/m9. gshare.5907172
        </p>
        <p>Ontology Classes Object Properties Data Properties
GBO 40 149 49</p>
        <p>GMO 156 124 46
is spoken by some of the native inhabitants of northern Canada. The reason of
choosing these four ontologies is that Hydro3, HydrOntology and Cree have a
large degree of overlap with SWO. Therefore, we utilize these four ontologies
to create a reference alignment manually. Table 2 shows the number of classes,
and object properties, and data properties. And we found that the 84 out of
197 relations in them are complex relations. We are currently writing a paper
about evaluating the performance of traditional automated alignment systems
on this dataset. The traditional automated alignment systems are able to nd
the simple relationships. But, they may not be able to identify these complex
relationships directly. We hypothesize that they may be able to suggest some
possible complex relations partially. Moreover, it is able to greatly narrow down
the entities and mitigates the high complexity of computation.
In this section, we introduce the evaluation plan for each research question. For
research question 1, as we showed in Section 6, it is considered successful that
we have found many complex alignments in real-world ontologies. In addition,
we are also preparing to incorporate the dataset into OAEI as a new track for
other researchers accessing it. For research question 2, after achieving the list of
entities involved in a complex relation, we will evaluate the performance against
the benchmark using mean reciprocal rank as we discussed in Section 5. For
research question 3, it is a challenge to evaluate the performance of a complex
alignment system. The traditional precision, recall, and f-measure metrics do not
seem ne-grained enough. For example, there is a relation between Hydro3 and
SWO, if one alignment system identi ed this:</p>
      </sec>
      <sec id="sec-5-4">
        <title>EquivalentClasses(</title>
      </sec>
      <sec id="sec-5-5">
        <title>ObjectIntersectionOf(</title>
        <p>hydro3:Hydrographic_Feature
hydro3:Hydrographic_Structure
hydro3:Boundary)
swo:HydrographicFeature))
and another identi ed this:</p>
      </sec>
      <sec id="sec-5-6">
        <title>SubClassOf(</title>
      </sec>
      <sec id="sec-5-7">
        <title>ObjectUnionOf(</title>
        <p>hydro3:Hydrographic_Feature
hydro3:Island
hydro3:Shore)
swo:HydrographicFeature))
Based on the reference alignment, we need a metric to consider the rst
system \more correct" than the second. We plan to develop a performance metric
that more accurately re ects the performance of a complex alignment system.
Another challenge is that, to the best of our knowledge, there are no existing
complex alignment systems against which to compare our approach. Therefore,
we might consider evaluating the performance based on our manually created
reference alignment.
8</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Re ections</title>
      <p>It is primarily di cult to identify complex relationships between ontologies
because of computational complexity. A naive approach would need to compare
every entity in the source ontology to every possible combination of entities
in the target ontology, which is not feasible. Instead of doing this, our proposed
approach has a good chance of success because it is based on a logical RDF
compression method that has already been shown to be applicable to large datasets,
and we also can further limit the search space by using the output from
traditional alignment systems to narrow the focus. There are some re ections. The
performance of using logical RDF compression in our alignment system is
primarily based on the Abox information in the ontology. It is still not clear that
how to apply our alignment algorithm to a more generalized scenario. However,
our approach is feasible, and can be a good starting point to achieve the ultimate
goal in the future.</p>
      <p>Acknowledgments I am very grateful to my advisor Dr. Pascal Hitzler and Dr.
Michelle Cheatham for their support and constructive suggestions of this
research proposal.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Blazquez</surname>
            ,
            <given-names>L.M.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gargantilla</surname>
            ,
            <given-names>J.A.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lopez-Pellicer</surname>
            ,
            <given-names>F.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corcho</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>NoguerasIso</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>An approach to comparing di erent ontologies in the context of hydrographical information</article-title>
          .
          <source>In: Information Fusion and Geographic Information Systems, Proceedings of the Fourth International Workshop, IF&amp;GIS</source>
          <year>2009</year>
          ,
          <volume>17</volume>
          -
          <fpage>20</fpage>
          May
          <year>2009</year>
          , St. Petersburg, Russia. pp.
          <volume>193</volume>
          {
          <issue>207</issue>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Euzenat</surname>
          </string-name>
          , J.:
          <article-title>Semantic precision and recall for ontology alignment evaluation</article-title>
          .
          <source>In: IJCAI 2007, Proceedings of the 20th International Joint Conference on Arti cial Intelligence</source>
          , Hyderabad, India, January 6-
          <issue>12</issue>
          ,
          <year>2007</year>
          . pp.
          <volume>348</volume>
          {
          <issue>353</issue>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Jain</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hitzler</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sheth</surname>
            ,
            <given-names>A.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verma</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yeh</surname>
            ,
            <given-names>P.Z.</given-names>
          </string-name>
          :
          <article-title>Ontology alignment for linked open data</article-title>
          .
          <source>In: The Semantic Web - ISWC 2010 - 9th International Semantic Web Conference, ISWC 2010</source>
          , Shanghai, China, November 7-
          <issue>11</issue>
          ,
          <year>2010</year>
          ,
          <string-name>
            <given-names>Revised</given-names>
            <surname>Selected</surname>
          </string-name>
          <string-name>
            <surname>Papers</surname>
          </string-name>
          , Part I. pp.
          <volume>402</volume>
          {
          <issue>417</issue>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Krisnadhi</surname>
            ,
            <given-names>A.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hitzler</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Janowicz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>On the capabilities and limitations of OWL regarding typecasting and ontology design pattern views</article-title>
          . In: Ontology Engineering - 12th
          <source>International Experiences and Directions Workshop on OWL, OWLED</source>
          <year>2015</year>
          ,
          <article-title>co-located with ISWC 2015, Bethlehem</article-title>
          , PA, USA, October 9-
          <issue>10</issue>
          ,
          <year>2015</year>
          , Revised Selected Papers. pp.
          <volume>105</volume>
          {
          <issue>116</issue>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Pan</surname>
            ,
            <given-names>J.Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gomez-Perez</surname>
            ,
            <given-names>J.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ren</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Graph pattern based RDF data compression</article-title>
          .
          <source>In: Semantic Technology - 4th Joint International Conference, JIST</source>
          <year>2014</year>
          ,
          <string-name>
            <given-names>Chiang</given-names>
            <surname>Mai</surname>
          </string-name>
          , Thailand, November 9-
          <issue>11</issue>
          ,
          <year>2014</year>
          . Revised Selected Papers. pp.
          <volume>239</volume>
          {
          <issue>256</issue>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Radev</surname>
            ,
            <given-names>D.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Qi</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fan</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <article-title>Evaluating web-based question answering systems</article-title>
          .
          <source>In: Proceedings of the Third International Conference on Language Resources and Evaluation</source>
          ,
          <string-name>
            <surname>LREC</surname>
          </string-name>
          <year>2002</year>
          , May 29-31,
          <year>2002</year>
          ,
          <string-name>
            <given-names>Las</given-names>
            <surname>Palmas</surname>
          </string-name>
          , Canary Islands,
          <string-name>
            <surname>Spain</surname>
          </string-name>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Ritze</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meilicke</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Svab-Zamazal</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stuckenschmidt</surname>
          </string-name>
          , H.:
          <article-title>A pattern-based ontology matching approach for detecting complex correspondences</article-title>
          .
          <source>In: Proceedings of the 4th International Workshop on Ontology Matching (OM-</source>
          <year>2009</year>
          <article-title>) collocated with the 8th International Semantic Web Conference (ISWC-2009) Chantilly</article-title>
          , USA, October
          <volume>25</volume>
          ,
          <year>2009</year>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Ritze</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , Volker, J.,
          <string-name>
            <surname>Meilicke</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Svab-Zamazal</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>Linguistic analysis for complex ontology matching</article-title>
          .
          <source>In: Proceedings of the 5th International Workshop on Ontology Matching (OM-2010)</source>
          , Shanghai, China, November 7,
          <year>2010</year>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Suchanek</surname>
            ,
            <given-names>F.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Abiteboul</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Senellart</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          : Paris:
          <article-title>Probabilistic alignment of relations, instances, and schema</article-title>
          .
          <source>Proceedings of the VLDB Endowment</source>
          <volume>5</volume>
          (
          <issue>3</issue>
          ),
          <volume>157</volume>
          {
          <fpage>168</fpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Svab-Zamazal</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Svatek</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Towards ontology matching via pattern-based detection of semantic structures in owl ontologies</article-title>
          .
          <source>In: Proceedings of the Znalosti Czecho-Slovak Knowledge Technology conference</source>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Thieblin</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haemmerle</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hernandez</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trojahn</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Towards a complex alignment evaluation dataset</article-title>
          .
          <source>In: Proceedings of the 16th International Conference on Ontology Matching-Volume</source>
          <year>2032</year>
          .
          <article-title>CEUR-WS. org (</article-title>
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Varanka</surname>
            ,
            <given-names>D.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Usery</surname>
            ,
            <given-names>E.L.</given-names>
          </string-name>
          :
          <article-title>An applied ontology for semantics associated with surface water features</article-title>
          .
          <source>Land Use and Land Cover Semantics: Principles</source>
          ,
          <string-name>
            <given-names>Best</given-names>
            <surname>Practices</surname>
          </string-name>
          , and Prospects p.
          <volume>145</volume>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Vijayasankaran</surname>
          </string-name>
          , N.:
          <article-title>Enhanced place name search using semantic gazetteers (</article-title>
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>