<!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>Conceptual Models Search</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Syed Juned Ali</string-name>
          <email>syed.juned.ali@tuwien.ac.at</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Business Informatics Group</institution>
          ,
          <addr-line>TU Wien</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Conceptual Modeling</institution>
          ,
          <addr-line>Search Engine, Artificial Intelligence, Knowledge Graphs, Graph-based machine</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <abstract>
        <p>Conceptual modeling enables domain understanding and communication among stakeholders and is integral to realizing system requirements. Designing models from scratch can be tedious, even unnecessary and the knowledge from the existing models needs to be utilized to support the conceptual modelers and encourage collaborative learning. An eficient search engine is required to access and search information of interest by applying reasoning to the conceptual models. Conceptual models' structural and semantic information is not naturally applicable to reasoning and AI-enhanced semantic processing. Knowledge Graphs (KG) are an inference-based data structure for storing and reasoning knowledge. Knowledge Graphs benefit from AI-based methods, but such benefits are not directly applicable to conceptual models. This thesis aims to synergize conceptual modeling with the benefits of AI methods on Knowledge Graphs and asserts the validity and value of such a synergy by proposing a modeling language-agnostic KG-based search engine for conceptual models using graph-based machine learning.</p>
      </abstract>
      <kwd-group>
        <kwd>learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Conceptual modeling is a means to understand and communicate relevant aspects of a system or
domain by graphically mapping the domain semantics to the semantics of a modeling language.
Therefore, well-designed conceptual models and their encapsulated modeling practices are
essential to realizing system requirements. Designing models from scratch can be tedious
or even unnecessary. The availability of shared model knowledge provides opportunities for
reusing, adapting, and learning from already available models of high quality (F.A.I.R. principles
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]). Publicly available sources of models help create and connect communities of modelers
and provide a platform for collaborative learning and empirical research. Despite the discussed
benefits and the presence of some language- and domain-specific model repositories
we cannot profit from this plethora of knowledge without an eficient way of accessing and
searching on and within these models. A model search engine must aggregate data from various
sources and provide users with the most relevant models.
      </p>
      <p>
        Search engines in current modeling tools only provide narrow value because they are limited
to individual modeling languages, i.e., each search space is restricted to models represented in
one specific language. Moreover, current model similarity metrics are limited to the similarity
CEUR
Workshop
Proceedings
between search terms and the labels used for model elements (e.g., find all process models
having an activity entitled ‘submit application’). Search approaches with OCL-like queries [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ]
only select exact matches. Existing approaches are not useful in practice since they do not
provide access to a high number of diverse and public models. A further fundamental problem
when developing enterprise-wide knowledge management based on conceptual models, is the
scattered and heterogeneous nature of the relevant knowledge assets (i.e., models). Therefore
the knowledge encoded by the conceptual models is not fully utilized and aggregated in the
existing search approaches.
      </p>
      <p>Reasoning on the knowledge encoded in conceptual models is necessary to support search
based on user requirements; however, such knowledge is not naturally applicable to
reasoning. Ontologies are applied to improve the semantics of conceptual models, creating a more
sophisticated representation of the domain being modeled and a higher level of domain
understanding by its modeler users. This enables machine processing and reasoning based on formal
axioms. However, ontology-based reasoning lacks the utilization of the structural knowledge of
conceptual models, e.g., graph-based properties.</p>
      <p>
        Google introduced Knowledge Graphs (KG), which hugely improved google search capabilities
by aggregating information from various sources (e.g., World Factbook, Wikipedia, and Wikidata)
and utilizing the contextual information (cf. Latent Semantic Indexing[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]) of the query by
searching on entities, the meaning encoded by the entities and the relationships between
them 2. Using KG based search, a dissimilar appearing result might be relevant because of
the incorporation of the contextual information in the search criteria. E.g., a search result can
be highly relevant even if the result does not contain the query text but contains concepts
associated with the entities in the query. A summary of search engines for models by [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] shows
that the existing tools only focus on structure-based search. Therefore, a lack of conceptual
models search that utilizes contextual information of models and their elements and aggregates
data from various sources to search for relevant models (and not only structurally similar)
motivated us to represent conceptual models as a knowledge graph.
      </p>
      <p>
        Knowledge Graphs represent a collection of interlinked descriptions of entities – objects,
