<!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 Extraction of Hypernyms and Hyponyms from Russian Texts</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Kristina Sabirova</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Artem Lukanin</string-name>
          <email>artyom.lukanin@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>South Ural State University</institution>
          ,
          <addr-line>Chelyabinsk</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <fpage>35</fpage>
      <lpage>40</lpage>
      <abstract>
        <p>The paper describes a rule-based approach for hypernym and hyponym extraction from Russian texts. For this task we employ finite state transducers (FSTs). We developed 6 finite state transducers that encode 6 lexicosyntactic patterns, which show a good precision on Russian DBpedia: 79.5% of the matched contexts are correct.</p>
      </abstract>
      <kwd-group>
        <kwd>text mining</kwd>
        <kwd>wordnet</kwd>
        <kwd>hypernym</kwd>
        <kwd>hyponym</kwd>
        <kwd>noun</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        These days there is no established Russian WordNet, that is why automatic extraction
of hyponyms is of great value for Russian Natural Language Processing. The concept
of this work was created after the investigation of Russian syntactical structures,
which contain hypernyms and hyponyms, and the review of Serelex project [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ],
developed for English and French [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>
        The aim of this project is to extend the approach devised in the Serelex project to
the Russian language. In particular, to accomplish this task we are using corpus
processing tool Unitex 3.1beta [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] for automatic extraction of hypernyms and hyponyms
from Russian DBpedia [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The extracted hypernyms and hyponyms can be used
to ease the creation of Russian thesauri such as RussNet [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] or YARN [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] or for query
expansion in information retrieval systems.
There are a lot of methods of hypernym extraction, from simple lexical patterns [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ],
[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], a combination of a morphological analyzer and surface syntax parsing [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], to
machine learning techniques [
        <xref ref-type="bibr" rid="ref4 ref5">4-5</xref>
        ], [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] and [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. One of the highest-coverage
methods is proposed by Snow et al. [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] Firstly, they are looking for the sentences that
contain two terms which are known to be in the taxonomic relations, then they parse
the sentences and automatically extract patterns from the parse trees. Finally they
train the hypernym classifier based on these features. Lexico-syntactic patterns are
generated for each sentence relating a term to its hypernym, and a dependency parser
is used to represent them.
      </p>
      <p>
        Hearst [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] designed 6 lexico-syntactic patterns for English, which were later
extended by Panchenko et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] with 12 further patterns for English and French. The
results of the extraction are used in Serelex, a lexico-semantic search engine. Given a
query, it returns a list of related words. The system gives the opportunity to discover
the meaning of words in an interactive manner, search for synonyms and more. For
example, for the query “fruit” the output is “vegetable”, “mango”, “apple”, etc. [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-2">
      <title>Russian Lexico-Syntactic Patterns for Hypernym and</title>
    </sec>
    <sec id="sec-3">
      <title>Hyponym Extraction</title>
      <p>We hypothesize that the hyponymic relations are specific for most notional
lexicogrammatical classes, but they are better defined for nouns and verbs. In this study, we
investigate only nouns.</p>
      <p>Our method is based on our patterns deduced in the previous work, as well as the
patterns made in the Serelex project. The aim was to translate the existed patterns, to
interpret them for Russian, to complete them and to create new patterns.</p>
      <p>
        The Extended Abstracts corpus without accents [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] of Russian DBpedia [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] was
used as the material for the research. The corpus consists of 1,325,859 sentences and
~47,000,000 tokens. For the practical part of the research Unitex was used.
      </p>
      <p>Unitex is a collection of programs developed for natural language analysis using
linguistic resources and tools (electronic dictionaries, grammars and
lexicogrammatical tables), that gives the opportunity to develop FSTs in the graphical
interface for the designed patterns. It was created for French by Maurice Gross and his
students at the Laboratoire d’Automatique Documentaire et Linguistique (LADL).
Similar resources were developed for other languages in the context of the RELEX
laboratory network.</p>
      <p>
        The electronic dictionaries specify simple and compound words with their lemmas
and a set of grammatical codes. The availability of these dictionaries is the main
advantage for pattern searching. The information they contain can be used for searching
and matching the contexts from which the lexico-semantic relations can be extracted.
These dictionaries were made by teams of linguists for different languages: English,
French, Greek, Italian, German, Korean, Polish, etc. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. We use the full version of
the Russian computational morphological dictionary, developed at CIS, Munich [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
      <p>During the research we designed 6 patterns for the hyponym and hypernym
extraction from Russian texts. For every pattern we developed a finite state transducer in
Unitex and applied them to the text corpus of Russian DBPedia without accents.</p>
      <p>To reduce the probability of matching incorrect contexts special rules were
desined. These rules are mostly exceptions, enclosed in the right negative contexts to the
left of the probable hypernym or hyponym. Hyponyms and hypernyms are matched
using the special symbols &lt;N&gt; (any noun) or &lt;!DIC&gt; (any token not found in the
dictionary). To increase the probability, that &lt;!DIC&gt; will match a noun, additional
special symbols are placed before and after this token in the pattern, e.g. a
lexicogrammatical classes like &lt;A&gt; for adjectives, &lt;PREP&gt; for prepositions, etc. or lexical
masks like &lt;первый&gt; (first) for matching any word form of this numeral.</p>
      <p>The patterns with the examples are presented below (X – hypernym, Y –
hyponym).</p>
      <sec id="sec-3-1">
        <title>Pattern 1. Такие/таких/таким X, как Y[, Y] и/или Y. (Such X as Y,[ Y,] and/or</title>
        <p>Y). An example of a matched context:</p>
        <p>В Индии зародились такие {[религии]=HYPER} как
{[индуизм]=HYPO}, {[буддизм]=HYPO}, {[сикхизм]=HYPO} и {[джайнизм]=HYPO}.</p>
        <p>(In India such {[religions]=HYPER} as {[Hinduism]=HYPO},
{[Buddhism]=HYPO}, {[Sikhism]=HYPO}, and {[Jainism]=HYPO} were born.)</p>
      </sec>
      <sec id="sec-3-2">
        <title>Pattern 2. X, такие/таких/таким как Y[, Y][ и/или Y]. (X, such as Y,[ Y,][</title>
        <p>and/or Y]). An example of a matched context:</p>
        <p>…{систем [верований]=HYPER}, таких как {[шаманизм]=HYPO},
{[политеизм]=HYPO}, {[пантеизм]=HYPO}, {[анимизм]=HYPO}.</p>
        <p>(…{systems of [faith]=HYPER}, such as {[Shamanism]=HYPO},
{[Polytheism]=HYPO}, {[Pantheism]=HYPO}, {[Animism]=HYPO}.)
Pattern 3. X: Y[, Y] и/или Y. (X: Y,[ Y,] and/or Y). A matched context:
…мир, передаваемый человеку через {его [ощущения]=HYPER}:
{[зрение]=HYPO}, {[слух]=HYPO}, {[обоняние]=HYPO}, {[осязание]=HYPO} и
другие.</p>
        <p>(…the world, transferred to a human through {his [senses]=HYPER}:
{[vision]=HYPO}, {[hearing]=HYPO}, {[smelling]=HYPO}, {[feeling]=HYPO}, etc.)
Pattern 4. Y[, Y][(, а также)/(также как и)/и/или] другие/другим/других/о
других X. (Y,[ Y,] [(as well as)/and/or] other X). An example of a matched context:
Распространение ВИЧ-инфекции связано, главным образом, с
незащищенными половыми контактами, использованием зараженных вирусом
{[шприцев]=HYPO}, {[игл]=HYPO} и {других {медицинских и парамедицинских
[инструментов]=HYPER}}…</p>
        <p>(The major modes of HIV transition are sexual intercourse, unsterile reuse of
single use {[syringes]=HYPO}, {[needles]=HYPO} and {other {medical and
paramedical [instruments]=HYPER}}…)
Pattern 5. Виды/типы/формы/разновидности/сорта X, как Y[, Y] и/или Y.
(Kinds/types/forms/sorts of X, such as Y,[ Y,] and/or Y). A matched context:
Такие виды {[оружия]=HYPER} как {[шпага]=HYPO} и {[рапира]=HYPO}
тоже причисляют к мечам, что не совсем верно.</p>
        <p>(Such kinds of {[weapon]=HYPER} as {[épée]=HYPO} and {[rapier]=HYPO}
are classified as swords, that is not totally correct.)</p>
      </sec>
      <sec id="sec-3-3">
        <title>Pattern 6. Y — вид/тип/форма/разновидность/сорт</title>
        <p>kind/type/form/sort of X). An example of a matched context:</p>
        <p>(Y
is
a
{[Хобби]=HYPO} — вид {человеческой [деятельности]}, некое занятие …
({[Hobby]=HYPO} is a kind of {human [activity]}, some engagement, interest…)
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Results</title>
      <p>
        We ran 6 finite state transducers for the corresponding 6 patterns on a test corpus of
the first 85,071 sentences of the full corpus [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. It contains 3,058,878 tokens. We
manually verified the results, and found that 79.5% of the units were extracted
correctly (see Table 1).
      </p>
      <p>
        The second column contains the number of matched contexts with extracted
hypernyms (the third column) and hyponyms (the fourth column). We also applied these
6 developed FSTs on the full corpus [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. This yielded 4,854 extracted contexts, in
which approximately 3,859 hypernyms and 11,144 hyponyms were extracted
correctly.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>During the research we designed 6 lexico-syntactic patterns and verified them on a
large corpus. We developed 6 finite state transducers corresponding to these patterns
in Unitex. These FSTs matched 428 contexts on the test corpus and 4,854 contexts on
the full corpus, 79.5% of the extracted units from the test corpus were correct.
Acknowledgements. This work is partially supported by the RFH grant
#13-0412020 “New open electronic thesaurus for Russian”.
Аннотация. Описанный в статье подход по извлечению гиперонимов и
гипонимов из русскоязычных текстов основан на использовании правил.
Правила описаны с помощью конечных преобразователей. Мы
разработали 6 конечных преобразователей, кодирующих 6 лексико-синтаксических
шаблонов. Данный подход показывает достаточно высокую точность на
корпусе русскоязычной DBPedia: из 79.5% найденных контекстов
правильно извлечены слова, находящиеся в гиперонимических отношениях.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Agirre</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Olatz</surname>
          </string-name>
          . A.,
          <string-name>
            <surname>Arregi</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Artola</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          , Diaz de Ilarraza,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Lersundi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Martinez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Sarasola</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Urizar</surname>
          </string-name>
          ,
          <string-name>
            <surname>R.</surname>
          </string-name>
          <article-title>Extraction of semantic relations from a Basque monolingual dictionary using Constraint Grammar</article-title>
          .
          <source>In Proceedings of Euralex</source>
          (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Azarowa</surname>
            ,
            <given-names>I. V.</given-names>
          </string-name>
          <article-title>RussNet as a computer lexicon for Russian (</article-title>
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Braslavsky</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mukkin</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lyashevskaya</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bonch-Osmolovskaya</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krzhizhanovsky</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Egorov</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <article-title>YARN: the beginning</article-title>
          .
          <source>In Computer Linguistics and Intelligent Technologies</source>
          <year>2013</year>
          . V.
          <volume>12</volume>
          (
          <issue>19</issue>
          ).
          <source>Part 3</source>
          . (
          <year>2013</year>
          )
          <article-title>- Браславский, П</article-title>
          .,
          <string-name>
            <surname>Мухин</surname>
          </string-name>
          , М.,
          <string-name>
            <surname>Ляшевская</surname>
          </string-name>
          , О. Н.,
          <article-title>Бонч-Осмоловская, А</article-title>
          . А.,
          <string-name>
            <surname>Кржижановский</surname>
          </string-name>
          , А.,
          <string-name>
            <surname>Егоров</surname>
          </string-name>
          , П. YARN: начало // Компьютерная лингвистика и интеллектуальные технологии
          <year>2013</year>
          . Т.
          <volume>12</volume>
          (
          <issue>19</issue>
          ).
          <source>Ч. 3</source>
          .
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Caraballo</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <article-title>Automatic constraction of a hypernym-labeled noun hierarchy from text</article-title>
          .
          <source>In Proceedings of the 37th Annual Meeting of the ACL</source>
          , pp.
          <fpage>120</fpage>
          -
          <lpage>126</lpage>
          (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Dolan</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vanderwende</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Richardson</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <article-title>Automatically deriving structured knowledge bases from on-line dictionaries</article-title>
          .
          <source>In Proceedings of the First Conference of the Pacific ACL</source>
          , pp.
          <fpage>5</fpage>
          -
          <lpage>14</lpage>
          (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>Extended</given-names>
            <surname>Abstracts</surname>
          </string-name>
          <article-title>Corpus without accents of Russian DBpedia</article-title>
          : http://cental.fltr.ucl.ac.be/team/~panchenko/data/serelex/co rpus
          <article-title>-ru-dbpedia-short-dea</article-title>
          .csv
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hearst</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          <article-title>Automatic acquisition of hyponyms from large text corpora</article-title>
          .
          <source>In ACL</source>
          , pp.
          <fpage>539</fpage>
          -
          <lpage>545</lpage>
          (
          <year>1992</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Nagel</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <article-title>Formenbildung im Russischen. Formale Beschreibung und Automatisierung für das CISLEX-Wörterbuchsystem (</article-title>
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Oakes</surname>
            ,
            <given-names>M.P.</given-names>
          </string-name>
          <article-title>Using hearst's rules for the automatic acquisition of hyponyms for mining a Pharmaceutical corpus</article-title>
          .
          <source>In Proceedings of the RANLP Workshop</source>
          , pp.
          <fpage>63</fpage>
          -
          <lpage>67</lpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Panchenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morozova</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Naets</surname>
          </string-name>
          , H.:
          <article-title>A Semantic Similarity Measure Based on Lexico-Syntactic Patterns</article-title>
          .
          <source>In Proceedings of KONVENS 2012 (Main track: poster presentations)</source>
          , pp.
          <fpage>174</fpage>
          -
          <lpage>178</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Ritter</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Soderland</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Etzioni</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          <article-title>What is this, anyway: Automatic hypernym discovery</article-title>
          .
          <source>In Proceedings of the 2009 AAAI Spring Symposium on Learning by Reading and Learning to Read</source>
          , pp.
          <fpage>88</fpage>
          -
          <lpage>93</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>12. Russian DBpedia: http://wiki.dbpedia.org/Downloads39</mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Sanfilippo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Poznański</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <article-title>The acquisition of lexical knowledge from combined machine-readable dictionary sources</article-title>
          .
          <source>In Proceedings of the third Conference on Applied Natural Language Processing</source>
          , pp.
          <fpage>80</fpage>
          -
          <lpage>87</lpage>
          (
          <year>1992</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Serelex</surname>
          </string-name>
          , http://serelex.cental.be/
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Snow</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jurafsky</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ng</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <article-title>Learning syntactic patterns for automatic hypernym discovery</article-title>
          .
          <source>In Proceedings of Advanced in Neural Information Processing systems</source>
          , pp.
          <fpage>1297</fpage>
          -
          <lpage>1304</lpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16. Unitex 3.1beta. Available under LGPL license: http://www-igm.univmlv.fr/~unitex/ (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17. Unitex 3.1beta Manual. http://www-igm.
          <source>univ-mlv.fr/~unitex/UnitexManual3</source>
          .
          <article-title>1.pdf Ключевые слова</article-title>
          . Анализ текста, ворднет, гипероним, гипоним, суще- ствительное.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>