<!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>Harold: an Iterative and Interactive Query System for Exploring Cultural Heritage Corpus</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Prunelle D. Treuil</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Olivier Bruneau</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jean Lieber</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Emmanuel Nauer</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Laurent Rollet</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>AHP-PReST, Université de Lorraine, Université de Strasbourg</institution>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>LORIA CNRS/INRIA/Université de Lorraine</institution>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>With the development of Semantic Web technologies in digital humanities, more and more users with little knowledge about these technologies need to interact with them. This paper presents Harold, a system for accessing the cultural heritage corpus without having to know any particular computer language, such as SPARQL. Harold is a conversational system with which a historian can interact using a user-friendly query interface together with navigation access to explore the corpus. Harold organizes the documents into a hierarchical structure using formal concept analysis (FCA) to provide a synthetic way to navigate the documents. The user may interact with the hierarchy concepts to focus on relevant documents and remove irrelevant ones. In addition, an ontology management interface is provided to assist the user in managing concepts related to their research problem. This ontology can be used by the retrieval process to better structure hierarchical access to the documents. Moreover, the concepts built by FCA provide interesting information that can guide the user to a new retrieval step to find more relevant documents related to their research problem.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Ontology management</kwd>
        <kwd>Conversational system</kwd>
        <kwd>Formal Concept Analysis</kwd>
        <kwd>Cultural Heritage Collection</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>This paper presents Harold, a conversational system that helps to explore textual corpora, such as
the correspondence of Henri Poincaré. Currently developed in collaboration with the Henri Poincaré
Archives, the system enables interactive exploration of the digitized and annotated correspondence
using the Archives’ SPARQL endpoint. The Henri Poincaré Archives, a center for the history and
philosophy of science, holds parts of the personal papers of various mathematicians and computer
scientists. This includes more than 2, 000 letters exchanged by Henri Poincaré, now digitized, manually
transcribed and enriched with metadata by the historians of the Archives. A key figure in mathematics,
physics and philosophy of science, the Henri Poincaré (1854-1912) correspondence ofers valuable
insight into his scientific activities and exchanges with fellow researchers of his time. Although the
SPARQL endpoint supports advanced queries into the knowledge graph and ontologies developed at
the Archives, it remains a challenge for non-experts, hence the need for an accessible interface like
Harold. Even if Harold is originally developed for the Henri Poincaré Archives, it will be tested on
other corpora as researchers working on other digital humanities corpora have expressed interest in
this tool. This would allow us to test Harold on new ontologies and knowledge graphs with diferent
vocabularies.</p>
      <p>
        To simplify access to a corpus without requiring SPARQL queries, the Harold system ofers a more
user-friendly interface. This work addresses three key aspects: (1) Historical research questions are often
vague and cannot be answered with a single query, for example “What has Henri Poincaré exchanged
about mathematics for physics?”. Harold supports an iterative interactive exploration using FCA [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ],
allowing users to refine their search by grouping letters according to shared properties. (2) Beyond
basic metadata (sender, recipient, date, etc.), the content of the letters is crucial. NLP techniques are
used to extract significant terms (e.g. single terms, nominal groups, named entities) from the full text.
These terms serve as additional semantic properties for exploration. (3) Historical research also involves
domain knowledge. Harold lets users build and manage an ontology, using NLP-extracted terms as
candidate concepts. Harold utilizes the ontology to generalize term annotations by associating letters
with broader conceptual categories. This enhances both the hierarchical structuring of the corpus
and the retrieval process, allowing queries on general terms to also return letters containing more
specific related terms. Harold uses the ontology to associate letters with broader terms, improving
both hierarchical organization and retrieval by gathering letters using more general concepts or more
specific concepts. For example, if the user has indicated that the physics concept is more general than
the heat propagation concept, then every time the letters about physics are searched, the ones about
heat propagation can also be retrieved. This dynamic interaction between the user, the corpus, and
the ontology supports knowledge discovery.l research problem involves knowledge about the research
topic.
      </p>
      <p>The paper is organized as follows. Section 2 presents the related work: solutions allowing
