<!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>Automatic Selection of Verbs-Markers for Segmentation Task of Process Descriptions in Natural Language Texts</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Varvara A. Krayvanova</string-name>
          <email>krayvanova@yandex.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Altai State Technical University</institution>
          ,
          <addr-line>Barnaul</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <fpage>64</fpage>
      <lpage>68</lpage>
      <abstract>
        <p>The paper presents the intermediate results of the research, the final goal of which is to develop the universal algorithm for process diagrams automatic visualization by text description of these processes. The purpose of this study is to check the use of verbs as markers for the semantic labeling of long fragments in scientific texts.</p>
      </abstract>
      <kwd-group>
        <kwd>automatic text fragmentation</kwd>
        <kwd>text mining of scientific texts</kwd>
        <kwd>verbs-markers</kwd>
        <kwd>dynamic text parameters</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>An effective system of collecting, storage and data processing of scientific
observations will raise any natural-science research to essentially new level. The
description of objects and procedures is presented in the form of natural
language texts. Therefore automatic transformation of texts into more effective
representations (such as activity diagrams, state diagrams, use case diagrams,
IDEF0 diagrams, etc.) is required to reduce the cost of specialized information
systems creation.</p>
      <p>
        Current researches in the field of process descriptions extraction from
natural language texts are oriented to work with the news bulletins [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] or with other
objects from a very narrow areas [
        <xref ref-type="bibr" rid="ref2 ref3">2,3</xref>
        ]. The similar situation is beheld with the
problem of process visualization [
        <xref ref-type="bibr" rid="ref4 ref5">4,5</xref>
        ]. These algorithms assume the texts of the
