<!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>Russian Prepositional Phrase Semantic Labelling with Word Embedding-based Classifier</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Olga Mitrofanova</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>o.mitrofanova@spbu.ru</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Anastasia Golovina</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Saint Petersburg State University</institution>
          ,
          <addr-line>Saint Petersburg Russian Federation</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Vadim Gudkov</institution>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Victor Zakharov</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper discusses experiments on automatic extraction, classification and semantic labelling of prepositional phrases in a Russian text corpus. Semantic description of prepositional phrases used in our study is based on G.A. Zolotova's simplified classification of minimal language entities. We present the experimental setup, explain the procedure of the training dataset development, describe the labelling techniques, and provide analysis of results. Our research shows that although semantic differences between some prepositional semantic classes are quite vague, it is possible to achieve promising classification results for core classes.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Semantic labelling is understood as the task of annotating language units with labels
denoting their semantic meaning or role. Although the most common variation of this task is
Semantic Role Labelling, the process of attaching labels carrying semantic role information
of the predicate-argument structure to sentence parts, that is not the only way of classifying
semantic categories. The experiment described in this paper deals with a wider interpretation
of semantic labelling - that is, the process of assigning semantic category labels to syntactic
constructions, namely prepositional phrases.</p>
      <p>Although there exist multiple theoretical classifications of prepositional phrases in
literature with respect to their semantics, and there is strong evidence which suggests that semantic
information is highly useful for tasks which traditionally rely on structural features (such as
parsing), the topic of semantic disambiguation of prepositional phrases is underdeveloped.
The study presented in this paper is an attempt to explore this problem.</p>
      <p>The preliminary research on the topic of semantic labelling applied to prepositional
phrases showed that no classification suitable for NLP tasks had been developed or adapted
for the Russian language. Additionally, no corpus big and representative enough specifically
for studying prepositional phrases had been available. Therefore, we took the matter into our
own hands and created the first corpus of this kind for Russian prepositional phrases. The
phrases in our corpus consist of three elements: the head, the preposition and the dependent
noun phrase. A more detailed description is offered in Section 3.2.</p>
      <p>Having dealt with the corpus issue, we approached the next stage of our task: the selection
of the semantic classification to be used for annotating the acquired prepositional phrases.
However, the existing semantic interpretations of prepositions and their relations proved to be
unfit for use in our study due to their high degree of granularity and the lack of consistency.
We ended up adapting one of them to suit the needs dictated by our task. The classification
described in this paper is heavily based on the work of our predecessors, however, ours differs
in that it was created specifically with the NLP applicability in mind.</p>
      <p>In the early stages of our study we took notice of another problem that has to do with
the core element of a prepositional phrase - the preposition. Although an indisputable part
of the Russian lexicon and morphological system, prepositions remain a class with blurred
boundaries. Russian prepositions are commonly divided into non-derivative, simple derivative
and complex derivative [Shvedova, 1980]. While the non-derivative prepositions are a closed
class, the list of their derivative counterparts remains disputed and varies greatly from source
to source, some being considered to be improper prepositions. It is therefore not surprising
that although the core, non-derivative prepositions have enjoyed attention in literature, the
derivative prepositions are still understudied, especially in computational linguistics.</p>
      <p>While generating the prepositional phrase corpus used in this study we paid special
attention to derivative prepositions and functional phrases containing prepositions. We went
beyond the more commonly observed practice of treating only prepositional phrases with
simple prepositions as valid and included complex derivative prepositions into our subject of
study as well. We also took heed of functional set phrases containing prepositions as to avoid
treating them as part of a prepositional phrase.</p>
      <p>The main objective of our experiment was to study the potential of distributed word