nonspecialists to interact with ontologies, as well as the use of FCA in document access. Section 3 describes
preliminaries: the letters of the Henri Poincaré correspondence, the general ontology used to annotate
the letters, and the FCA theory. Section 4 presents the Harold system: the NLP extraction process to
enrich the letter annotations by their content and shows the main functionalities of the Harold system
illustrated by a running example. Section 5 describes the ontology management tool of the system.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related work</title>
      <p>
        Numerous works address the problem of interrogating knowledge base, especially represented in RDF
or accessible through a SPARQL endpoint. A classification of approaches that address this problem,
from the most informal (natural language) to the most formal (SPARQL), can be found in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Some
works focus on the transformation of the problem, given in natural language, into SPARQL queries.
Diefenbach et al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] present a survey on systems that address question answering (QA) problems. The
question, given in natural language, has to be solved by searching the answer in an RDF knowledge base.
These systems use diferent NLP techniques, most of the time named entity recognition, part-of-speech
tagging, and dependency analysis to translate a natural language query into a SPARQL query. For
example, in the SWIP system [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], a first step consists of identifying terms in the question related to
classes and instances of the knowledge base and, according to the query patterns, generating a SPARQL
query. More recent works have focused on using deep learning QA techniques, mainly Large Language
Models (LLMs) to answer questions directly written in natural language. Biancofiore et al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] propose
a survey on interactive QA and Zaib et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], a survey on conversational QA. Both highlight that QA
in several steps allows the system to better understand the question in natural language and its context.
Finally, Lan et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] diferent QA techniques on knowledge bases with queries in natural language.
      </p>
      <p>
        As query patterns are represented in an ontology, the transformation from a question in natural
