<!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>Knowledge Discovery from Texts with Conceptual Graphs and FCA</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mikhail Bogatyrev</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kirill Samodurov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Tula State University</institution>
          ,
          <addr-line>Tula</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Building conceptual lattices from conceptual graphs looks as natural way in Formal Concept Analysis but still is not discovered at length. If conceptual graphs are acquired from natural language texts then they contain specific material for knowledge discovery. Conceptual graphs serve as semantic models of text sentences and the data source for concept lattice. With the use of concept lattice it is possible to extract information which can be treated as facts. Facts can be extracted by using navigation in the lattice and interpretation its concepts and hierarchical links between them. Experimental investigation of this knowledge discovery technique is performed on the annotated textual corpus consisted of descriptions of biotopes of bacteria.</p>
      </abstract>
      <kwd-group>
        <kwd>Knowledge discovery</kwd>
        <kwd>Conceptual graphs</kwd>
        <kwd>Formal context</kwd>
        <kwd>Concept lattice</kwd>
        <kwd>Bacteria biotopes</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>In the Formal Concept Analysis (FCA) community there is growing interest in the
application FCA to textual data. Such interest corresponds to the overall popularity of
Text Mining methods due to the prevalence of textual data, especially in the Internet.</p>
      <p>
        There is certain number of works concerned with FCA and Text Mining devoted as
to linguistic applications of FCA [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] as to information retrieval with FCA [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ] .
      </p>
      <p>
        The actual problem here is the problem of building formal contexts on textual data.
If textual data is represented as natural language texts then this problem becomes acute.
There are several approaches to the solution of this problem. One, mostly applied
variant, is the context in which the objects are text documents and the attributes are the
terms from these documents [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Another variant is building formal context directly on
the texts. On this way, various features of texts have been analyzed and used for
constructing formal context. Semantic relations (synonymy, hyponymy, hypernymy) in
a set of words are used for semantic matching with FCA in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], verbobject dependencies
from texts are applied in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] for learning concept hierarchies from text corpora and more
general lexico-syntactic features of words are applied in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>In addition to the direct use of text for building formal contexts, semantic models
of text and textual corpora tagging tools are used. We apply this approach and use
conceptual graphs (CGs) for representing semantics of individual sentences of a text.</p>
      <p>
        One of the early mentions of applications of conceptual graphs in FCA can be