representations in a vector space model in semantic description of Russian prepositional phrases.
In order to do that, we set out to perform a classification of prepositional semantic categories
using a supervised machine learning algorithm trained on a corpus of manually tagged
prepositional phrases. The primary hypothesis of our study was that word embeddings of prepositional
constructions can include representations of semantic categories intrinsic to prepositions. This
study was conducted as part of the RFBR project 17-29-09159 “Quantitative grammar of
Russian prepositional constructions” carried out at the Department of Mathematical Linguistics,
Saint Petersburg State University, Russia [Zakharov, 2017; Zakharov and Azarova, 2019]. The
comprehensive goal of the project is to create a representative quantitative lexical-grammatic
description of Russian prepositions based on corpus data, with a strong focus on the semantic
features of prepositional constructions, as this is something that has not been comprehensively
studied as of yet.</p>
      <p>The rest of the paper is structured as follows. Section 2 provides theoretical groundings
of the prepositional phrase semantic classification applied in our project. In Section 3 we
describe our approach and the technical details of our experiment. Section 4 is dedicated to
data analysis as well as to the discussion of tendencies revealed by the output errors. Finally,
Section 5 concludes and outlines some directions for future research.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Traditional linguistic methods are based on the understanding of language as a multilevel
system, each linguistic level having its own elementary unit. Modern research practices,
however, lean towards an integral view focused on language structures uniting different linguistic
elementary units. This view has been developed within Construction grammar
        <xref ref-type="bibr" rid="ref4 ref5 ref9">(Ch. Fillmore
and his followers: [Fillmore, 1988], see also an overview of the trend in [Rakhilina, 2010])</xref>
        .
Within this theory, constructions are regarded as complex signs comprising units of various
linguistic levels which constitute a functional whole and not a mere sum of their elements.
The given approach was adopted in our study. Namely, we assume that the meaning of a
preposition defines the semantic features of the whole prepositional phrase, and vice versa,
the semantic and syntactic connection between words in a prepositional phrase is understood
as a realization of a particular prepositional meaning.
      </p>
      <p>Most of the studies concerned with prepositional phrases have been related to the
prepositional phrase attachment disambiguation task as it remains one of the main sources of parsing
errors. It has been proven that the use of distributed word representations may improve
prepositional phrase attachment accuracy [Agirre et al., 2008; Belinkov et al., 2014; Dasigi et
al., 2017]. Therefore, we hypothesize that a similar approach may be helpful in our case as
well.</p>
      <p>A study akin to ours has been performed and discussed in [Rudzizc and Mokhov, 2010],
although the number of classes selected was considerably lower (only 7 classes were chosen).</p>
      <p>It must be noted that there exists no commonly accepted semantic classification of Russian
prepositional phrases as of yet. As the performance of our system would crucially depend on
the semantic classification used, it was necessary to either adapt an existing one to fit the
needs of our task or develop our own.</p>
      <p>The most obvious approach which implies extraction of prepositional meanings from a
dictionary proved to be unfit for the task on hand. Although most dictionaries do offer
definitions for functional parts of speech such as prepositions, the word senses they distinguish are
not suitable for use in NLP tasks. As such, the three dictionaries we studied, Small Academic
Dictionary of the Russian Language, Wiktionary, Explanatory Dictionary of the Russian
language by S.I. Ozhegov and N.Ju. Shvedova, had the same critical problems. Firstly, the format
of the definitions themselves (their number, volume, content and granularity) fully depend on
the format of the dictionary itself. We found the senses used in the diction-aries examined
for our task to be too fine-grained, often including rare, orthodox and metaphorical senses.
Another problem lay in the lack of any systematic approach to defining the prepositional
senses: a preposition is defined with no regard for another preposition’s senses, making the
creation of a uniform classification entirely impossible. Additionally, no syn-tactic features of
prepositional phrases other than the dependent’s case were included in the definitions, making
the dictionary senses of prepositions harder to study from the point of view of syntactic units.</p>
      <p>A much more appropriate approach was discovered in the Syntactic Dictionary by G.A.