language to a SPARQL query also uses SPARQL for mapping some part of the text of the question with
knowledge base resources. Other works propose to use specific user interfaces to query knowledge
bases without directly writing a SPARQL query. For example, Sparklis proposes an interface that assists
the user in constructing the SPARQL query [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In Sparklis, the construction is based on forms in
which the user will progressively select classes, relations, and values from a selected knowledge base.
This selection is transformed both into an SPARQL query and, to give feedback to the user, in natural
language, to be sure that the interaction with the system has conduct to the creation of a SPARQL query
corresponding to the user question.
      </p>
      <p>
        Other systems propose to use a visual query language. In Nitelight, for example, the query takes
the form of a graph and the user has to construct the graph corresponding to the query [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Finally,
some works propose specific interfaces dedicated to the knowledge base to query, in particular, the
works already done on the exploitation of the Henri Poincaré correspondence. In addition to proposing
a dedicated form to query and navigate the correspondence, other search functionalities are available,
such as a similarity search based on letter metadata and generalization rules [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], and approximate
search by transformation of SPARQL queries to produce new SPARQL queries close to the initial query
of the user [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>
        Another point addressed in this work relies on a synthetic access instead of an individual letter access,
and the fact that a research problem required many steps and therefore interaction with the search
system. The work presented in this paper is inspired by the CreChainDo system [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], an iterative
and interactive information retrieval system that organizes google web answers using formal concept
analysis (FCA). As FCA provides a natural way to organize objects according to their properties (see
Section 3.2), FCA is used to organize answers provided by a search engine in a hierarchy. Navigation in
the hierarchy helps the user explore a structured and synthetic result, and the user can interact with the
result to indicate concepts that are relevant or irrelevant for a given information retrieval task. These
user choices have an impact on the hierarchy: some concepts are removed if they are irrelevant, and
new ones appear by triggering additional web queries about relevant concepts.
      </p>
      <p>
        Finally, the ontology building process presented in this paper is inspired by some of the many
approaches that can be found in the literature (see [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] for a survey of ontology learning techniques).
The ontology building is helped by candidate concepts resulting from an NLP process associated with the
use of FCA to highlight frequent terms. So, it addresses four layers of the “Ontology Learning Layer Cake”
proposed in [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]: identifying terms, identifying synonyms (this is not detailed in this paper), identifying
concepts, and organizing concepts into a concept hierarchy. The ontology building process proposed
in this work also relies on [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] for the interactive and interactive approach. Even if our objective in
this work is not to build concept definitions as in [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], we share the idea of progressively building the
ontology thanks to a sequence of steps guided by the domain expert who provides additional useful
knowledge, in a given step, to find other relevant knowledge pieces (new concepts related to their
research problem) in the next step.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Preliminaries</title>
      <sec id="sec-3-1">
        <title>3.1. The Henri Poincaré corpus and ontology</title>
        <p>The Henri Poincaré correspondence corpus includes more than 2000 letters exchanged with more
than 300 correspondents in five languages (mainly French with sporadic use of English, German, Sami,
and Swedish), written between his entry to the École polytechnique in 1873 and his death in 1912.
These documents have been digitized, manually transcribed, and semantically annotated with general
metadata and contextual footnotes, forming the corpus’s critical apparatus, through over 30 years of
historical work.</p>
        <p>
          The letters are available in three formats: thematic printed volumes [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], a website1 using the content
management system for cultural heritage collection Omeka S [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], and a SPARQL endpoint (login
required). The website ofers a basic keyword search over raw text, without support for complex
queries. The SPARQL endpoint enables precise access to the knowledge base but requires familiarity
with SPARQL and its underlying vocabulary. The Henri Poincaré ontology, developed by the Henri
Poincaré Archives, organizes all metadata related to the correspondence. It includes properties for
describing the letters, correspondents, archival information (e.g. storage, copyrights) and publications
(e.g., books, articles). If the ontology also covers other documents related to Poincaré’s life, such as
scientific articles, books, and theses, only his letters are used by Harold.
        </p>
        <p>Each letter is described by semantic annotations using RDF triples, as illustrated in Fig. 1. The triples
use properties of the Henri Poincaré ontology (ahpo prefix), such as the sender ( ahpo:sentBy), the
recipient (ahpo:sentTo), the language (ahpo:language), the date (ahpo:writingDate), and the
written place (ahpo:writtenAt).</p>
        <sec id="sec-3-1-1">
          <title>Paris "Henri Poincaré à Eugénie Poincaré - août 1876" 1876-08</title>
          <p>ahpo:writtenAt
ahpo:sentBy
ahpo:language
Letter_73
d
c
:
t
i
t
l
e
...
ahpo:writingDate
ahpo:sentTo</p>
        </sec>
        <sec id="sec-3-1-2">
          <title>Eugénie Poincaré ... Henri Poincaré French</title>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Formal concept analysis</title>
        <p>
          FCA is a mathematical approach to data analysis based on lattice theory. A formal context is a triple
 = (, , ), where  is a set of individuals (called objects),  is a set of properties (called attributes)
and  is the relation on  ×  stating that an object is described by a property [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. Table of Fig. 2 (a)
gives an example of context:  is a set of 6 letters (l1,...,l6) and  is the set of properties composed of
6 terms and 1 recipient annotating the letters. A formal concept is a pair (, ), where  is a maximal
set of individuals (called extent) and  is a maximal set of properties (called intent) shared by this extent.
For example, ({physics, differential equation}, {l1, l4}) is a concept.
        </p>
        <p>
          Furthermore, the set  of all formal concepts of the context  = (, , ) is partially ordered
by extent inclusion, also called specialization (denoted by ≤ ) between concepts. ℒ = ⟨, ≤ ⟩ is a
complete lattice, called the concept lattice. The lattice ℒ can be drawn as a Hasse diagram where the
nodes are concepts and the arrows are specialization links. Fig. 2 illustrates a binary context (a) and its
corresponding lattice (b). The top concept contains all the letters; its intent is empty because there is no
common property shared by all the letters. In contrast, the bottom concept is defined by the set of all
properties, and its extent is empty because none of the letters is described by all the properties. Several
algorithms have been proposed for the construction of concept lattices; see [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. For Harold, coron
is used,2 where coron is a software platform that implements a wide set of algorithmic methods for
symbolic data mining, including concept lattice construction algorithms [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ].
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. The Harold system</title>
      <p>The Harold system helps historians explore the Henri Poincaré correspondence by retrieving letters,
analyzing their content, and acquiring knowledge. An NLP step for term identification in full texts
enables the exploitation of both the letters’ content and their critical apparatus. Section 4.1 details
the annotation process, while Section 4.2 introduces a running example, followed by descriptions and
illustrations of Harold’s functionalities.</p>
      <sec id="sec-4-1">
        <title>4.1. Exploiting full texts using NLP</title>
        <p>Historians analyzing the Henri Poincaré correspondence require analysis of both the full text and the
critical apparatus, not just basic metadata. To enable this, terms were extracted from each letter and
its critical apparatus using both a preexisting list of key terms and automatic noun phrase extraction.
Scientific terms, including those of institutes such as Nobel committees, are primarily identified through
noun phrases, while terms from Henri Poincaré ’s social environment, such as polytechnic slang,
contain only one word. This list, curated by historians, is crucial as many terms have context-dependent
meanings (e.g., "rat" refers to being late, not the animal). In addition, a list of cultural and scientific
works cited in the letters is also maintained. All the terms extracted are kept in their original language,
with spelling errors and abbreviations, the historians having the possibility to indicate all the variations
of a given term.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Running example</title>
        <p>As a running example, consider studying the impact of Henri Poincaré’s work on physics research.
The historian can use Harold to search for letters exchanged with physicists Henri Poincaré knew or
containing keywords related to mathematical physics (e.g., general terms: mathematics, physics, or
more precise concepts: diferential equation , three-body problem). Solving this research problem requires
multiple searches and content analysis. Based on the initial results, the historian can refine the searches
with more specific terms or exclude irrelevant results. As they explore the letters, some knowledge can
emerge within the search scope, particularly the vocabulary (i.e. terms) and concepts. Organizing these
concepts in an ontology can enhance and refine the search process.</p>
        <p>Section 4.3 presents the search form used to explore the corpus. In Section 4.4, the way the results
are displayed is explained. Section 4.5 illustrates diferent types of interactions with Harold and shows
the benefit of an interactive and interactive exploration process.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Searching letters by properties</title>
        <p>Harold allows to search, in the Henri Poincaré correspondence, letters that have some properties using
a specific search form. This form also allows us to indicate which properties must be taken into account
by the FCA using checkboxes. For example, a historian can indicate that they are interested in knowing
who exchanged on a given subject (i.e., Sender and Recipient properties) and what terms appear
in both the letters and their critical apparatus (Containing properties). The content of this form is
transformed into a SPARQL query to search for letters that have the desired properties. This query
simply filters all letters with respect to the given criteria and retrieves the properties chosen
by the user. Finding all relevant letters in a single attempt is rare, requiring iterative interaction
between the user and the system. Harold dynamically manages the set of letters used by FCA, which
evolves by adding relevant letters through new queries or removing those irrelevant to the current
research problem. In the interface, Starting a new search creates a new set, while Complete the current
search adds new letters to the existing set.</p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Visualizing the results</title>
        <p>Instead of simply listing the retrieved letters, Harold applies FCA to group them based on the selected
properties, creating a synthetic view that highlights the shared characteristics (see Section 3.2). The
resulting lattice is hierarchically displayed using depth-first search, as shown in Fig. 3. The sign µ
expands the groups to show subgroups, while · collapses them. Each subgroup only displays properties
not inherited from broader groups. For example, in Fig. 3, the 18 letters sent to Physics Nobel Committee
also contain physique mathématique. The group size, set to 5, is adjustable by the user.</p>
        <p>In this illustration, it can be seen, from the 39 letters containing physique mathématique, that 18
of these letters have been sent to the Nobel Physics Committee. Some potentially interesting terms
for the research problem also appear: dérivées partielles de la physique mathématique (in English,
partial derivatives of mathematical physics), propagation de la chaleur (in English, heat propagation), and
problème de Dirichlet (in English, Dirichlet problem).</p>
      </sec>
      <sec id="sec-4-5">
        <title>4.5. Interacting with the results</title>
        <p>To find all letters related to the topic “Mathematics for physics”, a search for physique mathématique
alone is insuficient, as many letters do not contain this exact phrase; Harold’s interactive features allow
the user to refine searches, add relevant letters, or exclude irrelevant ones, thereby improving FCA
results. As shown in Fig. 4, several actions are available for each letter group (here the 18 letters sent to
the Physics Nobel Committee), the first three for letter analysis, then one for ontology management (see
Section 5), and the last one for accessing the letters themselves.
• Add the letters sent to the Physics Nobel Committee: This functionality aims to retrieve additional
relevant letters. For example, the user might want to explore the letters sent to the Physics Nobel
Committee to investigate their connection to mathematics for physics. Triggering this action adds
these letters to the analysis set, similar to entering Physics Nobel Committee into the recipient
ifeld and clicking Complete the current search.
• Do not use “sent to the Physics Nobel Committee” in the result: This functionality excludes certain
properties of FCA grouping to refine hierarchical results by removing irrelevant letter groups.
For example, in the running case, it is applied to the sent to Physics Nobel Committee group, which
is relevant to the research, but could also be used to exclude irrelevant groups such as sent by or
sent to Henri Poincaré.
• Remove letters sent to the Physics Nobel Committee: This functionality eliminates letters not
interesting at all for the research problem. For the running example, removing the letters sent to
this institute is not adequate but sometimes letters which are not helpful for a given research
problem appear and this is this functionality that allows removing them from the analysis.
• Add the concept “Physics Nobel Committee” to the ontology: This functionality helps the user to
acquire knowledge of the content of the letter. The term Physics Nobel Committee is added to
the set of unlabeled concepts of the ontology management interface, waiting to be placed in the
ontology hierarchy, in this case under the concept institut (see Fig. 5).</p>
        <p>The next section details the ontology management and its impact on the results.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Ontology management</title>
      <p>The ontology interface allows for the manual creation of an ontology. It currently manages only atomic
concepts and their relations. As shown in Fig. 5, it has two main parts: a Set of unclassified concepts ,
containing candidate concepts added by the user or retrieved from the Add to the ontology functionality,
and a Set of classified concepts , organized hierarchically. For instance, Physics Nobel Committee is in the
unclassified set, while the classified set includes mathématiques with 4 children in the hierarchy, physique
with 3 children, and institut with 3 children. The hierarchy reflects specific/generic relationships between
letters. This means that if fonction is a child of mathématiques in the hierarchy, it has to be interpreted
as “a letter annotated by fonction will also be annotated by mathématiques.” Formally, using description
logic notation, this means that the following formula is added to the ontology:
Letter ⊓ ∃isAnnotatedBy.{"fonction"} ⊑ Letter ⊓ ∃isAnnotatedBy.{"mathématiques"}
Hierarchy management, including moving concepts, is done by drag-and-drop. Here Physics Nobel
Committee can be moved under institut (in English institute).</p>
      <p>This hierarchy is used to improve the FCA process by enriching the binary context with new
letter properties. For example, if letter l12 has the property fonction then it has also the property
mathématiques. Thus, the historian obtains a more structured result than without this hierarchy. For
example, letters containing propagation de la chaleur or théories électrodynamiques are linked to physique,
creating a group of letters about physics (see Fig. 6). Similarly, a group of 40 letters related to both
mathématiques and physique is formed, even if they do not contain these exact terms but include related
concepts. Furthermore, using the ontology in the search process ensures that entering physique retrieves
letters associated with the physique part of the ontology.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Discussion and conclusion</title>
      <p>This paper presented Harold, an iterative and interactive system for exploring the Henri Poincaré
correspondence without requiring knowledge of semantic web technologies. The system enables
analysis of both metadata and full text, using FCA to group letters by shared properties. Ontology
management, integrated with the exploration system, enhances knowledge discovery by organizing
properties hierarchically, which improves both letter organization and retrieval.</p>
      <p>The principles used to explore the Henri Poincaré correspondence are applicable to other corpora
or data types. An ongoing application of Harold focuses on analyzing computer science publications,
particularly in areas such as semantic web, ontology building, and digital humanities, with metadata
including authors, publication venue, year, keywords, and for textual data, titles, and abstracts. Future
work includes evaluating the system by comparing the results of two historians working on the same
research problem, one using Harold and the other not, focusing on coverage, letter retrieval, and new
knowledge acquired. Another focus is improving ontology management, including (1) incorporating
various relationships between concepts, (2) refining the handling of letter properties (e.g., exchange
with being more general than sent to), and (3) managing concept definitions (e.g., defining Henri
Poincaré’s study years as between 1873 and 1879).</p>
      <p>As Harold is still under development, a proper evaluation has to be performed. It would be necessary
to compare how two Henri Poincaré specialists conduct research on a given topic with or without
Harold. It should be done in a limited time frame and with the same research question for both historians.
The set of letters selected by each researcher would then be analyzed, as only the historian using Harold
would have built an ontology. Feedback from these researchers on Harold would also be insightful.
Providing public access to an instance of Harold using the Henri Poincaré correspondence or other
corpora could allow more people to test the system in the future.</p>
    </sec>
    <sec id="sec-7">
      <title>Declaration on Generative AI</title>
      <p>The author(s) have not employed any Generative AI tools.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>B.</given-names>
            <surname>Ganter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Wille</surname>
          </string-name>
          ,
          <source>Formal Concept Analysis: Mathematical Foundations</source>
          , Springer, Berlin,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>E.</given-names>
            <surname>Kaufmann</surname>
          </string-name>
          , A. Bernstein,
          <article-title>Evaluating the usability of natural language query languages and interfaces to semantic web knowledge bases</article-title>
          ,
          <source>Journal of Web Semantics</source>
          <volume>8</volume>
          (
          <year>2010</year>
          )
          <fpage>377</fpage>
          -
          <lpage>393</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Diefenbach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lopez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Maret</surname>
          </string-name>
          ,
          <article-title>Core techniques of question answering systems over knowledge bases: a survey</article-title>
          ,
          <source>Knowledge and Information Systems</source>
          <volume>55</volume>
          (
          <year>2018</year>
          )
          <fpage>529</fpage>
          -
          <lpage>569</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>C.</given-names>
            <surname>Pradel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Haemmerlé</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Hernandez</surname>
          </string-name>
          ,
          <article-title>Swip: A natural language to SPARQL interface implemented with SPARQL</article-title>
          , in: N.
          <string-name>
            <surname>Hernandez</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Jäschke</surname>
          </string-name>
          , M. Croitoru (Eds.),
          <source>Graph-Based Representation and Reasoning</source>
          , Springer International Publishing, Cham,
          <year>2014</year>
          , pp.
          <fpage>260</fpage>
          -
          <lpage>274</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>G. M.</given-names>
            <surname>Biancofiore</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Deldjoo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. D.</given-names>
            <surname>Noia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. Di</given-names>
            <surname>Sciascio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Narducci</surname>
          </string-name>
          ,
          <article-title>Interactive question answering systems: Literature review</article-title>
          ,
          <source>ACM Comput. Surv</source>
          .
          <volume>56</volume>
          (
          <year>2024</year>
          )
          <volume>239</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>239</lpage>
          :
          <fpage>38</fpage>
          . doi:
          <volume>10</volume>
          .1145/3657631.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Zaib</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. E.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. Z.</given-names>
            <surname>Sheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mahmood</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Zhang,</surname>
          </string-name>
          <article-title>Conversational question answering: a survey</article-title>
          ,
          <source>Knowledge and Information Systems</source>
          <volume>64</volume>
          (
          <year>2022</year>
          )
          <fpage>3151</fpage>
          -
          <lpage>3195</lpage>
          . doi:
          <volume>10</volume>
          .1007/ s10115-022-01744-y.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lan</surname>
          </string-name>
          , G. He,
          <string-name>
            <given-names>J.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-R.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <article-title>Complex knowledge base question answering: A survey</article-title>
          ,
          <year>2022</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2108.06688.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>E.</given-names>
            <surname>Hyvönen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ferré</surname>
          </string-name>
          ,
          <string-name>
            <surname>Sparklis:</surname>
          </string-name>
          <article-title>An expressive query builder for SPARQL endpoints with guidance in natural language</article-title>
          ,
          <source>Semantic Web</source>
          <volume>8</volume>
          (
          <year>2016</year>
          )
          <fpage>405</fpage>
          -
          <lpage>418</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Russell</surname>
          </string-name>
          , P. Smart,
          <article-title>NITELIGHT: A Graphical Editor for SPARQL Queries</article-title>
          , in: 7th
          <source>International Semantic Web Conference (ISWC</source>
          <year>2008</year>
          ), Poster,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>N.</given-names>
            <surname>Lasolle</surname>
          </string-name>
          ,
          <article-title>A Navigation Tool for Exploring Semantic Web Corpora</article-title>
          ,
          <source>in: Proceedings of the ISWC 2021 Posters, Demos and Industry Tracks</source>
          , Virtual conference, France,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>O.</given-names>
            <surname>Bruneau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Lasolle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lieber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Nauer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pavlova</surname>
          </string-name>
          , L. Rollet,
          <article-title>Applying and developing semantic web technologies for exploiting a corpus in history of science: The case study of the Henri Poincaré correspondence</article-title>
          ,
          <source>Semantic Web</source>
          <volume>12</volume>
          (
          <year>2021</year>
          )
          <fpage>359</fpage>
          -
          <lpage>378</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>E.</given-names>
            <surname>Nauer</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Toussaint,</surname>
          </string-name>
          <article-title>CreChainDo: an iterative and interactive web information retrieval system based on lattices</article-title>
          ,
          <source>International Journal of General Systems</source>
          <volume>38</volume>
          (
          <year>2009</year>
          )
          <fpage>363</fpage>
          -
          <lpage>378</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>M. N.</given-names>
            <surname>Asim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wasim</surname>
          </string-name>
          , M. U. G. Khan,
          <string-name>
            <given-names>W.</given-names>
            <surname>Mahmood</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. M.</given-names>
            <surname>Abbasi</surname>
          </string-name>
          ,
          <article-title>A survey of ontology learning techniques and applications</article-title>
          , Database:
          <source>The Journal of Biological Databases and Curation</source>
          <year>2018</year>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>P.</given-names>
            <surname>Buitelaar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cimiano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Magnini</surname>
          </string-name>
          ,
          <source>Ontology Learning from Text: An Overview</source>
          , volume
          <volume>123</volume>
          , IOS Press, Amsterdam,
          <year>2005</year>
          , pp.
          <fpage>3</fpage>
          -
          <lpage>12</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>M. D</surname>
          </string-name>
          <article-title>'aquin, TaBIIC: Taxonomy Building through Iterative and Interactive Clustering, in: Formal Ontology in Information Systems</article-title>
          , IOS Press,
          <year>2023</year>
          , pp.
          <fpage>155</fpage>
          -
          <lpage>168</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>P.</given-names>
            <surname>Nabonnand</surname>
          </string-name>
          ,
          <source>La Correspondance entre Henri Poincaré et Gösta Mittag-Lefler, Publication des Archives Henri Poincaré</source>
          , Birkhäuser Basel,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>J.-M. Meunier</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Szoniecky</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Berthereau</surname>
          </string-name>
          ,
          <article-title>Utilisation d'Omeka-S pour la conception et le partage de ressources pédagogiques</article-title>
          , in: Zotero &amp;
          <article-title>Omeka-des outils pour les humanités numériques</article-title>
          , Poitiers, France,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>L.</given-names>
            <surname>Szathmary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <article-title>CORON: A framework for levelwise itemset mining algorithms</article-title>
          ,
          <source>Supplementary Proceedings of The Third International Conference on Formal Concept Analysis (ICFCA '05)</source>
          , Lens, France (
          <year>2005</year>
          )
          <fpage>110</fpage>
          -
          <lpage>113</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>