<!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>Issues of Fact-based Information Analysis</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Natalia Sharonova</string-name>
          <email>nvsharonova@ukr.net</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anastasiia Doroshenko</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Olga Cherednichenko</string-name>
          <email>olha.cherednichenko@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>National Technical University “Kharkiv Polytechnic Institute”</institution>
          ,
          <addr-line>2, Kyrpychova str., 61002 Kharkiv</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>With the recent growth of Internet, mobile and social networks the spread of fake news and click-baits increases drastically. Today, the fact retrieval system is one of the most effective tools for identifying the information for decision-making. We propose the approach based on factual information systematization. Different interpretations of the same phenomenon, as well as the inconsistency, inaccuracy or mismatch in information coming from different sources, lead to the task of factual information extraction. In this work, we explore how can natural language processing methods help to check contradictions and mismatches in facts automatically. The reference model of the factbased analytical system is proposed. It consists of such basic components as Document Search component, Fact retrieval component, Fact Analysis component, Visualization component, and Control component.</p>
      </abstract>
      <kwd-group>
        <kwd>Fact</kwd>
        <kwd>Natural Language Processing</kwd>
        <kwd>Information extraction</kwd>
        <kwd>Comparator identification</kwd>
        <kwd>Predicate</kwd>
        <kwd>Reference model</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The access to the Internet, as well as to social networks has been simplified for the
last decade. It has led to information flow growth. Social networking sites give an
opportunity for users to share content freely. As a consequence, fake news, hoaxes,
and click-baits are spread, circulated, consumed and shared without critical thinking
or fact checking. Regardless the form, the reverberations of inaccurate or misleading
information could lead to major risks for the society.</p>
      <p>
        Misinformation can be spread both intentionally and accidentally. Among the
