<!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>Using Polyadic Formal Contexts for Information Extraction from Natural Language Texts</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Saint-Petersburg State University</institution>
          ,
          <addr-line>11 Univeritetskaya emb., Saint-Petersburg</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Tula State University</institution>
          ,
          <addr-line>92 Lenin ave., Tula</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <fpage>0000</fpage>
      <lpage>0001</lpage>
      <abstract>
        <p>The paper considers the use of elements of Formal Concept Analysis - multidimensional or polyadic formal contexts - to extract information from natural language texts. We propose the method for constructing polyadic formal contexts by means of Semantic Role Labeling and Abstract Meaning Representation (AMR) of texts. Using semantic role labeling, a conceptual graph is created for each sentence of the text, and a specific scheme of abstract meaning representation of the sentence is developed based on its elements. The polyadic formal context is a multidimensional tensor, whose points are elements of an AMR scheme. To extract information from a polyadic formal context, data associations as sub-contexts of the original context are built. Each such subcontext is associated with a specific element of the AMR scheme. Queries to associations return responses that preserve the meaning of the phrases according to the AMR scheme. The method was tested in the task of finding dependencies between texts on the corpus of abstracts of scientific articles on biomedical subjects of the PubMed system.</p>
      </abstract>
      <kwd-group>
        <kwd>Information retrieval</kwd>
        <kwd>Polyadic formal context</kwd>
        <kwd>Abstract Meaning Representation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>The current state of the Computational Linguistics is characterized by the active
involvement of mathematical methods of Data Analysis: methods of machine learning,
algebraic methods, and methods of graph theory. Such synthesis is doubly useful. On
the one hand, it allows in some cases to define objects used in computational
linguistics in a new way and also to offer new solutions in Natural Language Processing. On
the other hand, the applications of these methods in specific tasks enrich the methods
themselves, opening up new areas of development in them. These observations prove
to be true in relation to experimental material involved in our study. In it we apply the
Formal Concept Analysis (FCA), a mathematically rigorous theory of conceptual
modeling, and its main object, the formal context, which in some sense generalizes
the concept of context in linguistics. In this paper we prove that clustering used in the
Formal Concept Analysis (FCA-clustering) is ineffective in the tasks of extracting
information from our specific formal contexts built on texts.</p>
      <p>Copyright ©2020 for this paper by its authors.</p>
      <p>Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).</p>
      <p>The paper proposes another approach to the clustering of formal context data,
based on the construction of data associations with a specific AMR scheme.
Information Extraction (IE) from data is effective when the data models used for this
purpose are sufficiently informative by themselves. This is especially true for
information extraction from natural language texts. To extract information from text data,
a common scheme «model + resource» is used.</p>
      <p>The model reflects the structure and parameters of the information retrieval target.
Forms of models are various. This can be a lexical-grammatical template in a fact
extraction problem, or a matrix or graph in procedures based on mathematical models.
Linguistic resources are used to train models: text corpora, ontologies, and thesauri.
The peculiarity of multidimensional formal contexts used in this work is that they can
simultaneously be models of objects, for example, in thesauri development, and
information resources in question answering systems. In this paper, formal contexts are
constructed using an abstract meaning representation of the text. This ensures that
they are informative as models: the semantics of AMR schemes are preserved in the
model and in the query results it delivers.</p>
      <p>
        The method developed in this paper is tested on the texts of the AGAC corpus
(Active Gene Annotation Corpus) which contains abstracts of scientific articles on
biomedical topics of the PubMed system [
        <xref ref-type="bibr" rid="ref42">42</xref>
        ]. The efficiency of our approach applied to
the task of information extraction is due to the preservation of sentence semantics in a
multidimensional formal context.
1
      </p>
    </sec>
    <sec id="sec-2">
      <title>Formal Concept Analysis and Polyadic Formal Contexts</title>
      <p>
        Formal Concept Analysis (FCA) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] is mathematically rigorous theory which