small length containing concentrated information of a certain type. Researches
in the field of text processing for arbitrary structure and size are usually
oriented to extraction of objects, instead of processes, for example, on ontologies
construction[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. To generalize existing algorithms of processes extraction to the
long natural language texts we have to use automatic segmentation and
semantic marking of the text to find places, suitable for these algorithms usage. The
objects of this research include long scientific, regulatory and educational texts
(articles, tutorials, monographs).
      </p>
      <p>To reach these goals, it is necessary to allocate text fragments with various
assignments:
– static (descriptions of objects, definitions) for ontology extraction;
– dynamic (description of processes, techniques and research procedures) for
activity diagrams and other process diagrams extraction.</p>
      <p>
        A text can be divided into various fragments of these types with the use of
clustering on the base of statistical analysis of parts of speech distribution[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
We simulated the reading process by the sliding window method (window is the
sequence of the length L of consecutive sentences). As clustering parameters,
for each window the total number of words and the number of various words
separately for nouns, verbs and adjectives are calculated. The studies of the
various parameters distribution in long texts are focused mainly on the definition
of the author [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. This method allows to divide scientific texts into fragments of
the types described above. For automatic illustration we have to find a way to
define fragments types. One possible way of solving this problem is to analyze
the distribution of verbs in the text. There are usually much less various verbs
than nouns in the texts, especially in business and scientific ones[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
Linguistic verbs classifications, e.g. the one given in the dictionary of linguistic terms
by Rosenthal[
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], are not good enough for extracting information from
scientific texts. In scientific style, quite narrow verbs segments are applied, therefore
linguistic classifications can be called excessive. Besides, used verbs and their
meaning in the text significantly depend on concrete subject domain.
      </p>
      <p>The purpose of the research is to check the possibility of using verbs as
markers for different types of fragments.</p>
      <p>For the illustrations we used Bykov N. I., Popov E. S. Observing the
dynamics of snow cover in protected areas of the Altai-Sayan Ecoregion.
Methodological guidance. Krasnoyarsk. 2011. 64 pages. The text consists of 1257 sentences.
Parser identified 196 different verbs.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Mathematical model</title>
      <p>Let V be the set of all natural language verbs. Scientific text T is represented as
an ordered set of natural language sentences T = hski, where sk is kth sentence
in the text. Let Vk ⊂ V be the set of verbs in the sentence sk. For each verb
let’s define the list Ev = hsk|v ∈ Vki. This is an ordered list of sentences that
contain a verb v. |Ev| is the number of occurrences of the verb v in the text
T . Since the object of study is the verb distribution in the text, the cases of
multiple use of a single verb within a sentence can not be ignored. Text
neighborhood Tv = hsii of the verb v is an ordered set of sentences si, such that
∀si ∃sk ∈ Ev and |k − i| &lt;= , is a non-negative integer. All the verbs from the
text T are divided into three groups. The first group contains rare verbs Vunic.
The number of occurrences |Ev| in the text for these verbs is below the border
β: |Ev| &lt; β. The second group includes common verbs Vcommon. These verbs
get the largest values of |Ev|, and are distributed relatively evenly within the
text. Typically, these are parts of collocations from scientific speech style, such
as ”ОСУЩЕСТВЛЯТЬ” (”TO CARRY OUT”), ”ПРОИЗВОДИТЬ” (”TO MAKE”). The third
group contains verbs-markers Vmarker. Those verbs-markers are present in the
text in sufficient quantities and are unevenly distributed. These verbs can also
be parts of collocations from scientific speech style.</p>
      <p>
        Let each sentence sk of the text T be assigned to some cluster c from a finite
set of clusters C. For example, the set of clusters can be obtained by clustering
on the base of the distribution of parts of speech along the text (described in
detail in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]). Clusters are obtained automatically, so their boundaries can be
defined with an error margin. Let cv be a subset of textual neighborhood Tv ,
which belonging to cluster c: cv = Tv ∩ c.
      </p>
      <p>The verb vm is marker of cluster c, if |cvm |/|Tvm | &gt; σ and
∀a ∈ C|avm |/|Tvm | ≤ σ. The values of and σ are parameters of marker detection
algorithm and depend on the method of obtaining clusters C.</p>
      <p>The text nest of verb-marker vm is the set of verbs: Nvμm = {v|Ev ∩ Tvμm 6= ∅}.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Results and Conclusion</title>
      <p>The mathematical model described is realized in algorithms for automatic
labeling of text fragments and for construction of text nests of verbs. In the software
complex the sentence sk is implemented as a parse tree of Dialing parser1. The
table 1 presents the lists of verbs for the three clusters. The window size for
clustering L = 120 sentences. The algorithm parameters values is = 7 sentences
and σ = 0.9.</p>
      <p>Let’s consider the example of a nest for marker ” ВЫЧИСЛЯТЬ” (” TO CALCULATE”)
for μ = 7 sentences:
1 http://aot.ru/
НАПОМНИТЬ, ОТСУТСТВОВАТЬ, РАССЧИТЫВАТЬСЯ, ОКРУГЛЯТЬ, ЗАПАСТИ,
ПРЕДСТАВЛЯТЬ, УЧИТЫВАТЬСЯ, ОКАЗАТЬСЯ, ПРОБИВАТЬСЯ, ПОЗВОЛЯТЬ,
ВЫБИРАТЬ, ПОДСЧИТЫВАТЬ (TO REMIND, TO BE ABSENT, TO BE
CALCULATED, TO ROUND, TO STORE, TO PRESENT, TO BE CONSIDERED,
TO APPEAR, TO BREAK THROUGH, TO ALLOW, TO CHOOSE, TO COUNT)
The nest obtained shows that the set of verbs, which is located around the
marker, belongs to the calculations and laboratory processing of research results
for snow cover observations.</p>
      <p>The algorithm of fragments labeling and nests construction has been checked
using the test set containing 15 scientific texts of various authors and subjects.
Selected verbs-markers are consistent with the expert annotation of the
fragments content. Verbs-markers can be used for semantic labeling of automatically
separated fragments, although some of them have no semantic value and are just
stylistic features of a specific text. In the future we are planning to use
verbsmarkers to improve the accuracy of fragments boundaries determining. The nests
of verbs received on the basis of the model presented will be used in algorithms
of processes visualization using their text descriptions.
Аннотация В статье представлены промежуточные результаты
исследования, конечной целью которого является разработка
универсального алгоритма для автоматической визуализации диаграмм
процессов по текстовым описанием этих процессов. Цель данного
исследования проверка возможности использования глаголов в качестве
маркеров для семантической маркировки длинных фрагментов в
научных текстах.
Ключевые слова: автоматическое фрагментирование текста, text
mining, глаголы-маркеры, динамические параметры текста.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>UzZaman</surname>
          </string-name>
          , N.,
          <string-name>
            <surname>Allen</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          :
          <article-title>Event and temporal expression extraction from raw text: First step towards a temporally aware system</article-title>
          .
          <source>Int. J. Semantic Computing</source>
          <volume>4</volume>
          (
          <issue>4</issue>
          ) (
          <year>2010</year>
          )
          <fpage>487</fpage>
          -
          <lpage>508</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McKendrick</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barrett</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dix</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>French</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tsujii</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ananiadou</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Automatic extraction of angiogenesis bioprocess from text</article-title>
          .
          <source>Bioinformatics</source>
          <volume>27</volume>
          (
          <issue>19</issue>
          ) (
          <year>2011</year>
          )
          <fpage>2730</fpage>
          -
          <lpage>2737</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Hogenboom</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frasincar</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaymak</surname>
          </string-name>
          , U., de Jong, F.:
          <article-title>An Overview of Event Extraction from Text</article-title>
          . In: Workshop on Detection, Representation, and
          <article-title>Exploitation of Events in the Semantic Web (DeRiVE</article-title>
          <year>2011</year>
          ) at Tenth International Semantic Web Conference (ISWC
          <year>2011</year>
          ). Volume 779 of CEUR Workshop Proceedings., CEUR-WS.org (
          <year>2011</year>
          )
          <fpage>48</fpage>
          -
          <lpage>57</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Johansson</surname>
          </string-name>
          , R.:
          <source>Natural Language Processing Methods for Automatic Illustration of Text. Licentiate Thesis</source>
          . Department of Computer Science, Lund University, Lund, Sweden (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Krayvanova</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kruychkova</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>Automatic illustration of texts based on templates</article-title>
          .
          <source>In: Proceedings of All-Russian Conference ”Knowledge - Ontology - Theory” (KONT-13) with international participatio. Volume</source>
          <volume>1</volume>
          . (
          <year>2013</year>
          )
          <fpage>235</fpage>
          -
          <lpage>240</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6. E.,
          <string-name>
            <surname>M.</surname>
          </string-name>
          :
          <article-title>Automatic ontology learning from text document collection</article-title>
          .
          <source>In: Proceedings of Russian Conference on Digital Libraries</source>
          . (
          <year>2011</year>
          )
          <fpage>293</fpage>
          -
          <lpage>298</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Krayvanova</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kruychkova</surname>
          </string-name>
          , E.:
          <article-title>Application of automatic fragmentation for the semantic comparison of texts</article-title>
          .
          <source>In: 15th International conference SPECOM 2013 Proceedings, September 1-5. Lecture Notes In Artificial Intelligence</source>
          , Springer (
          <year>2013</year>
          )
          <fpage>46</fpage>
          -
          <lpage>53</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Lvov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Linguistic analysis of the text and author recognition (</article-title>
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Homutova</surname>
          </string-name>
          , T.:
          <article-title>Research text: integral analysis of lexis. Language and culture (4) (</article-title>
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Rozental</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Telenkova</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Glossary of linguistic terms. 2 edn</article-title>
          . Prosveshenie, Moscow, Russia (
          <year>1976</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>