Zolotova [Zolotova, 1988]. In this work, G.A. Zolotova introduces the minimal syntactic unit
called syntaxeme in order to describe the syntactic structure of the Russian language. A big
part of the dictionary is dedicated to prepositional syntaxemes understood as the combination
of a preposition and the case of its nominal dependent, for instance, the preposition ‘в’ plus the
accusative case. G.A. Zolotova describes the functional dependency relations of a syntaxeme as
well as its semantic meanings, which makes the Syntactic Dictionary a better-suited resource
for the purposes of studying semantic features of syntactic constructions. G.A. Zolotova also
offers a systematically disjointed yet highly detailed sense classification of syntaxemes, defining
such sense types as Location, Direction, Instrument etc., subdivided further in accordance with
their dependency relations. Although this classification is also highly fine-grained, we felt it
could be successfully adapted for use in our modelling task. Another shortcoming of G.A.
Zolotova’s dictionary is the absence of most derivative prepositions, something we also
attempted to tackle in our study. An attempt at adapting G.A. Zolotova’s classification for use
in NLP tasks can be found in [Mikhailova, 2015]. V.D. Mikhailova revised G.A. Zolotova’s
classes, uniting minor senses into bigger ones and giving labels to the senses left un-named in
the original classification. However, the reworked classification (further referred to as
ZolotovaMikhailova’s classification) still focused on the semantic features of separate prepositions as
opposed to the entire class and proved to be too complex for effective classification.
3
3.1</p>
    </sec>
    <sec id="sec-3">
      <title>Our Approach</title>
      <sec id="sec-3-1">
        <title>Generalization of Zolotova-Mikhailova’s classification</title>
        <p>In order to reduce the drawbacks of the existing semantic classifications of prepositional senses,
we reworked the classes described in Zolotova-Mikhailova’s classification and proposed a
singlelayer universal classification. To do that, we united the sense subcategories into larger classes
while also separating those with double sense labels into distinct classes. We clustered the
remaining classes by closeness of sense and united each of them into superclasses, ending up
with 15 classes in total.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Generating a Corpus</title>
        <p>In order to prove the hypothesis, we developed a large and representative corpus of Russian
prepositional phrases, which at present has no analogues. We used a SynTagRus pretrained
UDPipe model [Straka and Strakov´a, 2017] in order to extract the prepositions with the head
word and its dependant full noun phrases. The link to the tool developed for the task can be
found in the Appendix. The extraction pipeline is displayed in Figure 1.</p>
        <p>We used a large dictionary of Russian simple and complex prepositions to verify the
parser’s decisions. The preposition list was compiled from dictionaries (Efremova, Sharoff,
Rogozhnikova, Small Academic Dictionary, Wiktionary) and corpora (RNC, OpenCorpora,
HANCO). Some normalization work was done in order to ensure that all variants of the same
preposition would be counted as one, as some prepositions come from the same root and are
only different in their form due to their being proclitics, such as ‘о/об/обо’, ‘без/безо’, ‘с/со’
etc. Such variants were therefore concatenated.</p>
        <p>Simple and complex prepositions were treated in the same way. Complex prepositions
were interpreted as standalone units with their own attachments and dependants.</p>
        <p>We also filtered out the prepositional homonyms as well as phrases with prepositions
which are parts of functional words and some idiomatic phrases. The list of such stop words
was extracted from the Explanatory dictionary of functional parts of speech of the Russian
language by T.F. Efremova [Efremova, 2004] and supplemented by the lists of set expressions
containing prepositions provided by the Russian National Corpus. We also added
OpenCorpora morphological annotation with the help of PyMorphy2 [Korobov, 2015] for the extracted
data in order to ease the subsequent annotation part.</p>
        <p>Following this approach we parsed the Taiga news subcorpus [Shavrina, 2018] (size 92
million tokens) and acquired 5 million prepositional phrases. For each prepositional phrase
its head, preposition and dependant, alongside with their POS, lemmas and the case of the
dependant, were extracted as well. The absolute frequency distribution of the most commonly
occurring prepositions observed in the corpus is shown in Figure 2.</p>
      </sec>
      <sec id="sec-3-3">
        <title>Human Annotation</title>
        <p>The generalization of Zolotova-Mikhailova’s classification furnished us with the final set of