formalizes the notion of concept and studies how concepts may be hierarchically organized.
FCA has been applied in many modern areas of knowledge discovery, machine
learning and information retrieval [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. There are also increasing number of FCA
applications in text mining and linguistics, bioinformatics and medicine, software
engineering and databases [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        Briefly consider the main issues of the FCA. Classical FCA deals with two basic
notions: formal context and concept lattice. Formal context is a triple
K=(G, M , I ) where G is a set of objects, M – set of their attributes, I ⊆ G × M –
binary relation which represents facts of belonging attributes to objects. Formal
context may be represented by [
        <xref ref-type="bibr" rid="ref1">0, 1</xref>
        ] - matrix K ={ki, j } in which units mark
correspondence between objects gi ∈ G and attributes m j ∈ M . The concepts in the
formal context have been determined by the following way. If for subsets of objects
A ⊆ G and attributes B ⊆ M there are exist mappings (which may be a functions
also) A′ : A → B and B′ : B → A
      </p>
      <p>with the properties of
A′ : ={m ∈ M |&lt; g, m &gt;∈ I for all g ∈ A} and B′ : ={g ∈ G |&lt; g, m &gt;∈ I for all m ∈ B}
then the pair (A, B) that A′ =B, B′ =A is named as formal concept.
The composition of mappings demonstrates following properties of A and
B: A ''</p>
      <p>=A, B '' =B; A and B is called the extent and the intent of a formal context
K =(G, M , I ) respectively.</p>
      <p>By other words, a formal concept is a pair (A, B) of subsets of objects and attributes
which are connected so that every object in A has every attribute in B, for every object
in G that is not in A, there is an attribute in B that the object does not have and for
every attribute in M that is not in B, there is an object in A that does not have that
attribute.</p>
      <p>If for formal concepts (A1, B1) and (A2, B2), A1  A2 and B2  B1 then (A1, B1) ≤
(A2, B2) and formal concept (A1, B1) is less general than (A2, B2). This order is
represented by concept lattice. A lattice consists of a partially ordered set in which
every two elements have a unique supremum (also called a least upper bound or join)
and a unique infimum (also called a greatest lower bound or meet).
1.1</p>
      <sec id="sec-2-1">
        <title>Applications FCA in Text Mining and Linguistics</title>
        <p>First of all, it is necessary to define correlation between the notions of formal and
linguistic contexts, the former being substantiated in algebraic theories, the latter
being part of language representations.</p>
        <p>
          Linguistic theories provide a variety of context types. In general, a context is
regarded as an obligatory condition for actualization of basic relations within a
language system, namely, syntagmatic and paradigmatic relations considered on
morphological, syntactic and semantic levels. On the one hand, there are approaches which
take into account the scope and size of linguistic contexts. This view is characteristic
for distributional semantics based on the assumption that semantic similarity of
lexical items arises from their contextual similarity. This assumption is well-grounded in
the works of L. Wittgenstein, Z. Harris, J. Firth, etc. who are considered to be the
founders of this trend in contemporary linguistics (cf. the survey [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]). The ideas of
distributional semantics lay the foundations of the rules governing collocability of
lexical items in non-compositional phrases (cf. the analysis given in [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]). In various
distributional semantic models (from the early word space models – HAL, LSA,
COALS, etc. – to contemporary count-based and predictive models – Distributional
Memory, Word2Vec, Doc2Vec, etc., cf. the overview of the works in [
          <xref ref-type="bibr" rid="ref7 ref8 ref9">7, 8, 9</xref>
          ])
context window size is a crucial parameter for vector space model development and word
embeddings training. On the other hand, cognitive interpretation of contextual
relations constitute a basis of theories focused on construction analysis (Construction
Grammar, Cognitive Grammar, Corpus Pattern Analysis, etc. [
          <xref ref-type="bibr" rid="ref10 ref11 ref12 ref13">10, 11, 12, 13</xref>
          ]).
        </p>
        <p>
          Inspite of external differences, particular contexts considered in linguistic theories
can be generalized as instances of formal contexts. Let’s consider a certain class of
context relations described as verbal constructions, or valency frames [
          <xref ref-type="bibr" rid="ref11 ref14 ref15">11, 14, 15</xref>
          ]
thoroughly described in lexical databases, such as VerbNet, FrameNet, etc. for
English, Lexicograph, FrameBank for Russian. Verbal valency frames are commonly
treated in terms of syntactic relations: type of governance in pairs «head verb +
dependencies»: cf. V(prove) → NP( hypothesis), V(prove) → PP(in experiments); and
argument structures (Rel – prove; Arg0 – subject/agent (researcher); Arg1 –
object/patient (hypothesis); Arg_M – modifier (in experiments)).
In Abstract Meaning Representation theory, the given frame is considered as an AMR
scheme, a unified structural representation of AMR schemata set being a formal
context. In Formal Concept Analysis distribution of formal context elements and their
features over texts is visualized as an attribute-value matrix similar to term-document
matrix in count-based vector space models. Parallel treatment of the notion of context
in linguistic and algebraic theories proves the possibility of consistent combinations
of contextual semantic approaches (frame analysis and distributional semantics) with
FCA and AMR.
        </p>
        <p>
          Interpretability of the basic notions of FCA from linguistic point of view explains
its effectiveness in a wide range of applications in Text Mining [
          <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
          ]. Being a
competitive approach to representation of contextual relations, FCA is used in verb frame
extraction and clustering [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], structuring lexical resources (thesauri and formal
ontologies) [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], ontology development [
          <xref ref-type="bibr" rid="ref18 ref19">18, 19</xref>
          ], social network analysis and studying
social communities organization [
          <xref ref-type="bibr" rid="ref20 ref21">20, 21</xref>
          ], fact extraction [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ], named entity
recognition [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ], text clustering [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ], duplicate detection [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ], recommendation systems [
          <xref ref-type="bibr" rid="ref26 ref27">26,
27</xref>
          ], etc. In most cases FCA forms an ensemble with traditional NLP techniques:
morphosyntactic annotation of corpora, collocation analysis, keyword extraction, common
clustering and classification algorithms, similarity measures. In recent decades
researchers witness a strong tendency to consider FCA as a theoretical platform for
experiments within the framework of machine learning.
1.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Multimodal Clustering in FCA</title>
        <p>
          Formal Concept Analysis may be defined as «the paradigm of conceptual modeling
which studies how objects can be hierarchically grouped together according to their
common attributes» [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. Such grouping of objects is really clustering of them. More
accurately, this is biclustering: clustering of two sets simultaneously, the set of objects
and the set of attributes. The output of FCA algorithms is concept lattice which
contains hierarchically linked formal concepts which are biclusters.
        </p>
        <p>
          Among the advanced issues of FCA there is the study of multidimensional formal
contexts which can be represented as n-ary relations R  D1  D2 ... Dn on data
domains D1, D2 , ..., Dn . For n = 3 these domains have the meanings of «objects»,
«attributes» and «conditions» and FCA on formal contexts of this dimension has been
distinguished as Triadic Formal Concept Analysis [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ]. Multidimensional formal
contexts also generate corresponding lattices of concepts. Practical applications of
polyadic formal contexts in FCA are limited to two- and three-dimensional formal
contexts. At the same time, the transition from dimension two to dimension three with
the subsequent finding of formal concepts is not a simple scaling, but is associated
with the introduction of additional operators and analysis tools [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ]. However, already
starting from dimension three, their construction is a much more complicated task
than in the classical two-dimensional case. The three-dimensional version of FCA is
best studied, which allows us to distinguish the Triadic Formal Concept Analysis as a
separate area of FCA [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ]. The subject of research here is multimodal, in this case,
three-dimensional clusters − triclusters.
        </p>
        <p>An important result was obtained here, consisting in the fact that every
threedimensional concept of a conceptual lattice belongs to some tricluster. According to
multimodal clustering, for any dimension of formal context, the purpose of its
processing is to find n-sets H  X1, X 2 , ..., X n  which have the closure property
u  ( x1, x2 ,..., xn )  X1, X 2 , ..., X n , u  R ,
(1)
j  1, 2,..., n, x j  D j \ X j  X1,..., X j {x j}, ..., X n  does not satisfy (1). The sets
H  X1, X 2, ..., X n  constitute multimodal clusters.</p>
        <p>As two-dimensional biclusters are built formally, as for the dimension n ≥ 3
clustering is performed with the use of various measures of proximity. Accordingly, the
problem of interpretation of multimodal clusters in the context of the selected
proximity measure arises.
2</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Constructing Polyadic Formal Contexts on Natural Language</title>
    </sec>
    <sec id="sec-4">
      <title>Texts</title>
      <p>The central notion of Formal Concept Analysis, the notion of formal concept seems
very attractive for applying it in the areas where the term «concept» is used naturally.
Natural Language Processing (NLP) is just that area. The cherished goal in the NLP is
computerized understanding of texts. One a way of such understanding is using
concepts being acquired from texts. Formal contexts potentially contain concepts but it is
evident that expressiveness of standard two-dimensional formal contexts is not
enough for modeling all peculiarities of natural language texts. So we apply
multidimensional or polyadic formal contexts constructed on texts.</p>
      <p>Consider in general the process of constructing polyadic formal contexts on natural
language texts. It includes the following steps.</p>
      <p>Establishing the problems to solve. Determining the range of tasks that the
developed model is oriented towards in the form of a multidimensional formal context. In a
general setting, these are the tasks of extracting information. They come down to
extracting named entities from the text, extracting relationships, facts, and events.
These may be the results of a query to a system that uses formal contexts.</p>
      <p>Choosing a semantic text model. There should be an intermediate link between the
text and the formal context the link as semantic model which is the data source for the
formal context. As such a model, we chose the abstract-semantic representation of the
text. To construct AMR-schemes, conceptual graphs are used.</p>
      <p>Formal context construction. At this stage, it is necessary to choose the dimension
of the context, the composition of the sets, D1, D2 , ..., Dn and build the relation
R  D  D2 ... D . The constructed multidimensional formal context should be
1 n
implemented as a storage object, for example, in a database in such a way as to ensure
work with context by executing queries to it.</p>
      <sec id="sec-4-1">
        <title>Conceptual Modeling Text Semantics</title>
        <p>
          We apply conceptual graphs (CGs) [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ] for modeling text semantics. There are
several methods of acquiring conceptual graphs from natural language texts [
          <xref ref-type="bibr" rid="ref32 ref33">32, 33</xref>
          ].
Among them, the method based on Semantic Role Labeling [
          <xref ref-type="bibr" rid="ref34">34</xref>
          ] is most suitable for
building formal contexts. Some peculiarities of conceptual graphs created with this
method, and examples of applications CGs in knowledge discovery are illustrated in
[
          <xref ref-type="bibr" rid="ref35">35</xref>
          ].
        </p>
        <p>
          Certain problems arise when using conceptual graphs as input to formal contexts.
Among them there is the problem of redundancy of conceptual graphs. A conceptual
graph acquired from quite a long sentence may contain many various semantic roles,
and it is difficult to represent the variants of connections they specify in the formal
context, even when the dimension of a context is greater than two. The solution to this
problem is to aggregate conceptual graphs. An aggregated conceptual graph is a
smaller graph that summarizes the information contained in the original graph [
          <xref ref-type="bibr" rid="ref36">36</xref>
          ].
        </p>
        <p>The method of aggregation that we apply is based on the construction of an
Abstract Meaning Representation (AMR) on each conceptual graph.</p>
        <p>
          AMR [
          <xref ref-type="bibr" rid="ref37">37</xref>
          ] «is a rooted, directed acyclic graph that captures the certain notion in
text, in a way that sentences that have the same basic meaning often have the same
AMR». The nodes in the AMR graph map to words in the sentence and the edges map
to relations between the words. This definition of AMR graph demonstrates the
similarity AMR graphs and conceptual graphs.
        </p>
        <p>Let's call the AMR schema a template T (C, S) where C is a set of concepts, S is a
set of semantic roles, they both are from conceptual graph. Concrete content of AMR
schema is defined by certain values (meanings) of C and S and it has a certain
meaning too. For example, the template
T(C, S) = &lt; Concept_1 &gt; ← (“Agent”) ←&lt;Verb&gt;→(“Patient”) →&lt;Concept_2&gt; (2)
specifies the AMR schema with the meaning «who did what to whom». The template
(2) defines a conceptual graph in which «Agent» and «Patient» are the names of
semantic roles, Concept_1, Concept_2 – words being its concepts, «Verb» is
conceptverb from conceptual graph.</p>
        <p>Figure 1 demonstrates an example of interpreting AMR schema as sub graph of
conceptual graph.</p>
        <p>Conceptual graph on the Fig. 1 derives AMR schema «who did what to whom»
with the content «SHP-2 attenuates function» according with the template (2). This
AMR schema represents the meaning of the whole sentence and, certainly, represents
it very broadly. Using AMR schemes, semantic compression of text sentences is
performed.</p>
        <p>
          There are two propositions which we can formulate based on the analysis of works
[
          <xref ref-type="bibr" rid="ref37 ref38 ref39">37 - 39</xref>
          ] and the essence of conceptual graphs.
1. In many applications, particularly in the field of Bioinformatics, the expressiveness
of AMR schemata is sufficient to represent the meaning of sentences.
2. Conceptual graphs allow implementing a variety of AMR schemata, including
more complex ones that reflect the meaning of the sentence more fully.
Based on these propositions, consider the method for constructing formal contexts on
a set of conceptual graphs.
2.2
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>Acquiring Polyadic Formal Contexts</title>
        <p>The polyadic formal context is constructed as follows. By semantic role labeling for
each sentence of the text, a conceptual graph is constructed, on the elements of which
a concrete AMR scheme is created. The formal context K  D  D ... Dn is a
1 2
multidimensional tensor whose points are the elements of the AMR scheme for each
representation, ki, j,...,n = {ci , c j ,..., cn} where ck, k = 1, 2,..., N are the concepts of
the concept graphs, N is the total number of concepts obtained on the processed text.
The number of points in the formal context matches the number of AMR schemata
found in the text. The vast majority of points in a formal context are meaningful
phrases, for example, the phrase «SHP-2 attenuates function» from figure 1 is a point
&lt;SHP-2, attach, function&gt; in a three-dimensional context.</p>
      </sec>
      <sec id="sec-4-3">
        <title>Query Support on Polyadic Formal Context. After creating a polyadic formal</title>
        <p>context, it is necessary to organize its storage and access to its content in order to
solve the problems of extracting information. Information is extracted by querying a
polyadic formal context.</p>
        <p>
          There is the following idea concerned with Conceptual Modeling. If a query to a
conceptual model can be represented as an element of this model itself − for example,
as its concept, then the refinement of this query or even the answer to it is contained
in concepts adjacent to the concept-query. This idea also holds for concept lattices
and has been tested in several papers [
          <xref ref-type="bibr" rid="ref40">40</xref>
          ]. In general, selecting data that matches the
query is a solution to the clustering problem. On polyadic formal contexts, solving the
clustering problem requires determining the proximity measure for the points that
make up the context. When using clustering algorithms used in FCA [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ], a Boolean
value is used as the proximity measure − the fact that clustering objects fall into a
relation R  D  D ... Dn that sets the context. When using this measure in a
1 2
context consisting of AMR schema points, clustering will result in subsets containing
subsets of words  X1, X 2 , ... , X n  found according to the R relation. For example,
the point considered in Figure 1 may appear in the following cluster of three points
(the maximum number of elements is three; they are in the first subset):
&lt;{SHP-2, val174del, ephrin-b2}, {attenuate, cause}, {function, dysplasia}&gt;.
        </p>
        <p>Although this cluster can be useful by demonstrating the relationship of objects
from the first subset through words from the second and third subset, it is impossible
to extract information from it, for example, about what exactly causes dysplasia. It
turns out that individual elements of multidimensional formal context, its points,
contain specific information in the form of an AMR scheme, but after processing the
context this information is lost.</p>
        <p>Thus, in order to extract information from multidimensional formal contexts based
on AMR schemes, a different than FCA-clustering method is needed.</p>
        <p>In our method, specific clusters − associations are built on formal contexts. An
Association is a set of points ordered relative to the selected word position in the AMR
scheme for a point. This corresponds to the logic of the AMR scheme: certain
semantic elements are selected in it. The Association includes all words in the selected
position of the AMR scheme. Therefore, an Association is a cluster built on the basis of
the proximity measure «belong to a certain position of the AMR scheme». On the
other hand, the Association is a function А(x1,…, xp) whose argument can be a given
word or a set of p words belonging to the k-th position of the AMR scheme.</p>
        <p>The meaning of highlighting such associations is closely related to the logic of
queries to the formal context. These queries usually correspond to the structures of the
AMR charts.
3
3.1</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Applications in Information Extraction</title>
      <sec id="sec-5-1">
        <title>State of the Art</title>
        <p>
          Let’s discuss an example of applying FCA to data analysis in a specific area. One of
the areas where NLP applications become more in demand is Bioinformatics. The
Biomedical Natural Language Processing (BioNLP) [
          <xref ref-type="bibr" rid="ref38">38</xref>
          ] is the new area of research
in Bioinformatics which appearance was due to the avalanche-like growth of
publications in the field of biomedicine. The main purpose of BioNLP is to obtain new
knowledge from published texts, not completely contained in each individual
publication. Initially, the main area of application of BioNLP methods was genomic studies.
Over time, the subject matter of texts processed by BioNLP has expanded to other
areas and BioNLP was formed as a research area with its own data, tasks and methods
[
          <xref ref-type="bibr" rid="ref37 ref38 ref39">37-39</xref>
          ]. All the BioNLP tasks may be classified as more or less general. The general
tasks of fact extraction and event extraction usually transform to the standard tasks of
Named Entity Recognition (NER) and Relation Extraction (RE). NER consists in
automatically identifying occurrences of biological or medical terms in unstructured
text. As named entities, there are the names of genes, proteins, living organisms or
diseases – it depends on the domain to which processed text belongs to.
        </p>
        <p>RE is another standard task of BioNLP. Relations are associations among
biomedical entities. The simplest relations are binary, involving only the pair-wise
associations between two entities. But biomedical relationships can involve more than just
two entities. This kind of relationship is actual in the task of event extraction. In our
time, named as genomic era, much of BioNLP work has focused on automatically
extracting interactions between genes and proteins. Other associations include
interactions between proteins and mutations, proteins and their binding sites, genes and
diseases, genes and phenotypic context.</p>
        <p>Leading BioNLP research groups are mainly interested in processing English data,
although Russian biomedical texts attract growing attention.</p>
        <p>Researchers collected and prepared for distribution a great amount of textual data.
BioNLP competitions inspired creation of richly annotated corpora for NER, RE,
Semantic Role Labeling (SRL), etc. The given empirical data is a great asset to
computational linguists working in the field of Bioinformatics.
3.2</p>
      </sec>
      <sec id="sec-5-2">
        <title>Experimental Data</title>
        <p>
          Experiments aimed at the empirical verification of our approach were carried out for
texts of the AGAC corpus (Active Gene Annotation Corpus) which contains abstracts
of scientific articles on biomedical topics of the PubMed system. The corpus was
created for BioNLP Shared Tasks 2019 competition [
          <xref ref-type="bibr" rid="ref42">42</xref>
          ] and was proposed as a
dataset for NER and RE tasks. The corpus contains 250 annotated abstracts and 1000
raw abstracts, it size being about 300 000 tokens. Conceptual graphs were built for
separate sentences from annotated abstracts; experiments with distributional semantic
models were carried out for the whole dataset.
3.3
        </p>
      </sec>
      <sec id="sec-5-3">
        <title>Finding Dependencies Between Texts</title>
        <p>The problem of finding the relationships of texts is well known in the field of IE and
has a variety of options. In our experiments, we studied a variant in which it is not
known in advance by what attributes the links between texts are established. These
attributes, which are ultimately reduced to subsets of words, are determined by
analyzing the contents of texts, which in this case are replaced by a formal context built
on them.</p>
        <p>In our experiments, we compared the informativeness of two formal contexts built
on texts in accordance with 3 and 5 element AMR schemes. The three-element
scheme has the form (2), and the five-element AMR scheme has the following form:
An additional dimension was included in each context to fix the number of the text
to which this point belongs. As a result, contexts of dimensions 4 and 6 were subject
to processing.</p>
        <p>Obviously, multi-element AMR schemata allow more detailed modeling of the
semantics of a sentence. Formal contexts built on their basis are more informative. This
position was checked in experiments. The experiments included the following steps.
1. Building associations on selected positions of the AMR-scheme of the formal
context.
2. Generating queries for associations based on query words
3. Obtaining query results in the form of clusters containing formal context points.
4. Interpretation of clusters.</p>
        <p>Consider some experimental results. Associations were created on both formal
contexts regarding the position of the subject of the action − the first position for the
three-element AMR scheme and the second position for the five-element one. Next,
the size and content of each association were estimated.</p>
        <p>Domain terms were highlighted in the corpus. The term «mutation» has extensive
connections, it organizes one of the most voluminous associations. Indeed, most of
the texts of the corpus are devoted to the study of various manifestations of mutation
and its influence on organisms. Therefore, our queries to associations were performed
using the keyword «mutation». The results of the query are clusters. The question that
determines further actions with the resulting clusters is: «What does the mutation
manifest itself on?» The implementation of this request on clusters was carried out by
building associations with respect to the position of the action object − the third
position for the three-element AMR scheme and the fourth position for the five-element
one. The query words obtained in the constructed associations were compared with
text numbers and then presented for analysis.</p>
        <p>Responses to association requests are generated in tabular form. If the result of a
two-element query to associations is presented as a cross-table, it is interpreted as a
two-dimensional formal context. In this case, it can be visualized as a concept lattice
according to the classical version of FCA.</p>
        <p>Fig. 2 (a) shows the sub context as a cross-table of the four-dimensional formal
context constructed for three-element AMR scheme (2), Fig. 2 (b) shows concept
lattice.
Fig. 2. The subcontext of the formal context built for the three-element AMR-scheme and its
visualization in the form of concept lattice
The query that generates the result in Fig. 2, can be made in the form of «How are
texts related in the context of the word «mutation» through its manifestations?» Texts
with numbers in the left column of the sub context on Fig. 2 a) are linked in the
context of the word «mutation» by means of the words indicated in grey rectangles in the
concept lattice.</p>
        <p>The lattice in Fig. 2 (b) is trivial. It has only one layer and all concepts are
independent. The three-element AMR scheme does not reveal the connections of texts in
sufficient detail. For comparison, the same request was processed on a formal context
built for the five-element AMR scheme (3).</p>
        <p>Fig. 3 shows the fragment of the association built on the «mutation» cluster for the
fifth element of the five-element AMR scheme. The numbers of occurrences of
certain words in context points are shown in the summary table in Fig. 3 a). So the word
«phenotype» occurs in 5 points and in some documents, including document No 51.</p>
        <p>Processing a query in a six-dimensional context reveals a larger number of words
that link texts. The corresponding two-dimensional formal sub-context has a larger
size and its concept lattice shown in Fig. 3 b), is not trivial: it has a hierarchy of
concepts.
Fig. 3. A fragment of association built on the «mutation» cluster the five-element AMR scheme
and its concept lattice
Comparing the lattices in Fig.2 (b) and Fig. 3 (b), we see that, for example, in Fig. 2
(b) texts 231, 138, 51 are included in the same concept with the word «phenotype»
combining them, and in the lattice in Fig. 3 these texts form three different concepts
with a large number of unifying words.</p>
        <p>At the same time, the concept that includes text 231 is more general for the