events, and concepts. KGs provide a foundation for data integration, fusion, analytics, and
sharing based on linked data and semantic metadata. Ontologies represent the formal semantics
or data schema of a KG and ensure a shared understanding of the data and its meanings [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
KGs can efectively organize and represent knowledge to be eficiently utilized by applying
diferent kinds of reasoning (e.g., rule-based and machine learning-based) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. The semantically
structured information in KGs provides essential solutions for many tasks, including question
answering, recommendation, and information retrieval [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Therefore KG-based representation
acts as an ideal intermediary data structure for capturing contextual information of the models
and its elements as well as allows data aggregation.
      </p>
      <p>Consequently, this thesis, on a high level, explores the benefits of applying AI-based methods
like graph-based machine learning to the KG representation of conceptual models. In order
to achieve this exploration, this thesis attempts to fill the gap of a conceptual model search
by, firstly, designing a generic KG transformation tool to create a representation that virtually
integrates the heterogeneous models using the domain, core, and foundational ontologies as a
2Google Knowledge Graph url: https://blog.google/products/search/introducing-knowledge-graph-things-not/
semantic backbone. This representation semantically links heterogeneous knowledge assets and,
during model search, acts as the context for the model and its elements to provide highly relevant
results. With the structural and semantic knowledge captured in the KG representation of a
conceptual model, this representation is then used as an input for the search engine workflow
to index, store, and search conceptual models based on diferent search criteria. The details of
the search engine are described in Section 4</p>
      <p>The remainder of this paper is structured as follows - Section 2 presents the related works.
Section 3 presents the research definition, laying out the objectives and hypotheses. Section 4
presents the approach for designing the semantic search engine with concrete steps involved
and Section 5 present the challenges involved. We conclude this paper with Section 6.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>In this section, first, we describe the works related to our KG-based conceptual model search
approach. Further, we describe the relationship between ontology and knowledge graphs with
conceptual modeling and how they relate to our model search proposal.</p>
      <p>
        Existing approaches - Basciani et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] show that the search facilities provided by existing
model repositories like GitHub, Gitlab, and GenMyModel 3 are typically keyword-based,
tagbased or there is no search facility at all. There have been eforts in achieving conceptual
model search, but several challenges remain. José and Jesús [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] introduce an approach of
storing graphs in the form of the possible paths between the nodes present in the graph. This
approach focuses on finding structurally similar results and does not consider the contextual
knowledge of the searched models. Search engines for individual languages like WebML, UML,
BPMN exist [
        <xref ref-type="bibr" rid="ref11 ref12 ref13">11, 12, 13</xref>
        ] however they are not eficient or scalable. MoScript [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] is proposed as
a model-independent tool for querying model repositories using OCL-like queries that only
retrieve exact models, and Kalnina et al. [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] present a tool for finding model fragments in
models. MOOGLE [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] is a generic search engine that performs text search, and the user can
specify the type of the desired model element to be returned. Further, these approaches lack the
usage of contextual knowledge associated with the models and their elements during the search.
In this thesis, the integration of ontologies acts as the semantic backbone of our approach and
provides the context for models during search.
      </p>
      <p>
        Ontology-based semantic enrichment - Ontology-driven conceptual modeling (ODCM)
extends or supports conceptual modeling techniques by ontological theories that further articulate
and formalize the conceptual modeling grammars of these modeling languages [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
Foundational ontologies like Bunge-Wand-Weber (BWW) and the Unified Foundational Ontology
(UFO) define a range of top-level domain-independent ontological categories, which form a
general foundation for more elaborated domain-specific ontologies [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Other approaches
define language profiles to extend existing conceptual modeling languages and thereby improve
the domain semantics [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. We use the existing techniques from ODCM to incorporate the
external semantics to enrich conceptual models.
      </p>
      <p>Knowledge Graphs and Conceptual models - In order to use the benefits of KGs, we present
a generic KG transformation of conceptual models. However, several works exist that focus on
creating KGs from conceptual models to utilize the benefits of KGs as the data model. Sun et
al. [19] propose a model-driven approach to automatically constructing KGs from relational
databases based on the Model Driven Architecture (MDA). Smajevic et al. [20] propose a CM2KG
framework to transform a generic model into a KG, however, lack ontological integration. Huang
et al. [21] propose methods to map data, information, and knowledge between class diagrams
and KGs bidirectionally and finally generate abstracted class diagrams automatically.</p>
      <p>
        KG embeddings are generated from KG using graph-based machine learning approaches, and
further, the similarity metrics are applied to the embeddings for downstream tasks like link
prediction, graph clustering, graph classification [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Thesis Scope Specification</title>
      <p>Conceptual models search attempts to mitigate the research gaps mentioned above by integrating
ontologies and AI reasoning on the KG representation of conceptual models. To conduct this
research, we will use Design Science Research [22]</p>
      <sec id="sec-3-1">
        <title>3.1. Research Objectives</title>
        <p>The objective of developing a search engine for conceptual models is divided into the following
clear research sub-objectives in order to streamline the research and eficiently develop and
evaluate the components of the search engine
RO-1 Design a generic transformation plugin that maps conceptual models of diferent
metametamodels like Ecore, Archimate to a KG by mapping the model and metamodel elements of a
conceptual model (entities and relationships) to the metamodel of a Knowledge Graph, thereby
creating a Conceptual Knowledge Graph (CKG). The plugin should support the integration
of semantics using external domain or foundational ontologies as well as from the results of the
graph and model analysis techniques. RO-1 focuses on creating a modeling language-agnostic
representation, i.e., CKG, to incorporate the structural and semantic properties that form the
contextual information for model and its elements during search.</p>
        <p>RO-2 Design a graph-based machine learning workflow for generating node, edge, and graph
embeddings for the CKGs such that the CKG is transformed into a vector space. The embedding
needs to capture structural and semantic information of the original CKG. RO-2 focuses on
encoding the CKG into feature vectors that are further used by similarity metrics to eficiently
compare vectors and thereby comparing graph components or entire graphs.
RO-3 Design a query language to support the modelers to search within the models based on
their requirements. For e.g., search all models with a specific EA smell like cyclic dependency
4. RO-3 provides the accessible interface to end-users to search models based on diferent
structural and semantic properties of models.</p>
        <p>RO-4 Design similarity metrics to support the diferent user-specific search criteria that produce
highly relevant results. RO-4 provides the means to achieve search based on diferent properties
by supporting suitable similarity metrics for particular search criteria, for e.g., SimRank [24] for
models with elements having neighbours having specific properties.
4Hacks et al. introduce the concept of EA Smells [23] analogous to Code Smells
RO-5 Finally, design a web-based tool to provide a user-friendly interface for the modelers to
use the advanced query language and search for models with specific requirements.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Hypotheses</title>
        <p>In order to assess the feasibility, accuracy, and performance of the research objectives, we define
the following hypotheses
H-1 The semantic and structural knowledge stored in a conceptual model can be represented as
a CKG, and external sources like foundational or domain ontologies or the results from graph
or model analysis can enrich the knowledge captured by the CKG.</p>
        <p>This hypothesis deals with the evaluation of RO-1. The evaluation will be achieved by
developing SPARQL queries that (i) validate the transformation of the original model’s graphical
structure to CKG (e.g., checking the number of nodes, edges, degree of nodes), (ii) validate model
and metamodel level properties on nodes and edges of CKG and, (iii) validate the domain, or
foundational ontology constructs integration into the CKG (e.g., checking that a model element
from health domain model is linked to an appropriate health ontology construct).
H-2 Machine learning trained CKG embeddings consisting of nodes, edges, and graph
embeddings reflect the structure and semantics of the CKG.</p>
        <p>This hypothesis deals with evaluating RO-2. In order to show search results based on the
context of the models and their consisting elements, this information needs to be reflected in
the embeddings. Vector space embeddings are feature vectors that capture the properties of the
elements of the CKG. Embeddings generation methods can be based on random walk [25] or
deep learning [26]. The embeddings will be evaluated based on the idea that embeddings of
nodes with similar properties should produce high similarity scores.</p>
        <p>H-3 The query language covers the search criteria to search for properties covering structural
and semantics knowledge within models.</p>
        <p>This hypothesis deals with the evaluation of RO-3 and focuses on evaluating and validating
the expressiveness of the query language. The evaluation needs to check if the requirements in
the query are translated to the search engine such that the search engine initiates a search on
the required parameters. The search query interface will support textual and graphical search
queries (see Fig. 3), and the query needs to be processed to extract the requirements or search
parameters.</p>
        <p>H-4 The search results reflect the search query requirements with good accuracy</p>
        <p>Finally, this hypothesis deals with evaluating RO-4. The search requirements trigger specific
similarity metrics based on search requirements/parameters to retrieve results based on high
similarity scores. The relevant results should have structurally similar models and models that
share elements with similar contexts, e.g., models with similar UML design patterns [27]. The
results are validated against a validation set of models for each search criteria, and the quality
of the results is verified using recall and precision on the dataset of models.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Proposed Search Solution</title>
      <p>In this section, we propose the framework that enables AI-based methods for the semantic
processing of conceptual models and an end-to-end conceptual models search workflow.</p>
      <sec id="sec-4-1">
        <title>4.1. CKG Construction Framework</title>
        <p>During the CKG construction phase, the naming and classification of objects, relations, and
properties found in conceptual models are mapped to nodes, edges, and properties in the
resulting CKG. Fig. 2 shows this mapping with links from the meta-metamodel, the metamodels
or ontologies, and the models to the CKG. The meta-metamodel and metamodel to CKG mapping
provide the initial schema for the CKG by forming its nodes and edges. The data attribute
associated with edges and nodes of the CKG holds necessary further knowledge. After encoding
the explicit semantics of conceptual models in the first step, the second step of the CKG
construction process enriches the initial CKG with external knowledge using ontologies (referred
to as Semantic Lifting [ 28]) or deriving latent knowledge from existing graph analysis or model
analysis techniques. SPARQL queries and graph algorithms agnostic to the modeling language
can be applied to CKGs for analyzing and extracting knowledge. For example, Cypher queries
have been applied to EA graphs to find EA smells [ 20] to enrich the graph with
languagedependent knowledge.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Conceptual Models Search Workflow</title>
        <p>We describe the end-to-end flow of the proposed search workflow. For querying conceptual
models, three means of defining a query seem promising: example-based (alternative 1a in Fig.
1), image-based (alternative 1b in Fig. 3), and keyword-based (alternative 1c in Fig. 3). The
knowledge about the metamodel is necessary before searching for a model. The metamodel
stores the metadata about the structural and semantic information of the knowledge
representation in a model on the type level. In alternatives 1b and 1c mentioned, the metamodel is not
defined in advance. [ 29] propose a machine learning-based approach for automatic classification
of the metamodel repositories [[30], p. 2] present an img2uml approach that extracts the Unified
Modeling Language (UML) diagram from an image. We propose to extend their work and create
an Img2CM framework for converting the image of several widely used conceptual models into
an XMI file.</p>
        <p>Once we have the XMI file, the conceptual model is transformed into a CKG enriched with
structural and semantic information from the conceptual model and integrated with external
sources of knowledge. The CKG is then transformed into a vector space by applying GNN
algorithms to generate node, edge, and graph embeddings. The GNN models are trained to
capture the CKG knowledge into the embeddings. The query language provides the modelers
with the interface to search models based on diferent user requirements. Similarity metrics
that combines structural and semantic information (e.g.,[31]) contained by the nodes in KGs
will provide relevant results. Therefore, advanced graph similarity metrics can identify graphs
similar to the input CKG by incorporating the contextual information of models and its elements
in the similarity criteria. Finally, the relevant results are shown in the web interface developed
to host the search engine.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Challenges</title>
      <p>
        Several challenges need to be handled in order to achieve the proposed objectives of this thesis
Ontology enrichment for diverse modeling languages - The CKG transformation is a
generic, language-agnostic solution which means the solution needs to be robust towards
diferent modeling languages, and the implementation of the plugins should not be biased
towards any modeling language. Our transformation is based on a generic CM2KG platform
[20], and we extend the platform towards enrichment. Inferring the applicable ontology to the
CKG is a challenge that must be tackled before ontology enrichment. The model’s domain can
support finding the applicable ontology, or using a unified foundational ontology with manual
intervention might be required for knowledge enrichment through ontology mapping.
Indexing Conceptual Models - Conceptual models contain relationships between entities
with semantics depending on the domain, the metamodel of the modeling language as well as
the modeler. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] apply some Natural Language Processing (NLP) techniques (for e.g., stemming,
stop words removal, tokenization) on the labels of the graph in their search process, but the
graph in the search query can have semantically similar predicates. If the search only captures
structural aspects of the graph, the search engine will not fetch graphs with semantically similar
relationships. The search engine should tackle a graph’s semantic similarity and elements by
incorporating the contextual information of element and graphs in the similarity metrics. E.g.,
graph embeddings should learn modeling patterns like ontology patterns [32], UML patterns
[27], and domain-specific patterns as part of the feature vector, which can be further used to
ifnd models with similar patterns.
      </p>
      <p>Embeddings of search query CKG - The conceptual model in the search query is first
transformed into a CKG and then into the graph embeddings, but it is not easy to directly get the
vector embeddings of this new graph because GNN was not trained on this new graph. [33]
presents an on-the-fly learning word embeddings method. In this research, we need to develop
an analogous method for graphs to generate graph embeddings on the fly and then apply
query-specific similarity metrics to retrieve relevant results.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion</title>
      <p>In this thesis proposal, we have proposed an AI-enhanced KG-based search engine for conceptual
modeling. The main objective of the thesis is to improve the existing conceptual model search
by incorporating contextual information about the model and its elements search. We propose
a Knowledge Graph-based approach to construct CKGs starting from conventional
(ontologydriven) conceptual models further enriched with external knowledge. The generated CKGs will
be trained using graph-based machine learning, and then the query language will be used to
query the huge corpus of models based on user requirements search criteria.</p>
      <p>The novelty of our research lies not only in the research questions we address – which are yet
uncovered but also in the innovative idea of facilitating the strengths of KGs and intertwining
them with the strengths of conceptual modeling. KGs initially virtually integrate heterogeneous
data sources. In this project, we enhance this concept by considering conceptual models as
the data to be integrated and linked. KGs further allow semantic similarity calculation (e.g.,
using the entities linked to the model elements) and structural similarity. We proposed the
research objectives of the thesis and presented the steps involved in realizing the solution based
on design science methodology.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgements</title>
      <p>This research has been partly funded by the Austrian Research Promotion Agency (FFG) via the
Austrian Competence Center for Digital Production (CDP) under the contract number 854187.
specific quality of conceptual schemas, in: Proceedings of the 10th Workshop on
DomainSpecific Modeling, 2010, pp. 1–6.
[19] S. Sun, F. Meng, D. Chu, A model driven approach to constructing knowledge graph
from relational database, in: Journal of Physics: Conference Series, volume 1584, IOP
Publishing, 2020, p. 012073.
[20] M. Smajevic, D. Bork, From conceptual models to knowledge graphs: a generic model
transformation platform, in: International Conference on Model Driven Engineering
Languages and Systems Companion, IEEE, 2021, pp. 610–614.
[21] L. Huang, Y. Duan, X. Sun, Z. Lin, C. Zhu, Enhancing uml class diagram abstraction
with knowledge graph, in: International Conference on Intelligent Data Engineering and
Automated Learning, Springer, 2016, pp. 606–616.
[22] A. Hevner, S. Chatterjee, Design science research in information systems, in: Design
research in information systems, Springer, 2010, pp. 9–22.
[23] S. Hacks, H. Höfert, J. Salentin, Y. C. Yeong, H. Lichter, Towards the definition of
enterprise architecture debts, in: 2019 IEEE 23rd International Enterprise Distributed Object
Computing Workshop (EDOCW), IEEE, 2019, pp. 9–16.
[24] M. Kusumoto, T. Maehara, K.-i. Kawarabayashi, Scalable similarity search for simrank, in:
Proceedings of the 2014 ACM SIGMOD international conference on Management of data,
2014, pp. 325–336.
[25] B. Perozzi, R. Al-Rfou, S. Skiena, Deepwalk: Online learning of social representations, in:
Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery
and data mining, 2014, pp. 701–710.
[26] S. Cao, W. Lu, Q. Xu, Deep neural networks for learning graph representations, in:</p>
      <p>Proceedings of the AAAI Conference on Artificial Intelligence, volume 30, 2016.
[27] R. B. France, D.-K. Kim, S. Ghosh, E. Song, A uml-based pattern specification technique,</p>
      <p>IEEE transactions on Software Engineering 30 (2004) 193–206.
[28] D. Karagiannis, D. Bork, W. Utz, Metamodels as a conceptual structure: some semantical
and syntactical operations, in: The Art of Structuring, Springer, 2019, pp. 75–86.
[29] P. T. Nguyen, J. Di Rocco, D. Di Ruscio, A. Pierantonio, L. Iovino, Automated classification
of metamodel repositories: A machine learning approach, in: 2019 ACM/IEEE 22nd
International Conference on Model Driven Engineering Languages and Systems (MODELS),
IEEE, 2019, pp. 272–282.
[30] B. Karasneh, M. R. Chaudron, Online img2uml repository: An online repository for uml
models., in: EESSMOD@ MoDELS, Citeseer, 2013, pp. 61–66.
[31] M. A. Alkhamees, M. A. Alnuem, S. M. Al-Saleem, A. M. Al-Ssulami, A semantic
metric for concepts similarity in knowledge graphs, Journal of Information Science (2021)
01655515211020580.
[32] R. d. A. Falbo, G. Guizzardi, A. Gangemi, V. Presutti, Ontology patterns: clarifying concepts
and terminology, in: Proceedings of the 4th Workshop on Ontology and Semantic Web
Patterns, volume 1188, 2013.
[33] D. Bahdanau, T. Bosc, S. Jastrzebski, E. Grefenstette, P. Vincent, Y. Bengio, Learning to
compute word embeddings on the fly, arXiv preprint arXiv:1706.00286 (2017).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Jacobsen</surname>
          </string-name>
          , R. de Miranda Azevedo,
          <string-name>
            <given-names>N.</given-names>
            <surname>Juty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Batista</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Coles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Cornet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Courtot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Crosas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumontier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. T.</given-names>
            <surname>Evelo</surname>
          </string-name>
          , et al.,
          <source>Fair principles: interpretations and implementation considerations</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J. Di</given-names>
            <surname>Rocco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. Di</given-names>
            <surname>Ruscio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Iovino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pierantonio</surname>
          </string-name>
          ,
          <article-title>Collaborative repositories in modeldriven engineering [software technology]</article-title>
          ,
          <source>IEEE Software 32</source>
          (
          <year>2015</year>
          )
          <fpage>28</fpage>
          -
          <lpage>34</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>W.</given-names>
            <surname>Kling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Jouault</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wagelaar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brambilla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Cabot</surname>
          </string-name>
          ,
          <article-title>Moscript: A dsl for querying and manipulating model repositories</article-title>
          ,
          <source>in: International conference on software language engineering</source>
          , Springer,
          <year>2011</year>
          , pp.
          <fpage>180</fpage>
          -
          <lpage>200</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>K.</given-names>
            <surname>Barmpis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kolovos</surname>
          </string-name>
          , Hawk:
          <article-title>Towards a scalable model indexing architecture</article-title>
          ,
          <source>in: Proceedings of the Workshop on Scalability in Model Driven Engineering</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>C. H.</given-names>
            <surname>Papadimitriou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Raghavan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Tamaki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vempala</surname>
          </string-name>
          ,
          <article-title>Latent semantic indexing: A probabilistic analysis</article-title>
          ,
          <source>Journal of Computer and System Sciences</source>
          <volume>61</volume>
          (
          <year>2000</year>
          )
          <fpage>217</fpage>
          -
          <lpage>235</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J. A. H.</given-names>
            <surname>López</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Cuadrado</surname>
          </string-name>
          ,
          <article-title>An eficient and scalable search engine for models</article-title>
          ,
          <source>Software and Systems Modeling</source>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>23</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Sequeda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Lassila</surname>
          </string-name>
          ,
          <article-title>Designing and building enterprise knowledge graphs</article-title>
          ,
          <source>Synthesis Lectures on Data, Semantics, and Knowledge</source>
          <volume>11</volume>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>165</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xiang</surname>
          </string-name>
          ,
          <article-title>A review: Knowledge reasoning over knowledge graph</article-title>
          ,
          <source>Expert Systems with Applications</source>
          <volume>141</volume>
          (
          <year>2020</year>
          )
          <fpage>112948</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zou</surname>
          </string-name>
          ,
          <article-title>A survey on application of knowledge graph</article-title>
          ,
          <source>in: Journal of Physics: Conference Series</source>
          , volume
          <volume>1487</volume>
          ,
          <string-name>
            <given-names>IOP</given-names>
            <surname>Publishing</surname>
          </string-name>
          ,
          <year>2020</year>
          , p.
          <fpage>012016</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>F.</given-names>
            <surname>Basciani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. Di</given-names>
            <surname>Rocco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. Di</given-names>
            <surname>Ruscio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Iovino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pierantonio</surname>
          </string-name>
          ,
          <article-title>Exploring model repositories by means of megamodel-aware search operators</article-title>
          .,
          <source>in: MoDELS (Workshops)</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>793</fpage>
          -
          <lpage>798</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>B.</given-names>
            <surname>Bislimovska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bozzon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brambilla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Fraternali</surname>
          </string-name>
          ,
          <article-title>Textual and content-based search in repositories of web application models, ACM Transactions on the Web (TWEB) 8 (</article-title>
          <year>2014</year>
          )
          <fpage>1</fpage>
          -
          <lpage>47</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>P.</given-names>
            <surname>Gomes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. C.</given-names>
            <surname>Pereira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Paiva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Seco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Carreiro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. L.</given-names>
            <surname>Ferreira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bento</surname>
          </string-name>
          ,
          <article-title>Using wordnet for case-based retrieval of uml models</article-title>
          ,
          <source>AI</source>
          Communications
          <volume>17</volume>
          (
          <year>2004</year>
          )
          <fpage>13</fpage>
          -
          <lpage>23</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>R.</given-names>
            <surname>Dijkman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>García-Bañuelos</surname>
          </string-name>
          ,
          <article-title>Graph matching algorithms for business process model similarity search</article-title>
          , in: International conference on business process management, Springer,
          <year>2009</year>
          , pp.
          <fpage>48</fpage>
          -
          <lpage>63</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>E.</given-names>
            <surname>Kalnina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sostaks</surname>
          </string-name>
          ,
          <article-title>Towards concrete syntax based find for graphical domain specific languages</article-title>
          ,
          <source>in: 2019 ACM/IEEE 22nd International Conference on Model Driven Engineering Languages and Systems Companion</source>
          <volume>(</volume>
          <string-name>
            <surname>MODELS-C)</surname>
          </string-name>
          , IEEE,
          <year>2019</year>
          , pp.
          <fpage>236</fpage>
          -
          <lpage>242</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>D.</given-names>
            <surname>Lucrédio</surname>
          </string-name>
          ,
          <string-name>
            <surname>R. P. de M Fortes</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Whittle</surname>
          </string-name>
          ,
          <article-title>Moogle: a metamodel-based model search engine</article-title>
          ,
          <source>Software &amp; Systems Modeling</source>
          <volume>11</volume>
          (
          <year>2012</year>
          )
          <fpage>183</fpage>
          -
          <lpage>208</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Verdonck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Gailly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Pergl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Guizzardi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Martins</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Pastor</surname>
          </string-name>
          ,
          <article-title>Comparing traditional conceptual modeling with ontology-driven conceptual modeling: An empirical study</article-title>
          ,
          <source>Information Systems</source>
          <volume>81</volume>
          (
          <year>2019</year>
          )
          <fpage>92</fpage>
          -
          <lpage>103</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>G.</given-names>
            <surname>Guizzardi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Wagner</surname>
          </string-name>
          ,
          <article-title>A unified foundational ontology and some applications of it in business modeling</article-title>
          .,
          <source>in: CAiSE Workshops (3)</source>
          ,
          <year>2004</year>
          , pp.
          <fpage>129</fpage>
          -
          <lpage>143</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>F.</given-names>
            <surname>Gailly</surname>
          </string-name>
          , G. Poels,
          <article-title>Conceptual modeling using domain ontologies: Improving the domain-</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>