semantic categories characterising prepositional phrases. The classification was manually
applied to all of the prepositions described by G.A. Zolotova (mainly non-derivatives), yielding
the base set of semantically classified prepositional syntaxemes.</p>
        <p>A randomly selected data subset of 10 000 phrases was then acquired from the original 5
million corpus for manual an-notation. The previously undescribed prepositional syntaxemes
observed in the subset were collected and classified as well.
After that we created a form containing the list of the syntaxemes, all of the semantic
functions of each syntaxeme illustrated with definitions and examples, and tables containing
sets of untagged prepositional phrases from the subset sorted by syntaxeme. Thirty annotators
with linguistic background were then asked to perform sense disambiguation of prepositional
phrases based on the provided classification. After the disambiguation, all of the annotated
phrases were manually checked by experts. Figure 3 demonstrates the absolute frequency
distribution of the fifteen semantic categories used in our classification.
3.4</p>
      </sec>
      <sec id="sec-3-4">
        <title>Classification Task</title>
        <p>After acquiring the labelled dataset we were able to perform a supervised classification. The
preliminary analysis of the data uncovered the fact that the semantic classes are highly
imbalanced in the corpus. The least represented of them are Instrument, Transgression, Situation
and Potential as opposed to Location, Theme and Tempus. This imbalance directly affected
the performance of the classifier, which leads us to the idea that class enhancement could be an
option for further research. However, this experiment is left out of the scope of this paper. In
our experiments we revised a standard strategy used in previous works on construction
classification [Lyashevskaya et al., 2013]. This strategy develops a view on constructions as multilevel
entities combining lexical, semantic, morphological and syntactic features. Context markers
constituting a set of constructions for a target word allow the identification of its meaning,
so that separate meanings of a polysemous word can be associated with independent clusters
of constructions. The procedures of word sense induction/disambiguation and semantic
labelling thus can be fulfilled by means of super-vised construction classification [Lyashevskaya
et al., 2011]. Our approach is based on the assumption that classification of prepositional
phrases should be performed not for constructions per se but for their vector representations
obtained from Word2Vec models [Mikolov et al., 2013] trained on the Russian corpora from
the RusVectores project [Kutuzov et al., 2016]. In this respect, the vector of a prepositional
phrase is composed as a sum of vectors corresponding to lexical items constituting the whole
construction.</p>
        <p>Our preprocessing procedure was performed in accordance with the technique proposed
in [Kutuzov and Kuzmenko, 2017], which comprised POS label attachment to the tokens. We
made multiple attempts with pretrained embeddings, alt-hough without achieving any viable
results with F1 score of 0.4 on average with traditional embedding approaches of TF-IDF and
Word2Vec.</p>
        <p>We then decided to obtain our own word vectors via FastText supervised [Bojanowski et
al., 2016]. This tool enables word embedding via subword information, which has proven to be
extremely efficient for morphologically rich languages, such as Russian. Moreover, it utilizes
label information via a softmax layer to obtain a probability distribution over predefined
classes. With the help of this tool, the classification results were elevated to a higher level. As
regards F1 score, the categories Destination, Quantity, Location and Tempus are recognized
quite effectively, F1 measure being from 0.70 up to 0.86. The other categories achieve moderate
F1 values. Due to the highly unbalanced nature of the dataset, some of the lower represented
classes were not properly identified. However, average F1 score for the whole set of semantic
categories reaches 0.65 and may be boosted after certain improvement of the experimental
settings. Data on F1 measure values are given in Table 2.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Error Analysis</title>
      <p>In order to uncover the tendencies in the classification errors we considered a random subset
of 300 prepositional constructions with manually assigned labels and those predicted by a
model. We found 95 mismatches between the given label and the predicted one, that roughly
corresponds to average F1 score evaluating the classification effectiveness. Thorough analysis
of the sample revealed true errors and meaningful mismatches.</p>
      <p>However, a major factor influencing correctness of predicted labels was the disbalance