concepts that include texts 51 and 138. The lattice in Fig. 3 b) can be named as "What is
affected by mutation in different texts".</p>
        <p>Based on these results, the following conclusions can be drawn.
1. The problem of finding dependencies between texts can be solved by clustering
data of polyadic formal context using data associations.
2. The informativeness of a five-element AMR scheme is qualitatively higher than
that of a three-element AMR scheme.</p>
        <p>It is obvious that due to the universality of this text analysis tool, it can be used in
various other tasks of relation extraction.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>In this paper, we propose a method for constructing and applying polyadic formal
contexts on natural language tests. The method uses conceptual graphs acquired from
texts and, together with AMR-schemata, these graphs constitute a data source for
polyadic formal contexts.</p>
      <p>Polyadic formal contexts constructed by this way may be used as a tool for
multimodal clustering. This tool was tested here on the problem of finding dependencies
between texts.</p>
      <p>It should be noted that the use of conceptual graphs makes it possible to construct
AMR schemata of greater length than those considered in this paper. This will allow
for the implementation of polyadic formal contexts that reflect the content of the
modeled text more fully and, accordingly, to extract more complete information from
it. The method can be applied in Question-answering systems, in which natural
language queries correspond to the logic of AMR schemes.</p>
      <p>Acknowledgement. The reported study was funded by Russian Foundation of Basic Research,