found in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Modern results concerned with conceptual graphs and FCA are in the
work [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
      <p>
        Although the join of two paradigms of conceptual modeling - conceptual graphs
and concept lattices - looks attractive it is still not discovered at length. In this paper
we present some results of knowledge discovery which were obtained by using our
framework for conceptual modeling on natural language texts [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. Now due to
certain improvements made in the framework it is possible to extract from the texts more
information being interpreted as knowledge. Experimental investigation of this
knowledge discovery technique is performed by learning of bacteria biotopes [
        <xref ref-type="bibr" rid="ref17 ref18">17, 18</xref>
        ].
A biotope (also known as habitat) is an area of uniform environmental conditions
providing a living place for plants, animals or any living organism.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>FCA and Conceptual Graphs</title>
      <p>Briefly recall the main FCA notions and consider some links between concept lattices
and conceptual graphs.
2.1</p>
      <sec id="sec-2-1">
        <title>Standard Definitions</title>
        <p>
          There are two basic notions FCA deals with: formal context and concept lattice [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ].
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. The sets G and M are partially ordered by relations  and  ,
correspondingly: G= (G, ) , M  (M ,) . Formal context is 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 exist
mappings (which may be functions also) A : A  B and B : B  A with properties
of A : {m M | g, m  I  g  A} and B : {g G| g, m  I m B} then
the pair (A, B) that A  B, B  A is named as formal concept. The sets A and B are
closed by composition of mappings: A''  A, B ''  B ; A and B are called the extent and
the intent of a formal context K= (G, M , I ) , respectively.
        </p>
        <p>
          A conceptual graph is a finite oriented connected bipartite graph [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] which has
two different kinds of nodes: concepts and conceptual relations. Concept nodes may
have simple form representing entities and complex form representing entities (named
as referents) and their types. A type of entity indicates the class of the element
represented by the concept. A referent indicates the specific instance of the class
referred to by the node. For example, the concept &lt;Human: John&gt; has complex form
where “Human” is type and “John” is referent. Referents may be generic or
individual. Relation nodes also have two attributes: valence and type. Valence
indicates the number of the neighbor concepts of the relation, while the type expresses
the semantic role of each one.
        </p>
        <p>
          These two parameters of the CG model – the type of concept and valence of
relation – are used in our algorithms of CGs processing. Concept types constitute
hierarchically ordered set St, not necessarily a lattice [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. In the general case the set
of relations Sr is also ordered but relations in CGs acquired from texts represent
semantic roles which are not ordered.
        </p>
        <p>
          Here and henceforth we consider conceptual graphs have been acquired from texts
only. Those conceptual graphs become labeled graphs when types of concepts are
supported. In the previous example “Human” is the label for “John”. In the labeled
concept (g, l) with concept name g and its label l gG as possible element of the set
of objects in the formal context and l  St. There is the pattern structure introduced in
[
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] for concepts and labels: P = (G, (St, ), ), where  : G  St is a mapping. In this
structure St is a meet-semilattice. It is realized as a thesaurus with hierarchy of its
terms. This thesaurus is used for identifying CGs concepts and then for applying them
as objects in formal context.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Acquiring and implementing conceptual graphs in FCA</title>
        <p>
          The method of acquiring conceptual graphs from natural language texts is considered
in [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. Some peculiarities of conceptual graphs created with this method are
illustrated in [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].The method has standard phases of lexical, morphological and semantic
analysis extended with solution of the problem of Semantic Role Labeling. This
problem is non-trivial since semantic roles are not elements in the processed sentence and
must be discovered by means of morphological analysis. Solution of the problem of
Semantic Role Labeling is essential for building conceptual relations in CGs. As for
concepts of CGs, there are several approaches for extracting them from texts. Among
these approaches verb-oriented approach [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] has certain advantages. It is based on
discovering predicate constructions in the text. Resulting CG has usually central verb
as the main concept. A sub graph which has such main concept may be treated as
roughly representing semantics of the sentence.
        </p>
        <p>Filtering sentences. Except of using standard lexicographic operations on the set
of sentences (stemming, part-of-speech tagging, etc.) it is needed to filter sentences
according with previously established topics which will be represented in formal
context. Filtering means excluding some sentences from the set from which CGs have
been acquired. The simplest criterion for filtering is checking existence of key words
from the set St in the sentences of processing texts. Filtering is important for the texts
having free subject area. Problem–oriented texts usually have high determined topics
which makes them free from filtering. But filtering is needed if the number of topics
in a text is greater than ones were established for representing in formal contexts.</p>
        <p>Creating formal contexts. To construct formal context on the set of conceptual
graphs it is necessary to select one set of concepts as objects and other set of concepts
as object’s attributes. At the first glance, this problem seems simple: those concepts of
conceptual graphs which are connected by "attribute" relation have been put into
formal context as its objects and attributes. Actually the solution is much more complex.</p>
        <p>To illustrate this, consider an example of processing the sentence which is typical
in the learning of bacteria biotopes: B. cenocepacia strain HI2424 was recovered
from agricultural soil in upstate NY. Conceptual graph for this sentence is shown on
Fig. 1</p>
        <p>The sentence being analyzed is about bacterium named as Burkholderia
cenocepacia. Its name is used in the text in abbreviated form as B. cenocepacia and HI2424 is
the code of its strain. The decision that this sentence is about Burkholderia
cenocepacia may be found on the stage of analyzing and filtering sentences by learning the
algorithm to recognize bacteria names. If the context which has the names of bacteria
as an objects is creating, then the sub graph &lt;strain&gt; - (attribute) - &lt; cenocepacia &gt;
and two isolated concepts &lt;b.&gt; and &lt;hi2424&gt; do not participate in forming that
context.</p>
        <p>The verb “recover” is the key word which marks the predicate in conceptual graph
to be processed for creating formal context. The main meaningful attribute of
Burkholderia cenocepacia in the sentence is that it inhabits in the soil, more concrete
– in agricultural soil. The key word “soil” must be in the thesaurus containing
information about habitats of bacteria for marking the sub graph &lt;soil&gt; - (attribute) -
&lt;agricultural &gt; for using in the context. Then although the “attribute” conceptual relation
plays significant role in creating formal context it is not always applied in it. Another
conceptual relations - “location” and “patient” on Fig. 1 - also belong to the list of
important semantic roles. These relations produce possible attributes to formal context
(“upstate” and “NY”) which are not informative.</p>
        <p>
          Another problem in creating formal contexts is linking in one context objects and
attributes from different sentences. Its solution is connected with anaphora resolution
and described in [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ].
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Learning Bacteria Biotopes with FCA</title>
      <p>
        Bioinformatics is one of the fields where Data Mining and Text Mining applications
are growing up rapidly. New term of “Biomedical Natural Language Processing”
(BioNLP) has been introduced here. This term is stipulated by huge amount of
scientific publications in Bioinformatics and organizing them into textual databases and
corpora with access to full texts of articles via such systems as PubMed [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. There is
the innovation devoted to competitive solving BioNLP problems known as BioNLP
Shared Task. It started in 2009 and its last issue was in 2016 [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]. One of the BioNLP
Shared Tasks is learning of bacteria biotopes (BB-Task).
3.1
      </p>
      <sec id="sec-3-1">
        <title>Related work</title>
        <p>
          There are several solutions of BB-Task presented mainly in the BioNLP Shared Task
workshops; the recent proceedings of such workshops are in [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. Analyzing them,
we can formulate the following general approach to solving the BB-Task.
        </p>
        <p>BB-Subtasks. There are three subtasks in which the whole BB-Task is divided.</p>
        <p>The first subtask is named as Bacteria and habitat detection and categorization.
In this subtask biotope entities (names of bacteria) need to be detected in a given
biological text and must be mapped onto a given ontology.</p>
        <p>The second subtask, Entity and event extraction is devoted to event extraction from
texts. In this case the term “event extraction” corresponds to the Text Mining term
“fact extraction”. This subtask is focused on the single event “Lives_In” which
denotes the fact of living bacteria in certain environment (habitat): water, soil or other
organisms.</p>
        <p>The third subtask is named as Knowledge Base extraction. Here text processing
systems are evaluated for their capacity to build a knowledge base from the textual
corpus. Actually, as names of bacteria as its relations to the habitat must be detected
and enrich given ontology.</p>
        <p>All the diversity of BB-Task can be often transformed to two standard problems of
Named Entity Recognition (NER) and Relations Extraction (RE) on textual data.</p>
        <p>
          Information resources. Textual corpora, databases and ontologies have been
applied for storing data in BB-Task. Large ontology of biotopes called OntoBiotope [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ]
is applied for mapping detected data. From the BioNLP Shared Task 2013 up to now
more and more external information systems were used as external program
applications in the BB-Task solutions. Among them there are POS Tagging systems, Parsing
systems, Term Extraction systems, Named Entity Recognition systems. More
information about them can be found in [
          <xref ref-type="bibr" rid="ref18 ref22 ref24">18, 22, 24</xref>
          ].
        </p>
        <p>
          Methods. The current trend in solving BB-Task is using methods from Data
Mining and Text Mining areas of research. Subtasks of BB-Task is reformulated as the
tasks of data clustering or data classifying for applying appropriate methods of Data
Mining. Among these methods there are Support Vector Machine classifier [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ],
Conditional Random Fields [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ] and rule-based and ontology methods from computer
linguistics [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ].
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>FCA based solution</title>
        <p>Now any new solution of BB-Task may be classified in accordance to considered
framework of BB-Subtasks –Information Resources – Methods from previous section.
Our solution is classified by the following way.</p>
        <p>
          BB-Subtasks. Solving the first subtask of BB-Task, we extract the names of
bacteria from the textual corpus [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] which contains articles about bacteria. All the texts
were preliminary filtered as it is shown in the section 2.2. Extracted names of bacteria
are used in formal context and then in concept lattice. Concept lattices serve as known
frames of ontologies [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], so the mapping to ontology is presented. Here we solve the
NER task and it has direct solution with conceptual graphs. The only problem which
is here is anaphora resolution considered in [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ].
        </p>
        <p>We formulate the second subtask as Relations Extraction (RE) one. Using
conceptual graphs not only “Lives_In” relation but some others may be extracted. We
construct three formal contexts of “Entity”, “Areal” and “Pathogenicity”. In the “Areal”
context there is “Lives_In” relation linking objects and attributes. In other contexts of
“Entity” and “Pathogenicity” the “Attribute”, “Instrument”, “Location”, etc. semantic
roles are applied as relations for constructing these contexts – see examples above.</p>
        <p>Concept lattices which we create as data storage for our fact extraction system
together with the software of this system constitute the basis for constructing
knowledge base. So the elements of all three subtasks are presented in the FCA based
solution of BB-Task.</p>
        <p>
          Information resources. We had selected 130 mostly known bacteria and have
processed data from corresponding corpus [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. Formal contexts of “Entity”, “Areal”
and “Pathogenicity” have the names of bacteria as objects and corresponding concepts
from conceptual graphs as attributes. Among attributes there are bacteria properties
(gram-negative, rod-shaped, etc.) for “Entity” context, mentions of water, soil and
other environment parameters for “Areal” context and names and characteristics of
diseases for “Pathogenicity” context. Table 1 shows numerical characteristics of
created contexts.
        </p>
        <p>Context
name
Entity
Areal
Pathogenicity</p>
        <p>Number
of
objects
130
130
130</p>
        <p>Number of
attributes</p>
        <p>As it is followed from the table there is relatively small number of formal concepts
in the contexts. This is due to the sparse form of all contexts generated by conceptual
graphs.</p>
        <p>
          Methods. One of the problems in learning bacteria biotopes is the problem of
bacteria classification: it is needed to classify bacteria according with their properties
characterizing them as entities, characterizing their areal and pathogenicity. Various
bacteria may have similar properties or may not. It is interesting to find clusters of
bacteria containing ones having similar properties. This clustering task may be solved
with concept lattice. Every concept in concept lattice being the set of one or several
names of bacteria and their properties may be treated as fact. Facts can be extracted
by using navigation in the lattice and interpretation its concepts and hierarchical links
between them. For extracting facts and clustering we use visualization together with
database technique of processing input queries. Special functionality was created in
our system to visualize sub lattices of concept lattice to form special views consisted
of sub lattices corresponding to certain property (intent in the lattice) or entity (extent
in the lattice) of bacteria. We applied open source tool [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] which was modified and
integrated to our system [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ].
        </p>
        <p>Fig. 2 shows a fragment of the formal context with the attributes related to some
properties of bacteria: Gram staining, the property of being aerobic, etc.</p>
        <p>It is evident directly from the context that these 20 bacteria constitute two clusters
according to the Gram staining: there is no bacterium which is simultaneously
Grampositive and Gram-negative. Lattice diagrams on the Fig. 3 confirm this fact.</p>
        <p>Interpreting views on Fig. 3 we resolve that bacteria are clustered according with
their Gram staining because the views on Fig. 3 a) and b) do not intersect.
a)
b)</p>
        <p>Clustering bacteria according with the property of being aerobic is not evident
from the context on Fig. 2. Lattice diagrams on the Fig. 4 confirm the clustering
bacteria according with this property by the same manner as for Fig. 3.</p>
        <p>a)
b)
However, the number of bacteria in Fig. 3 and 4 is not the same: Fig. 3 contains all 20
bacteria (10 in Figure 3-a and 10 in Figure 3-b.) and Fig. 4 - contains only 9 bacteria.
This is due to the fact that the relevant texts do not contain information about the
property of being aerobic for some bacteria.</p>
        <p>
          We can compare our results with two known similar solutions related to fact
extraction problem. The first solution of extracting events is presented in [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] and is
based on using special framework of EventMine [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ]. This solution is realized as
marking the text by highlighting its lexical elements as elements of event.
        </p>
        <p>
          The second solution [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ] is directly connected with BioNLP. The tasks of NER
and RE were solved in [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ] with Alvis framework [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ] and results of relations
extraction are also presented as marked words in the texts. Table 2 shows Recall, Precision
and F-score calculated on the results of NER for Alvis framework in [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ] and for our
system.
        </p>
        <sec id="sec-3-2-1">
          <title>Alvis Our system</title>
        </sec>
        <sec id="sec-3-2-2">
          <title>Recall</title>
          <p>0.52
0.42
The Precision / Recall ratio is more informative for evaluating the quality of solution
of many problems in Data Mining. On the Fig. 5 it is shown such ratio calculated for
62 bacteria names extracted from texts in one of our experiments.</p>
          <p>As it is followed from the Fig. 5, approximately half of the total number of objects
has Precision / Recall ratio equal to unity that characterizes our solution as not bad.</p>
          <p>Comparing our current results of fact extraction with the known ones we also have
to resume that using concept lattice provides principally another variant of solution of
fact extraction problem. The main difference of this solution is that it is not realized in
the processed text by highlighting its lexical elements but it is realized with new
external resource, conceptual model in the form of concept lattice.
4</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusions and future work</title>
      <p>This paper describes the idea of joining two paradigms of conceptual modeling
conceptual graphs and concept lattices. Current results of realizing this idea on textual
data show its good potential for knowledge extraction. Concept lattice may serve as a
frame of ontology constructed on texts. Its data which may or may not be interpreted
as facts constitutes a knowledge stored in concept lattice being ready to extract.</p>
      <p>In spite of certain useful features of presented technology there are some problems
which need to be solved for improving the quality of modeling technique.
1. Conceptual graphs acquired from texts contain many noisy elements. Noise is
constituted by the text elements that contain no useful information or cannot be
interpreted as facts. Noisy elements significantly decrease efficiency of algorithms of
fact extraction.
2. The next stage of developing current technology is creating of fledged information
system which processes user queries and produces solutions of certain tasks on
textual data. Not only visualization but also special user oriented interfaces to concept
lattice will be created in this system.</p>
      <p>Acknowledgments. The paper concerns with the work partially supported by the
Russian Foundation for Basic Research, grant № 15-07-05507.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Priss</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <article-title>Linguistic Applications of Formal Concept Analysis</article-title>
          . In: Ganter; Stumme; Wille (eds.),
          <source>Formal Concept Analysis, Foundations and Applications</source>
          . Springer Verlag.
          <source>LNAI 3626</source>
          , p.
          <fpage>149</fpage>
          -
          <lpage>160</lpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Carpineto</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romano</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Using Concept Lattices for Text Retrieval and Mining</article-title>
          . In B. Ganter, G. Stumme, and R. Wille (Eds.):
          <source>Formal Concept Analysis: Foundations and Applications. Lecture Notes in Computer Science 3626</source>
          , pp.
          <fpage>161</fpage>
          -
          <lpage>179</lpage>
          . Springer-Verlag, Berlin, (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Kuznetsov</surname>
            <given-names>S. O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Strok</surname>
            <given-names>F. V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ilvovsky</surname>
            <given-names>D. A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Galitsky</surname>
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Improving Text Retrieval Efficiency with Pattern Structures on Parse Thickets // Proceedings of the FCAIR</article-title>
          . Vol.
          <volume>977</volume>
          . M.: CEUR Workshop Proceeding, pp.
          <fpage>6</fpage>
          -
          <lpage>21</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Otero</surname>
            <given-names>P. G.</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>Automatic Acquisition of Formal Concepts from Text</article-title>
          .
          <source>Journal for Language Technology and Computational Linguistics</source>
          , vol.
          <volume>23</volume>
          (
          <issue>1</issue>
          ), pp.
          <fpage>59</fpage>
          -
          <lpage>74</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Meštrović</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Semantic Matching Using Concept Lattice</article-title>
          .
          <source>Proc. Concept Discovery in Unstructured Data</source>
          ,
          <source>(CDUD-2012)</source>
          , pp.
          <fpage>49</fpage>
          -
          <lpage>58</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Cimiano</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Hotho</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Staab</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis</article-title>
          .
          <source>Journal of Artificial Intelligence Research</source>
          , Volume
          <volume>24</volume>
          , pp.
          <fpage>305</fpage>
          -
          <lpage>339</lpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Wille</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <article-title>Conceptual Graphs and Formal Concept Analysis</article-title>
          .
          <source>Proceedings of the Fifth International Conference on Conceptual Structures: Fulfilling Peirce's Dream</source>
          , pp.
          <fpage>290</fpage>
          -
          <lpage>303</lpage>
          . Springer-Verlag, London (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Galitsky</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dobrocsi</surname>
            , G., de la Rosa,
            <given-names>J.L.</given-names>
          </string-name>
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          <article-title>From Generalization of Syntactic Parse Trees to Conceptual Graphs</article-title>
          . In: M.
          <string-name>
            <surname>Croitoru</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Ferre</surname>
          </string-name>
          , D. Lukose, Eds., Conceptual Structures: From Information to Intelligence,
          <source>Proc. 18th International Conference on Conceptual Structures (ICCS 2010), Lecture Notes in Artificial Intelligence</source>
          (Springer), vol.
          <volume>6208</volume>
          , pp.
          <fpage>185</fpage>
          -
          <lpage>190</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <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>
          </string-name>
          , R., eds.:
          <source>Formal Concept Analysis: Foundations and Applications, Lecture Notes in Artificial Intelligence, No. 3626</source>
          , Springer-Verlag (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Sowa</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          :
          <source>Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley</source>
          , London (
          <year>1984</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Chein</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mugnier</surname>
            ,
            <given-names>M.L.</given-names>
          </string-name>
          :
          <article-title>Conceptual graphs are also graphs</article-title>
          .
          <source>Technical Report RRIChein-95</source>
          , LIRMM (
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Ganter</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          :
          <article-title>Pattern structures and their projections</article-title>
          .
          <source>In Harry S. Delugach and Gerd Stumme</source>
          , editors,
          <source>Concept. Struct. Broadening Base</source>
          , volume
          <volume>2120</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>129</fpage>
          -
          <lpage>142</lpage>
          . Springer, Berlin, Heidelberg (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Bogatyrev</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tuhtin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Creating conceptual graphs as elements of semantic texts labeling</article-title>
          .
          <source>In: Computational Linguistics and Intellectual Technologies. Proc. Int</source>
          . Conference “Dialogue”. Moscow, pp.
          <fpage>31</fpage>
          -
          <lpage>37</lpage>
          (in Russian) (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Mikhail</surname>
          </string-name>
          <article-title>Bogatyrev: Conceptual Modeling with Formal Concept Analysis on Natural Language Texts</article-title>
          .
          <article-title>Proceedings of the XVIII International Conference «Data Analytics and Management in Data Intensive Domains»</article-title>
          .
          <source>CEUR Workshop Proc</source>
          . Vol.-
          <volume>1752</volume>
          , pp.
          <fpage>16</fpage>
          -
          <lpage>23</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Mikhail</surname>
            <given-names>Bogatyrev</given-names>
          </string-name>
          , Kirill Samodurov:
          <article-title>Framework for Conceptual Modeling on Natural Language Texts</article-title>
          .
          <source>Proc. Int. Workshop on Concept Discovery in Unstructured Data (CDUD 2016) at the Thirteenth International Conference on Concept Lattices and Their Applications</source>
          . Moscow,
          <year>2016</year>
          .
          <source>CEUR Workshop Proc</source>
          . Vol.-
          <volume>1625</volume>
          . pp.
          <fpage>13</fpage>
          -
          <lpage>24</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>16. U.S. National Library of Medicine. http://www.ncbi.nlm.nih.gov/pubmed</mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Bossy</surname>
            <given-names>R</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jourde</surname>
            <given-names>J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manine</surname>
            <given-names>A-P</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Veber</surname>
            <given-names>P</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alphonse</surname>
            <given-names>E</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Van De Guchte</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bessières</surname>
            <given-names>P</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nédellec</surname>
            <given-names>C</given-names>
          </string-name>
          :
          <article-title>BioNLP 2011 Shared Task - The Bacteria Track</article-title>
          .
          <source>BMC Bioinformatics</source>
          ,
          <volume>13</volume>
          :
          <issue>S8</issue>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Bossy</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Golik</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ratkovic</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          , Bessi`eres, P., and N´edellec, C.:
          <article-title>BioNLP shared Task 2013 - An Overview of the Bacteria Biotope Task</article-title>
          .
          <source>In Proceedings of the BioNLP Shared Task 2013 Workshop</source>
          , pages
          <fpage>161</fpage>
          -
          <lpage>169</lpage>
          , Sofia, Bulgaria. ACL. (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>ConExp-NG</surname>
          </string-name>
          . https://github.com/fcatools/conexp-ng
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Miwa</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ananiadou</surname>
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Adaptable, high recall, event extraction system with minimal configuration</article-title>
          .
          <source>BMC Bioinformatics</source>
          ,
          <volume>16</volume>
          (
          <issue>10</issue>
          ):
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Ratkovic</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Golik</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Warnier</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Event extraction of bacteria biotopes: a knowledgeintensive NLP-based approach</article-title>
          .
          <source>- BMC Bioinformatics</source>
          ,
          <volume>13</volume>
          , (
          <issue>Suppl 11</issue>
          ): S8, pp.
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <article-title>The 4th BioNLP Shared Task</article-title>
          . http://2016.bionlp-st.org
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <source>Proceedings of the 4th BioNLP Shared Task Workshop</source>
          . Berlin, Germany,
          <year>August 13</year>
          ,
          <year>2016</year>
          . http://aclweb.org/anthology/W/W16/W16-30.pdf
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Pontus</surname>
            <given-names>Stenetorp</given-names>
          </string-name>
          , Wiktoria Golik, Thierry Hamon, Donald C. Comeau, Rezarta Islamaj Dogan, Haibin Liu, W. John Wilbur: BioNLP Shared Task 2013:
          <article-title>Supporting Resources</article-title>
          .
          <source>In Proceedings of the 3d BioNLP Shared Task Workshop</source>
          . (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <article-title>OntoBiotope ontology</article-title>
          . http://genome.jouy.inra.fr/bibliome/MEM-OntoBiotope/
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Bjorne</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Salakoski</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          (
          <year>2011</year>
          ).
          <article-title>Generalizing biomedical event extraction</article-title>
          .
          <source>In Proceedings of BioNLP Shared Task 2011 Workshop</source>
          . ACL. (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Parisa</surname>
            <given-names>Kordjamshidi</given-names>
          </string-name>
          , Wouter Massa, Thomas Provoost,
          <string-name>
            <surname>Marie-Francine Moens</surname>
          </string-name>
          :
          <article-title>Machine Reading for Extraction of Bacteria and Habitat Taxonomies</article-title>
          . In: Fred A.,
          <string-name>
            <surname>Gamboa</surname>
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Elias</surname>
            <given-names>D</given-names>
          </string-name>
          . (eds.)
          <article-title>Biomedical Engineering Systems and Technologies</article-title>
          .
          <source>Communications in Computer and Information Science</source>
          , vol.
          <volume>574</volume>
          . Springer, pp.
          <fpage>239</fpage>
          -
          <lpage>255</lpage>
          . (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Karadeniz</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Ozgur</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Bacteria biotope detection, ontology-based normalization, and relation extraction using syntactic rules</article-title>
          .
          <source>In Proceedings of the BioNLP Shared Task 2013 Workshop</source>
          , pages
          <fpage>170</fpage>
          -
          <lpage>177</lpage>
          , Sofia, Bulgaria. ACL. (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <article-title>EventMine framework</article-title>
          . http://www.nactem.ac.uk/EventMine/
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <article-title>Alvis system</article-title>
          . http://www.quaero.org/module_technologique/alvis-nlp
          <article-title>-alvis-naturallanguage-processing/</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>