in the representation of semantic categories in the training data. As has been mentioned in
Section 3.4, several classes were significantly underrepresented in the training dataset. The
problem of data sparsity observed for those classes led to their predominance among the
mislabelled categories, among which we should mention Potential, Situation, Transgression
and Instrument as the least represented categories with the lowest F1 score.</p>
      <p>We registered only a small number of true errors exemplified by short contexts with
deictic words (e.g. надо для этого, для этого остаться, etc.) and/or potentially ambiguous
parts (e.g. стать от такого региона, ставка по программе, etc.). Set expressions or
phraseological units (e.g. обратиться с просьбой ) defy proper treatment for their possible
non-compositionality. In such cases it is hard to obtain the correct label prediction.
Nonetheless, in most cases we found meaningful mismatches between labels assigned by experts and
those predicted by the model. The most common reason is the inevitable semantic fuzziness
of categories included in the generalized Zolotova-Mikhailova’s classification. We found sets of
prepositional phrases which should be treated as manifestations of merged semantic classes,
e.g. Object - Theme (e.g. заявлять о задержке зарплаты, сообщать о местонахождении
обвиняемого, ходатайствовать о рассмотрении дела, предупреждать о закрытии, etc.);
Tempus - Location (находиться в процессе предварительного расследования, видеть в
процессе этого занятия, etc.); Direction - Location (выстрел в воздух, доставить на
станцию Акуловка, etc.); Destination - Location (обращаться во все инстанции, etc.);
Source - Location (прописать в регламенте, отыскаться в решении арбитражного суда,
etc.); Cause - Quality (откликнуться на предложение, etc.), and so on. In the
aforementioned cases the differences between the semantic categories are subtle, so that prepositional
phrases with dual labels seem to be immanently ambiguous as they possibly reveal both
categories simultaneously. Such prepositional phrases can obtain proper treatment as
constructions with diffuse meaning according to Ju.D. Apresjan [Apresjan, 1971]. In such cases
differentiation of close meanings turns out to be impossible.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion аnd Future Work</title>
      <p>In this paper we proposed a challenging solution to the problem of automatic semantic
classification of prepositional phrases. Although some attempts into classifying the semantic
functions of prepositions had been made, none proved to be effective from the point of view
of their application in NLP tasks. We used G.A. Zolotova’s system of syntaxeme senses to
develop a semantic classification of prepositional phrases which could be used in our task. We
then tested the developed classification in manual prepositional phrase sense disambiguation
and used the obtained data for training a word embedding-based classifier. The results of
the subsequent automatic classification of prepositional phrases presented in this article show
that some of the specified classes, such as Location, Tempus, Quantity and Destination, can
be identified with a high degree of success. At the same time, a few classes underrepresented
in the training data and having broader definitions presented a problem to the classifier.</p>
      <p>The results attained with our method suggest several possible directions for further
development. The problem of data sparsity that affected the predictions received for the smaller
classes might be resolved through WordNet-based class enhancement, as was mentioned in
Section 3.3. Alternatively, the issue could be overcome by means of reworking the
classification itself to assign the prepositional phrases currently found in the poorer-performing classes
to the others. In addition to the aforementioned lines of practical research, the proposed
classification of prepositional syntaxemes could be used for describing the previously unexplored
derivative prepositions. All in all, being the first of its kind for Russian prepositional phrases,
our study offers substantial food for thought for further research and experiments.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Appendix</title>
      <p>The tool used for prepositional phrase extraction and semantic classification, and the data are
available at https://github.com/merionum/pphrase.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgements</title>
      <p>Our research was supported by the RFBR grant 17-29-09159 “Quantitative grammar of Russian
prepositional construc-tions” (2018-2020).</p>
      <p>Authors wish to express their sincere gratitude to A.Ts. Masevich, U.V. Butorova, E.G.