the research project № 19-07-01178 and RFBR and Tula Region according to research project
№ 19-47-710007.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Ganter</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stumme</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wille</surname>
            ,
            <given-names>R</given-names>
          </string-name>
          . (eds.):
          <source>Formal Concept Analysis: Foundations and Applications, Lecture Notes in Artificial Intelligence, № 3626</source>
          , Springer-Verlag, Berlin, (
          <year>2005</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Poelmans</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ignatov</surname>
            ,
            <given-names>D.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dedene</surname>
          </string-name>
          , G.:
          <article-title>Formal concept analysis in knowledge processing: A survey on models and techniques</article-title>
          .
          <source>In: Expert Systems with Applications</source>
          ,
          <volume>40</volume>
          (
          <issue>16</issue>
          ), pp.
          <fpage>6601</fpage>
          -
          <lpage>6623</lpage>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Poelmans</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ignatov</surname>
            ,
            <given-names>D.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dedene</surname>
          </string-name>
          , G.:
          <article-title>Formal concept analysis in knowledge processing: A survey on applications</article-title>
          .
          <source>In: Expert Systems with Applications</source>
          ,
          <volume>40</volume>
          (
          <issue>16</issue>
          ), pp.
          <fpage>6538</fpage>
          -
          <lpage>6560</lpage>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Ignatov</surname>
            ,
            <given-names>D.I.</given-names>
          </string-name>
          :
          <article-title>Formal Concept Analysis: from Theory to Practice</article-title>
          .
          <source>In: AIST 2012 Proceedings</source>
          , pp.
          <fpage>3</fpage>
          -
          <lpage>15</lpage>
          .
          <string-name>
            <surname>Ekaterinburg</surname>
          </string-name>
          (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Sahlgren</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The Distributional Hypothesis</article-title>
          .
          <source>In: Rivista di Linguistica</source>
          .
          <volume>20</volume>
          (
          <issue>1</issue>
          ), pp.
          <fpage>33</fpage>
          -
          <lpage>53</lpage>
          (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Apresjan</surname>
          </string-name>
          , Ju.D.:
          <article-title>On the Rule of Lexical Meaning Composition</article-title>
          .
          <source>In: The Problems of Structural Linguistics</source>
          <year>1971</year>
          . Moscow, Nauka (
          <year>1972</year>
          ) [In Russian].
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Baroni</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dinu</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kruszewski</surname>
          </string-name>
          , G.:
          <string-name>
            <surname>Don't Count</surname>
          </string-name>
          ,
          <article-title>Predict! A Systematic Comparison of Context-Counting vs. Context-Predicting Semantic Vectors</article-title>
          .
          <article-title>In: 52nd Annual Meeting of the Association for Computational Linguistics</article-title>
          ,
          <source>ACL 2014, Proceedings of the Conference</source>
          , vol.
          <volume>1</volume>
          , pp
          <fpage>238</fpage>
          -
          <lpage>247</lpage>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Clark</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Vector Space Models of Lexical Meaning</article-title>
          . In: Lappin,
          <string-name>
            <given-names>Sh.</given-names>
            ,
            <surname>Fox</surname>
          </string-name>
          , Ch. (eds.)
          <source>The Handbook of Contemporary Semantic Theory</source>
          , pp.
          <fpage>493</fpage>
          -
          <lpage>522</lpage>
          . Blackwell Publishing, Ltd. (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Rohde</surname>
            ,
            <given-names>D.L.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gonnerman</surname>
            ,
            <given-names>L.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Plaut</surname>
            ,
            <given-names>D.C.</given-names>
          </string-name>
          :
          <article-title>An Improved Model of Semantic Similarity Based on Lexical Co-Occurrence</article-title>
          .
          <source>In: Cognitive Science</source>
          , vol.
          <volume>8</volume>
          (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Goldberg</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Constructions at Work: The Nature of Generalization in Language</article-title>
          . New York, Oxford University Press (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Fillmore</surname>
          </string-name>
          , Ch.J.,
          <string-name>
            <surname>Kay</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>A Construction Grammar Coursebook</article-title>
          . University of California, Berkeley (
          <year>1995</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Hanks</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Corpus Pattern Analysis</article-title>
          . In: Williams G.,
          <string-name>
            <surname>Vessier</surname>
          </string-name>
          , S. (eds.)
          <article-title>Proceedings of the XI Euralex International Congress</article-title>
          , Lorient, Université de Bretagne-Sud (
          <year>2004</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Rakhilina</surname>
            <given-names>E</given-names>
          </string-name>
          . (ed.)
          <article-title>Construction Linguistics</article-title>
          . Moscow (
          <year>2010</year>
          ) [In Russian].
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Apresjan</surname>
          </string-name>
          , Ju.D.:
          <article-title>Integral Description of Language and Systemic Lexicography</article-title>
          . In: Selected works, vol.
          <volume>2</volume>
          .
          <string-name>
            <surname>Moscow</surname>
          </string-name>
          (
          <year>1995</year>
          ) [In Russian].
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Melchuk</surname>
            ,
            <given-names>I.A.</given-names>
          </string-name>
          :
          <article-title>Experience in the Theory of Linguistic Models «Sense &lt;=&gt; Text»</article-title>
          . Moscow (
          <year>1974</year>
          /
          <year>1999</year>
          ) [In Russian].
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Falk</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gardent</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Combining Formal Concept Analysis and Translation to Assign Frames and Thematic Grids to French Verbs</article-title>
          . In: Napoli,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Vychodil</surname>
          </string-name>
          , V. (eds.):
          <source>CLA</source>
          <year>2011</year>
          , pp.
          <fpage>223</fpage>
          -
          <lpage>238</lpage>
          ,
          <string-name>
            <given-names>INRIA</given-names>
            <surname>Nancy</surname>
          </string-name>
          <article-title>Grand Est and LORIA (</article-title>
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Priss</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <article-title>Modeling lexical databases with formal concept analysis</article-title>
          .
          <source>In: Journal of Universal Computer Science</source>
          , vol.
          <volume>10</volume>
          (
          <issue>8</issue>
          ), pp.
          <fpage>967</fpage>
          -
          <lpage>984</lpage>
          (
          <year>2004</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Z.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Ontology Learning by Clustering Based on Fuzzy Formal Concept Analysis</article-title>
          .
          <source>In: Proceedings of the 31st Annual International Computer Software and Applications Conference COMPSAC'07</source>
          , vol.
          <volume>1</volume>
          , pp.
          <fpage>204</fpage>
          -
          <lpage>210</lpage>
          . IEEE Computer Society, Washington, DC, USA, (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Gamallo</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lopes</surname>
            ,
            <given-names>G.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Agustini</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Inducing Classes of Terms from Text</article-title>
          . In: Matoušek V.,
          <string-name>
            <surname>Mautner</surname>
            <given-names>P</given-names>
          </string-name>
          . (eds.) Text,
          <article-title>Speech and Dialogue</article-title>
          .
          <source>TSD 2007. Lecture Notes in Computer Science</source>
          , vol
          <volume>4629</volume>
          , pp.
          <fpage>31</fpage>
          -
          <lpage>38</lpage>
          . Springer, Berlin, Heidelberg (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ignatov</surname>
            ,
            <given-names>D.I.</given-names>
          </string-name>
          :
          <article-title>Concept Stability for Constructing Taxonomies of Website Users</article-title>
          .
          <source>In: Proc. Satellite Workshop «Social Network Analysis and Conceptual Structures: Exploring Opportunities» at the 5th International Conference Formal Concept Analysis (ICFCA'07)</source>
          , pp.
          <fpage>19</fpage>
          -
          <lpage>24</lpage>
          . Clermont-Ferrand, France (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Roth</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Obiedkov</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kourie</surname>
            ,
            <given-names>D.G.</given-names>
          </string-name>
          :
          <article-title>On Succint Representation of Knowledge Community Taxonomies with Formal Concept Analysis</article-title>
          .
          <source>In: Int. J. of Foundations of Computer Science</source>
          , vol.
          <volume>19</volume>
          , № 2, pp.
          <fpage>383</fpage>
          -
          <lpage>404</lpage>
          . World Scientific Publishing Company (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Elzinga</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Poelmans</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Viaene</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dedene</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morsing</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Terrorist Threat Assessment with Formal Concept Analysis</article-title>
          .
          <source>In: Proc. IEEE International Conference on Intelligence and Security Informatics</source>
          , pp.
          <fpage>77</fpage>
          -
          <lpage>82</lpage>
          . Vancouver, Canada,
          <fpage>77</fpage>
          -
          <lpage>82</lpage>
          (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Girault</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Concept Lattice Mining for Unsupervised Named Entity Annotation</article-title>
          . In: Belohlavek,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Kuznetsov</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.O</surname>
          </string-name>
          . (eds.):
          <source>Proc. CLA</source>
          <year>2008</year>
          , Palacký University, Olomouc, pp.
          <fpage>35</fpage>
          -
          <lpage>46</lpage>
          (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Maille</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Statler</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chaudron</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>An Application of FCA to the Analysis of Aeronautical Incidents</article-title>
          . In: Ganter,
          <string-name>
            <surname>B.</surname>
          </string-name>
          et al. (eds.): ICFCA, LNAI
          <volume>3403</volume>
          , pp.
          <fpage>145</fpage>
          -
          <lpage>161</lpage>
          . Springer (
          <year>2005</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Ignatov</surname>
            ,
            <given-names>D.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          <string-name>
            <surname>Frequent</surname>
          </string-name>
          <article-title>Itemset Mining for Clustering Near Duplicate Web Documents</article-title>
          . In: Rudolph,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Dau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Kuznetsov</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.O</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the 17th International Conference on Conceptual Structures, ICCS</source>
          <year>2009</year>
          ,
          <article-title>LNCS (LNAI) 5662</article-title>
          , pp.
          <fpage>185</fpage>
          -
          <lpage>200</lpage>
          . Springer-Verlag Berlin Heidelberg (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Ignatov</surname>
            ,
            <given-names>D.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          <article-title>Concept-based Recommendations for Internet Advertisement</article-title>
          . In: Belohlavek R.,
          <string-name>
            <surname>Sergei</surname>
            <given-names>O.</given-names>
          </string-name>
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O</given-names>
          </string-name>
          . (eds.):
          <source>Proceedings of The Sixth International Conference Concept Lattices and Their Applications (CLA'08)</source>
          , CLA2008, pp.
          <fpage>157</fpage>
          -
          <lpage>166</lpage>
          . Palacky University, Olomouc (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Ebner</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mühlburger</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schaffert</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schiefner</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reinhardt</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wheeler</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Getting Granular on Twitter: Tweets from a Conference and Their Limited Usefulness for Non-participants</article-title>
          .
          <source>In: IFIP Advances in Information and Communication Technology</source>
          , vol.
          <volume>324</volume>
          , pp.
          <fpage>102</fpage>
          -
          <lpage>113</lpage>
          . Springer Berlin Heidelberg (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Kaytoue</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Macko</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Napoli</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Biclustering Meets Triadic Concept Analysis</article-title>
          .
          <source>In: Annals of Mathematics and Artificial Intelligence</source>
          , vol.
          <volume>70</volume>
          , pp.
          <fpage>55</fpage>
          -
          <lpage>79</lpage>
          . Springer Verlag, Germany (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Ignatov</surname>
            ,
            <given-names>D.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gnatyshak</surname>
            ,
            <given-names>D.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mirkin</surname>
            ,
            <given-names>B.G.</given-names>
          </string-name>
          :
          <article-title>Triadic Formal Concept Analysis and Triclustering: Searching for Optimal Patterns</article-title>
          .
          <source>In: Machine Learning</source>
          , April,
          <year>2015</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>32</lpage>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Cerf</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Besson</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Robardet</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boulicaut</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Closed Patterns Meet N-ary Relations</surname>
          </string-name>
          .
          <source>In: ACM Trans. Knowl. Discov. Data. 3</source>
          ,
          <issue>1</issue>
          , Article 3, 36 p. (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Sowa</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          :
          <article-title>Knowledge Representation: Logical, Philosophical,</article-title>
          and Computational Foundations, Brooks Cole Publishing Co., Pacific Grove, CA (
          <year>2000</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Hensman</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Construction of Conceptual Graph Representation of Texts</article-title>
          . In: Proceedings of Student Research Workshop at HLT-NAACL, pp.
          <fpage>49</fpage>
          -
          <lpage>54</lpage>
          . Boston (
          <year>2004</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Bogatyrev</surname>
            ,
            <given-names>M.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mitrofanova</surname>
            ,
            <given-names>O.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tuhtin</surname>
            ,
            <given-names>V.V.</given-names>
          </string-name>
          :
          <article-title>Building Conceptual Graphs for Articles Abstracts in Digital Libraries</article-title>
          .
          <source>In: Proceedings of the Conceptual Structures Tool Interoperability Workshop (CS-TIW 2009) at 17th International Conference on Conceptual Structures (ICCS'09)</source>
          , pp.
          <fpage>50</fpage>
          -
          <lpage>57</lpage>
          (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Gildea</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jurafsky</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Automatic Labeling of Semantic Roles</article-title>
          .
          <source>In: Computational Linguistics</source>
          ,
          <year>2002</year>
          , vol.
          <volume>28</volume>
          , pp.
          <fpage>245</fpage>
          -
          <lpage>288</lpage>
          (
          <year>2002</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <surname>Bogatyrev</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Fact Extraction from Natural Language Texts with Conceptual Modeling</article-title>
          .
          <source>In: Communications in Computer and Information Science</source>
          , vol.
          <volume>706</volume>
          , pp.
          <fpage>89</fpage>
          -
          <lpage>102</lpage>
          . SpringerVerlag (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.
          <string-name>
            <surname>Chein</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mugnier</surname>
          </string-name>
          , M.-L.:
          <article-title>Graph-based Knowledge Representation</article-title>
          .
          <source>Computational Foundations of Conceptual Graphs</source>
          . Springer-Verlag, London (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          37.
          <string-name>
            <surname>Rao</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marcu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Knight</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Daumé</surname>
            <given-names>III</given-names>
          </string-name>
          , H.:
          <article-title>Biomedical Event Extraction using Abstract Meaning Representation</article-title>
          .
          <source>In: Proceedings of the BioNLP 2017 workshop</source>
          , Vancouver, Canada, Association for Computational Linguistics, pp.
          <fpage>126</fpage>
          -
          <lpage>135</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          38.
          <string-name>
            <surname>Cohen</surname>
            ,
            <given-names>K.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Demner-Fushman</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Biomedical Natural Language Processing</article-title>
          . John Benjamins Publishing Company, Philadelphia (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          39.
          <string-name>
            <surname>Simpson</surname>
            ,
            <given-names>M.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Demner-Fushman</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Biomedical Text Mining: A Survey of Recent Progress</article-title>
          . In: Aggarwal,
          <string-name>
            <given-names>Ch.C.</given-names>
            ,
            <surname>Zhai</surname>
          </string-name>
          , Ch.X. (eds.):
          <source>Mining Text Data</source>
          . Springer (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          40.
          <string-name>
            <surname>Carpineto</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romano</surname>
          </string-name>
          , G.:
          <article-title>A Survey of Automatic Query Expansion in Information Retrieval</article-title>
          .
          <source>In: ACM Computing Surveys</source>
          ,
          <volume>44</volume>
          (
          <issue>1</issue>
          ), Article 1 (
          <year>January 2012</year>
          ), 50 p. (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          41.
          <string-name>
            <surname>Henriques</surname>
            ,
            <given-names>R</given-names>
          </string-name>
          , Madeira,
          <string-name>
            <surname>S.C.</surname>
          </string-name>
          :
          <article-title>Triclustering Algorithms for Three-Dimensional Data Analysis: A Comprehensive Survey</article-title>
          .
          <source>In: ACM Computing Surveys</source>
          ,
          <volume>51</volume>
          (
          <issue>5</issue>
          ), pp.
          <fpage>1</fpage>
          -
          <lpage>43</lpage>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          42.
          <string-name>
            <surname>BioNLP Open Shared Tasks (BioNLP-OST)</surname>
          </string-name>
          , https://2019.bionlp-ost.org/home, last accessed
          <year>2020</year>
          /05/15.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>