interested stakeholders of fake information are politicians, marketing managers, sellers,
and users with unclear purposes. In media politicians use alternative facts and
posttruths in order to manipulate their audience`s opinions creating thus long-term
sustainable mindsets. Alternative facts are information with no basis in reality while
post-truth technics are defined as beyond the truth or irrelevant information [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>As for social networking sites, there are several sources of fake information search.
Users’ profiles contain a lot of misinformation. In many instances it is difficult to
match pages of the same user at different social networks because of a clash in
personal information. As well as that it is impossible to assess reliable posts presented in
the newsfeed.</p>
      <p>E-commerce is another sphere where fake information is common. Sellers at
market places present the name and the description of products. The same product can be
described in different ways by different sellers. Apart from that, sellers, in order to
present their products at as many search requests as possible sellers use clashing
information.</p>
      <p>Thus, the problem of identifying and verifying contradictory or ambiguous
information is crucial. The key idea of our work is to develop an approach for checking
contradictions and mismatch in facts automatically.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Works</title>
      <p>In recent years, the reliability of information on the Internet has decreased
significantly. It is particularly noticeable on social networks, where distorted, inaccurate or
false information reaches and affects millions of users within minutes. Therefore the
problem of fake information detection has become a popular research sphere. There
are several challenges to automatic detection of fake news: determining if the facts in
the news article are correct; analyzing the relations between the article headline and
article body; estimating the inherent bias of a written text etc. Factual analysis of the
text is designed to make possible the intellectual analysis of data extracted from the
text flow. The solution of this task should lead to a synergistic effect, to the possibility
of using existing information technologies.</p>
      <p>
        The paper [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] presents the analysis of hoax medical news in social media is
presented. The stance classification is implemented in hoax analysis particularly with
media contents. An interesting framework has been developed to crosscheck claims
against fact-checks. In order to check the news in social networks, one important
concept emerges in the paper [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. In each post in the newsfeed, the “fact” should be
identified. However, in many situations, it is impossible to identify whether some part of
the information is a fact or not. Each fact is composed of something that has happened
at some time, somewhere, possibly to someone.
      </p>
      <p>
        The work [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] proposes an infrastructure to address phenomena of modern online
media production, circulation, and manipulation by establishing a distributed
architecture for automatic processing and human feedback. A hybrid technology
infrastructure that provides user- and machine-generated annotations on top of the whole World
Wide Web is proposed. The ultimate goal of the proposed approach is enable internet
users to handle fake news and other online media phenomena by providing both
automatic assessments of content and by including alternative opinions into the
process of media consumption. The paper [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] discusses the role of computational social
scientists in the fight against digital misinformation. Clarify the fundamental
mechanisms that make us vulnerable to misinformation online, as well as devise effective
strategies to counteract misinformation. There is a growing interest in automating the
various activities that revolve around fact-checking. The fact-checking automating
includes newsgathering, verification and delivery of corrections.
      </p>
      <p>
        The need for automatic hoax detection systems is a vital task. In the paper [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] they
develop an approach which allows classifying posts in a social network with high
accuracy as hoaxes or non-hoaxes on the basis of the users who “liked” them. Two
classification techniques are presented. One technique is based on logistic regression,
and the other one is based on a novel adaptation of Boolean crowdsourcing
algorithms. It was proved that both techniques are robust: they work even when the users'
attention is limited to the users who like both hoax and non-hoax posts. These results
suggest that mapping the diffusion pattern of information can be a useful component
of automatic hoax detection systems.
      </p>
      <p>
        The goal of the paper [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] is to present a description of UCL Machine Reading’s
model employed during fake news detection. The presented stance detection model is
a single, end-to-end system consisting of lexical and similar features fed through a
multi-layer perceptron with one hidden layer. Being relatively simple in nature, the
model performs on par with more elaborate, ensemble-based systems of other teams.
      </p>
      <p>
        In the paper [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] they analyze the link between the article headline and the article
body in order to detect whether the presented news is fake or not. Several neural
network architectures were explored for stance detection in news articles. The
attentionbased models, in particular, a variation of the Attentive Reader Model (ARM2) work
properly for this task. The given model evaluates each prediction in a two-step
process. The first step is to compare the headline and the body and classify as related or
unrelated. The second step is to classify related head-body combinations as agrees,
disagrees, or discusses.
      </p>
      <p>
        The research [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] is oriented on fake news detection. “Fake news detection” is
defined as the task of categorizing news. The paper discusses a typology of several
varieties of veracity assessment methods emerging from two major categories –
linguistic cue approaches and network analysis approaches. The paper [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] aims to enable the
identification of deliberately deceptive information in text-based online news.
Proposed system can alert users to deceptive news in the incoming news stream and
prompt users to further fact-check suspicious instances. It is an information system
support applied a vector space model to cluster the news.
      </p>
      <p>There are number approaches of information extraction from natural languages
texts. We can highlight lack of automated semantic understanding and low
consistency of extracted facts. Despite of existing data extraction solutions the task of
extracting facts still is not solved.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Methodology</title>
      <p>Today, the fact retrieval system is one of the most effective tools for identifying
the information for decision-making. When you refer to something as a fact you mean
that you think it is true or correct. Factual information is information based on facts or
relating to the facts. The reliability of automatically extracted facts is the main
problem of processing factual information. It is especially important because of increasing
density of text information flow in mass media and various social networks, forums
and blogs. Different interpretations of the same phenomenon, as well as the
inconsistency, inaccuracy or mismatch in information coming from different sources lead to
the task of factual information extraction.</p>
      <p>We can consider facts as structured objects. This record describes real-world entity
with its attributes mentioned in text, usually, who did what to whom, where and
when. So, the fact can be extracted from the textual information and can determine
the attributes of the object or the relations between objects. The task of Information
Extraction is to identify instances, relations, events and their relevant properties in
natural language texts. We consider two types of facts. They can be described as
triplets. The first kind of fact is a “Subject -&gt; Relation -&gt; Object”, where the subject is
who acts, the relation defines action with the object. The second kind of fact is a
triplet: “Object-Attribute-Value”, where the object is the entity about which the fact is
fixed. The attribute is predetermined characteristic that identifies the object with the
certain values.</p>
      <p>The extraction of facts from weakly structured textual information includes the
following steps:</p>
      <p>1) Entity Extraction – extract words or phrases that are important for describing the
meaning of the text (lists of terms of the subject domain, personalities, organizations,
geographical names, etc.);</p>
      <p>2) Feature Association Extraction is searching the links between the entities
extracted;</p>
      <p>3) Event and Fact Extraction is extraction of entities, recognition of facts and
actions.</p>
      <p>To implement the entity extraction, a standard linguistic processor is used. The
issue is the extraction of information about the relations between entities. For this
purpose we need to define a certain template that reflects the semantic links in the
sentence. Based on the fact definition, it is possible to define the minimal semantic unit
of factual search, which is a triad: agent-predicate-value. That is, the record of factual
information must include a pointer to the fact search agent, the attribute or predicate
of this object, and give a specific value of this attribute.</p>
      <p>Such a definition makes it possible to extract concepts from weakly structured text
sources of information and to represent relations between them in a structured way.
The resulting structure is facts, both in the form of fairly simple concepts: keywords,
personalities, organizations, geographical names, and in a more complex form, for
example, the name of the person with her job and occupation.</p>
      <p>
        Algebra of finite predicates is used as a mathematical tool for describing discrete,
determinate and finite objects or processes from real world [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ]. We use this math
scheme to represent knowledge extracted from natural language texts:
- text information objects;
- the entity of the subject domain,
- grammatical and semantic characteristics of the text units.
      </p>
      <p>
        An analysis showed that the most natural and convenient tool for modeling natural
language relations is the algebra of finite predicates that operates with letter variables
[
        <xref ref-type="bibr" rid="ref10 ref12">10, 12</xref>
        ]. This tool meets all the requirements for linguistic formalisms. In this case,
all kinds of morphological processing lead to the solution of algebraic equations with
different initial data (fully or partially specified). Having an algorithm for solving
these equations, the formalization of various processes of word processing can be
greatly simplified. The possibility of equivalent transformations and minimization of
the morphological model are available in this approach. Besides that the commonality
of expressive means makes it convenient to analyze different fragments of the model.
      </p>
      <p>
        Mathematical relation is the basic concept of logical mathematics. A logical
network is a processor and it performs various actions on relationships [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Relations
express the attributes of objects and the connections between them. They are a
universal means of describing any objects. The human language, as a means of
communication, is only a means for expressing relationships. Speaking to other people, we
convey to them the meaning of the sentence, which is an attitude. The exchange of
thoughts between people is carried out only through the transfer of relations. Each
thought represents some relation. Perceiving objects and events of the external world,
we get information about them in the form of relationships.
      </p>
      <p>Any relation can be interpreted meaningfully as knowledge about the fact,
expressed by some utterance. The fact is an exhaustive description of the actual state of
all places interested to us. Knowledge of the fact only limits the many possible states
of places. A statement about a fact can be true or false. It is true if the characterizing
relation contains the actual set of place states and otherwise is false.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Our approach</title>
      <p>
        The model of fact extraction from natural language text can be presented in the
following way. The fact is considered as a triplet: “Subject -&gt; Predicate -&gt; Object”. The
predicate defines a relation, and the subject and object defines two entities. In the
developed model we introduce a set of grammatical characteristics of the sentence
words. To represent the triplet of fact we use approach proposed in [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ].
      </p>
      <p>
        We suggest the model of facts extracting based on the method of comparator
identification [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. It allows matching the data and the template. It is based on the relation
between the words and the placement of these words in the text. This method
represents the extraction process as a human intelligent activity since a human looking
through a text can easily determine whether it corresponds to the template or not and
catch attributes of a fact.
      </p>
      <p>We discover that the descriptions of the same commodities in the trading platforms
can be presented in a different way. We notice that such description can be presented
as a triplet “object-attribute-value”. So, we can consider the second kind of facts. The
description of commodity is represented as number of words; usually it is not a
sentence, and a table with some characteristics of commodity.</p>
      <p>Let E – be the set of structural elements of a web page, W – the set of words.
Then RSEARCH  E W – is the binary relation "is used for search". Let Eq  E –
the set of elements of the web page that are selected for estimation and Wq  W – a
set
of
words that
match
the topic
of the
search.</p>
      <p>Binary
relation
RSEARCH  eqi ,wqj | eqi  Eq ,wqj W  defines a "word-element" pairs. For that
q
pair, the words belong to the set of words which correspond to the topic and the
elements which belong to a set of selected elements.</p>
      <p>Let wpj Wp – a set of words extracted from the web page. Then the predicate
which evaluates the binary of "element-word" pair:</p>
      <p>1, if (eqi , wpj )  RSEARCH ,
Pw  eqi , wpj   </p>
      <p>0, if (eqi , qpj )  RSEARCH .</p>
      <p>The predicate that defines the presence of control words in a particular element:
Pe eqi   Pw eqi , wp1  Pw eqi , wp2  ...  Pw eqi , wpn .</p>
      <p>The web page estimation combines the estimates for each item and determined by
the predicate:</p>
      <p>Pq  Peq1  Peq2  ... Pe </p>
      <p>qs .</p>
      <p>The page estimation is based on a data source model. The presence of different
combinations of words in different combinations of elements of the web page is
estimated. Let RSOURCE  E  W – be a binary relation "is used for sources selection",
this is given as follows:</p>
      <p>RSOURCE  ei ,wj | ei  Es ,wj  wqi ,wqi W 
q ,
where wqi – set of words according to the element ei .</p>
      <p>The predicate that estimates a pair of "element-words" is defined as:</p>
      <p>1, if (ei , p p )  RSOURCE ,
P  ei , w j   </p>
      <p>0, if (ei , p p )  RSOURCE .</p>
      <p>The predicate that estimates an item using different word combinations:
P( ei )  ( P( ei ,wp1 )  P( ei ,wp2 )  ...  P( ei ,wpj )) ( P( ei ,wpj1 )  ...)  ...
Web page estimation for various combinations of elements is given by predicate:
PS  ( P( e1 )  P( e2 )  ...  P( es ))  ( P( e j )  ...)  ...</p>
      <p>The binary relation "elements and corresponding words that were extracted from
the source page for representation the template model,
RPAGE  E  W ,
RPAGE  ( e1 , w1 ),...,( es , wj ). The function of transforming the word
combinations into a value template from the set of "standards" C  c1 ,...,cm  is given as:
c1, if (wi1  wi2  ...)  (wj1  wj2  ...)  ...</p>
      <p>
(ei , wj )  RPAGE : F(ei )  ...</p>
      <p>cm, if (wim  wim  ...)  (wjm  wjm  ...)  ...</p>
      <p> ei ,c j | ei  E p ,c j  C.
set C  c1,..., c m </p>
      <p>A set of elements of a web page that contains a certain standard of a
is given as E p  e j  E | c  F( e j ),c  C. Let
RPATTERN  E  C – the binary relation "elements contain benchmarks", at the same
The template predicate looks like:</p>
      <p>1, if (e1e2e3 (E(e1, eF )  E (e2 , eI )  E (e3 , eO )))  1,
Ppattern  </p>
      <p>0, in other case.
where</p>
      <p>E( e1 ,eF )  1, e  EF , ,
0, e  EF ;</p>
      <p>1, e  E ,
E( e2 ,eI )   I
0, e  E ;</p>
      <p>I
,
and
E( e3 ,eO )  1, e  EO ,</p>
      <p>0, e  EO .</p>
      <p>Let K  k j  – a set of indicators that are relevant to this signs, then the predicate
M ( k ,k j ) determines, whether the summary template has indicator k j from this
set. Let I  i  – the set of indicators according to the given one, then predicate
M ( i,i ) determines whether the generic template contains the data for this indicator
i .</p>
      <p>We can propose the reference model to factual information retrieval and analysis
(fig.1). The main concepts are facts that are some knowledge about real-world
objects, web-pages which contain text, indicators for representing attributes, and values
of those attributes. The appropriate models must formalize the factual data processing.</p>
      <p>In order to realize proposed reference model, the software should be developed.
We suggest the basic components which are presented in figure 2. The developed
software consists of such basic components as Document Search component, Fact
retrieval component, Fact Analysis component, Visualization component, and Control
component. Our future work is to make implementing and experimenting with the
proposed model.</p>
      <p>Summarizing, we can say that factual analysis is a rather complex system that has
great potential and functionality. The tasks under which the data are built are designed
to facilitate the work of analysts, to carry out filtration as well as structuring of huge
volumes of information, which in our time are one of the main tasks of a person.</p>
      <p>As result, we can underline that the task of identifying instances, relations, events
and their relevant properties in natural language texts is still live issue. In general, we
consider two kinds of facts. Despite existing data extraction solutions the task of
extracting facts still is not solved. We propose to use predicate algebra and method of
comparator identification to create a model of searching and extracting factual data.
The future work will be devoted to research the similarity of facts and mismatch
identification. We hope to develop a mathematical tool based on the relation of tolerance
to make a conclusion about similarity or mismatch in the set of extracted facts.
6</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Mauridhi</given-names>
            <surname>Hery</surname>
          </string-name>
          Purnomo et al.,
          <article-title>Biomedical Engineering Research in the Social Network Analysis Era: Stance Classification for Analysis of Hoax Medical News in Social Media</article-title>
          / Procedia Computer Science 116,
          <year>2017</year>
          , pp.
          <fpage>3</fpage>
          -
          <lpage>9</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Álvaro</given-names>
            <surname>Figueira</surname>
          </string-name>
          , Luciana Oliveira,
          <article-title>The current state of fake news: challenges</article-title>
          and opportunities / Procedia Computer Science 121,
          <year>2017</year>
          , pp.
          <fpage>817</fpage>
          -
          <lpage>825</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Georg</given-names>
            <surname>Rehm</surname>
          </string-name>
          ,
          <article-title>An Infrastructure for Empowering Internet Users to Handle Fake News and Other Online Media Phenomena / An Infrastructure for Empowering Internet Users</article-title>
          ,
          <year>2017</year>
          , pp.
          <fpage>216</fpage>
          -
          <lpage>231</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Giovanni</given-names>
            <surname>Luca</surname>
          </string-name>
          <string-name>
            <surname>Ciampaglia</surname>
          </string-name>
          ,
          <article-title>Fighting fake news: a role for computational social science in the fight against digital misinformation /</article-title>
          <source>J Comput Soc Sc</source>
          (
          <year>2018</year>
          )
          <volume>1</volume>
          :
          <fpage>147</fpage>
          -
          <lpage>153</lpage>
          , https://doi.org/10.1007/s42001-017-0005-6
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>E.</given-names>
            <surname>Tacchini</surname>
          </string-name>
          , G. Ballarin,
          <string-name>
            <given-names>M. L. Della</given-names>
            <surname>Vedova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Moret</surname>
          </string-name>
          and L. de Alfaro,
          <article-title>"</article-title>
          <source>Some Like it Hoax: Automated Fake News Detection in Social Networks,"</source>
          Cornell University, New York, USA,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>B.</given-names>
            <surname>Riedel</surname>
          </string-name>
          , I. Augenstein,
          <string-name>
            <given-names>G. P.</given-names>
            <surname>Spithourakis</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Riedel</surname>
          </string-name>
          ,
          <article-title>"A simple but tough-to-beat baseline for the Fake News Challenge stance detection task,"</article-title>
          Cornell University, New York, USA,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>N.</given-names>
            <surname>Rakholia</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Bhargava</surname>
          </string-name>
          , "“Is it true?”
          <article-title>- Deep Learning for Stance Detection in News,"</article-title>
          Stanford University, California, USA,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>N. J.</given-names>
            <surname>Conroy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. L.</given-names>
            <surname>Rubin</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <article-title>"Automatic Deception Detection: Methods for Finding Fake News," in Proceedings of the 78th ASIS&amp;T Annual Meeting: Information Science with Impact: Research in and for the Community</article-title>
          , Missouri, USA,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Rubin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Conroy</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <source>Towards News Verification: Deception Detection Methods for News Discourse</source>
          .
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Bondarenko</surname>
            <given-names>M. F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shabanov-Kushnarenko U</surname>
          </string-name>
          . P. Theory of intelligence: a Handbook //SMIT Company, Kharkiv. -
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Nina</surname>
            <given-names>Khairova</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Natalia</given-names>
            <surname>Sharonova</surname>
          </string-name>
          .
          <article-title>Use of Predicate Categories for Modelling of Operation of the Semantic Analyzer of the Linguistic Processor</article-title>
          ./Proceedinga of IEEE EASTWest Design &amp; Test
          <string-name>
            <surname>Symposium</surname>
            <given-names>EWDTS</given-names>
          </string-name>
          '
          <volume>09</volume>
          (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Khairova</surname>
            ,
            <given-names>N.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Petrasova</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gautam</surname>
            ,
            <given-names>A.P.S.:</given-names>
          </string-name>
          <article-title>The logical-linguistic model of fact extraction from English texts</article-title>
          . In: Dregvaite,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Damasevicius</surname>
          </string-name>
          ,
          <string-name>
            <surname>R</surname>
          </string-name>
          . (eds.)
          <article-title>ICIST 2016</article-title>
          .
          <article-title>CCIS</article-title>
          , vol.
          <volume>639</volume>
          , pp.
          <fpage>625</fpage>
          -
          <lpage>635</lpage>
          . Springer, Cham (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Khairova</surname>
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lewoniewski</surname>
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Węcel</surname>
            <given-names>K.</given-names>
          </string-name>
          (
          <year>2017</year>
          )
          <article-title>Estimating the Quality of Articles in Russian Wikipedia Using the Logical-Linguistic Model of Fact Extraction</article-title>
          . In: Abramowicz W. (eds)
          <article-title>Business Information Systems</article-title>
          .
          <source>BIS 2017. Lecture Notes in Business Information Processing</source>
          , vol
          <volume>288</volume>
          . Springer, Cham
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Cherednichenko</surname>
            <given-names>O.</given-names>
          </string-name>
          ,
          <source>Yanholenko O. Information Technology of Web-Monitoring and Measurement of Outcomes in Higher Education Establishment //EuroSymposium on Systems Analysis and Design</source>
          . - Springer International Publishing,
          <year>2015</year>
          . - P.
          <fpage>103</fpage>
          -
          <lpage>116</lpage>
          . (http://dx.doi.org/10.1007/978-3-
          <fpage>319</fpage>
          -24366-
          <issue>5</issue>
          _8)
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>