Filimonov, D.A. Alfimova, A.D. Ivanova, the students of the SPbU Mathematical Linguistics
Department and other participants for their valuable help in annotating the data.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <source>[Shvedova</source>
          , 1980]
          <string-name>
            <surname>Shvedova N.Ju.</surname>
          </string-name>
          (
          <year>1980</year>
          )
          <article-title>Russian Grammar</article-title>
          . Vol.
          <volume>1</volume>
          . Moscow, Nauka:
          <year>1980</year>
          . - 792 p.
          <article-title>(in Rus.) = Russkaja grammatika</article-title>
          . Tom 1. Moscow, Nauka:
          <year>1980</year>
          .
          <article-title>- 792 s.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <source>[Zakharov</source>
          , 2017] Zakharov,
          <string-name>
            <surname>V.P.</surname>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>A construction grammar approach to Russian prepositions</article-title>
          .
          <source>SGEM 4th International Multidisciplinary Scientific Conference on Social Sciences and Arts 20172367-5659</source>
          ,
          <issue>2</issue>
          (
          <issue>3</issue>
          ), pp.
          <fpage>279</fpage>
          -
          <lpage>286</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <source>[Zakharov and Azarova</source>
          , 2019] Zakharov,
          <string-name>
            <given-names>V.P.</given-names>
            , and
            <surname>Azarova</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.V.</surname>
          </string-name>
          (
          <year>2019</year>
          ).
          <article-title>Towards a computational ontology of Russian prepositions</article-title>
          .
          <source>Trudy mezhdunarodnoj konferencii “Korpusnaja lingvistika"</source>
          , pp.
          <fpage>155</fpage>
          -
          <lpage>165</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <source>[Fillmore</source>
          , 1988] Fillmore,
          <string-name>
            <surname>C.J.</surname>
          </string-name>
          (
          <year>1988</year>
          ).
          <article-title>The Mechanisms of “Construction Grammar”</article-title>
          .
          <source>Proceedings of the Fourteenth Annual Meeting of the Berkeley Linguistics Society</source>
          (
          <year>1988</year>
          ), pp.
          <fpage>35</fpage>
          -
          <lpage>55</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [Rakhilina., 2010] Rakhilina,
          <string-name>
            <surname>E.V.</surname>
          </string-name>
          (
          <year>2010</year>
          )
          <article-title>Construction linguistics</article-title>
          . Moscow, Azbukovnik Publ.:
          <year>2010</year>
          . - 584 p.
          <article-title>(in Rus.) = Lingvistika konstrukcij</article-title>
          . Moscow, Azbukovnik:
          <year>2010</year>
          .
          <article-title>- 584 s.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [Agirre et al.,
          <year>2008</year>
          ] Agirre,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Baldwin</surname>
          </string-name>
          ,
          <string-name>
            <surname>T.</surname>
          </string-name>
          , Mart´ınez,
          <string-name>
            <surname>D.</surname>
          </string-name>
          (
          <year>2008</year>
          ).
          <article-title>Improving Parsing and PP Attachment Performance with Sense Information</article-title>
          .
          <source>In Proc. of the 46th Annual Meeting of the Association for Computational Linguistics</source>
          , pp.
          <fpage>317</fpage>
          -
          <lpage>325</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [Belinkov et al.,
          <year>2014</year>
          ] Belinkov,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Lei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Barzilay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Globerson</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          (
          <year>2014</year>
          )
          <article-title>Exploring Compositional Architectures and Word Vector Representations for Prepositional Phrase Attachment</article-title>
          .
          <source>Transactions of the Association for Computational Linguistics</source>
          ,
          <volume>2</volume>
          , pp.
          <fpage>561</fpage>
          -
          <lpage>572</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [Dasigi et al.,
          <year>2017</year>
          ] Dasigi,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Ammar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            ,
            <surname>Dyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Hovy</surname>
          </string-name>
          ,
          <string-name>
            <surname>E.</surname>
          </string-name>
          (
          <year>2017</year>
          )
          <article-title>Ontology-Aware Token Embeddings for Preposi-tional Phrase Attachment</article-title>
          .
          <source>In Proc. of the 55th Annual</source>
          <article-title>Meeting of the Association for Computational Lin-guistics (Vol 1: Long Papers)</article-title>
          , pp.
          <fpage>2089</fpage>
          -
          <lpage>2098</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <source>[Rudzizc and Mokhov</source>
          , 2010] Rudzicz,
          <string-name>
            <given-names>F.</given-names>
            , and
            <surname>Mokhov</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          (
          <year>2010</year>
          )
          <article-title>Towards a Heuristic Categorization of Prepositional Phrases in English with WordNet</article-title>
          .
          <source>Technical Report</source>
          , Cornell University, (
          <year>2003</year>
          ),
          <year>arxiv1</year>
          .library.cornell.edu/abs/1002.
          <fpage>1095</fpage>
          - ?context=cs
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <source>[Zolotova</source>
          , 1988]
          <string-name>
            <surname>Zolotova G.A.</surname>
          </string-name>
          (
          <year>1988</year>
          )
          <article-title>Syntactic dictionary: Repertory of elementary units of Russian Syntax</article-title>
          . Moscow: Nauka,
          <year>1988</year>
          . - 440 p.
          <article-title>(in Rus.) = Sintaksicheskij slovar': repertuar elementarnykh jedinic russkogo jazyka</article-title>
          . Moscow: Nauka,
          <year>1988</year>
          . -
          <fpage>440</fpage>
          s.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <source>[Mikhailova</source>
          , 2015] Mikhailova,
          <string-name>
            <surname>V.D.</surname>
          </string-name>
          (
          <year>2015</year>
          )
          <article-title>Ontology of Prepositions in the Russian language</article-title>
          . Saint Petersburg, SPbU:
          <year>2015</year>
          . - 159 p.
          <article-title>(in Rus.) = Ontologija predlogov v russkom jazyke</article-title>
          .
          <source>Saint Petersburg</source>
          , SPbU:
          <year>2015</year>
          .
          <article-title>- 159 s. [Straka and Strakov´a, 2017] Milan S</article-title>
          ., and Strakova´, J. Tokenizing, POS Tagging,
          <article-title>Lemmatizing and Parsing UD 2.0 with UDPipe</article-title>
          .
          <source>In Proceedings of the CoNLL 2017 Shared Task: Multilingual Parsing from Raw</source>
          Text to Universal Dependencies, Vancouver, Canada,
          <year>August 2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <source>[Efremova</source>
          , 2004]
          <string-name>
            <surname>Efremova</surname>
            <given-names>T.F.</given-names>
          </string-name>
          <article-title>Explanatory dictionary of functional parts of speech of the Russian language</article-title>
          . Moscow: Astrel,
          <string-name>
            <surname>AST</surname>
          </string-name>
          ,
          <year>2004</year>
          . - 815 p.
          <article-title>(in Rus.) = Tolkovyj slovar' sluzhebnykh chastej rechi</article-title>
          . Moscow, Astrel:
          <year>2004</year>
          .
          <article-title>- 815 s.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <source>[Korobov</source>
          , 2015]
          <string-name>
            <surname>Korobov</surname>
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2015</year>
          )
          <article-title>Morphological Analyzer and Generator for Russian and</article-title>
          Ukrainian Languages // Analysis of Images,
          <source>Social Networks and Texts</source>
          , pp
          <fpage>320</fpage>
          -
          <lpage>332</lpage>
          . [Shavrina, 2018] Shavrina,
          <string-name>
            <surname>T.O.</surname>
          </string-name>
          (
          <year>2018</year>
          )
          <article-title>Differential Approach to Web-Corpus Construction</article-title>
          .
          <source>In Proc. of the 2018 Annual International Conference “Dialog”</source>
          . Moscow,
          <year>2018</year>
          . 11 p.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [Lyashevskaya et al.,
          <year>2013</year>
          ]
          <string-name>
            <given-names>Lyashevskaya O.N.</given-names>
            ,
            <surname>Panicheva</surname>
          </string-name>
          <string-name>
            <given-names>P.V.</given-names>
            ,
            <surname>Mitrofanova</surname>
          </string-name>
          <string-name>
            <surname>O.A.</surname>
          </string-name>
          (
          <year>2013</year>
          )
          <article-title>Data visualization for building the catalogue of Russian lexical constructions (based on RNC)</article-title>
          .
          <source>In: Computational Linguistics and Intellec-tual Technologies: Papers from the Annual International Conference “Dialogue”</source>
          (
          <year>2013</year>
          ).
          <source>Issue 12</source>
          . Vol.
          <volume>1</volume>
          P.
          <fpage>465</fpage>
          -
          <lpage>478</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [Lyashevskaya et al.,
          <year>2011</year>
          ]
          <string-name>
            <given-names>Lyashevskaya O.</given-names>
            ,
            <surname>Mitrofanova</surname>
          </string-name>
          <string-name>
            <given-names>O.</given-names>
            ,
            <surname>Grachkova</surname>
          </string-name>
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Romanov</surname>
          </string-name>
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Shimorina</surname>
          </string-name>
          <string-name>
            <given-names>A.</given-names>
            , and
            <surname>Shurygi-na</surname>
          </string-name>
          <string-name>
            <surname>A</surname>
          </string-name>
          . (
          <year>2011</year>
          )
          <article-title>Automatic Word Sense Disambiguation and Construction Identification Based on Corpus Multilevel Annotation</article-title>
          . In: Text,
          <article-title>Speech and Dialogue</article-title>
          .
          <source>Proceedings of the 14th International Conference TSD</source>
          <year>2011</year>
          , Pilsen,
          <source>Czech Republic, September 1-5</source>
          ,
          <year>2011</year>
          . Springer-Verlag,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [Mikolov et al.,
          <year>2013</year>
          ] Mikolov et al. (
          <year>2013</year>
          )
          <article-title>Distributed Representations of Words and Phrases and their Compositionality</article-title>
          .
          <source>In: Proceedings of Neural Information Processing Systems</source>
          .
          <volume>26</volume>
          p.
          <source>[Kutuzov and Kuzmenko</source>
          , 2017]
          <article-title>Kutuzov A</article-title>
          ., and
          <string-name>
            <surname>Kuzmenko E.</surname>
          </string-name>
          (
          <year>2017</year>
          )
          <article-title>WebVectors: A Toolkit for Building Web Interfac-es for Vector Semantic Models</article-title>
          . In: Ignatov D. et al. (
          <article-title>eds) Analysis of Images, Social Networks and Texts</article-title>
          .
          <source>AIST 2016. Communications in Computer and Information Science</source>
          , vol
          <volume>661</volume>
          . Springer, Cham.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [Bojanowski et al.,
          <year>2016</year>
          ] Bojanowski,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Grave</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Joulin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Mikolov</surname>
          </string-name>
          ,
          <string-name>
            <surname>T.</surname>
          </string-name>
          (
          <year>2016</year>
          )
          <article-title>Enriching Word Vectors with Subword Information. Transactions of the Association for Computational Linguistics</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <source>[Apresjan</source>
          , 1971]
          <string-name>
            <given-names>Apresjan</given-names>
            <surname>Ju.D.</surname>
          </string-name>
          (
          <year>1971</year>
          )
          <article-title>On regular polysemy</article-title>
          .
          <source>In: Proceedings of the Academy of Sciences of the USSR. Department of Literature and Language</source>
          .
          <source>Vol. XXX. Issue 6</source>
          . -
          <fpage>М</fpage>
          .,
          <year>1971</year>
          . - P.
          <fpage>509</fpage>
          -
          <lpage>523</lpage>
          . (in Rus.) =
          <article-title>O regulyarnoj mnogoznachnosti</article-title>
          .
          <source>Izvestija AN SSSR</source>
          .
          <source>Vol. XXX. Vyp. 6</source>
          .
          <string-name>
            <surname>- M.</surname>
          </string-name>
          ,
          <year>1971</year>
          . - s.
          <fpage>509</fpage>
          -
          <lpage>523</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>