<!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>A Neural Network Approach to Morphological Disambiguation Based on the LSTM Architecture in the National Corpus of the Tatar Language</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Rinat Gilmullin</string-name>
          <email>rinatgilmullin@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bulat Khakimov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ramil Gataullin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute of Applied Semiotics of the Tatarstan Academy of Sciences</institution>
          ,
          <addr-line>Kazan</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Kazan Federal University</institution>
          ,
          <addr-line>Kazan</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper presents the results of experiments on morphological disambiguation in the National corpus of the Tatar language “Tugan tel”. The experiments were conducted using the LSTM based neural network model. The tagged socio-political sub-corpus of the National corpus of the Tatar language “Tugan tel” with a volume of 2,4 million words was used as training data. Experiments have shown that LSTM models are language-independent and can be applied to the Tatar language too. The results for Tatar are on a comparable level with those for other agglutinative languages, such as Hungarian and Turkish.</p>
      </abstract>
      <kwd-group>
        <kwd />
        <kwd>Morphological disambiguation</kwd>
        <kwd>Tatar language</kwd>
        <kwd>Tatar National Corpus</kwd>
        <kwd>corpus data</kwd>
        <kwd>morphological tagging</kwd>
        <kwd>LSTM</kwd>
        <kwd>neural architectures</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Morphological disambiguation is one of the main tasks of automatic natural language
processing. Its results can be used to improve accuracy and quality of the methods
used in such tasks as text classification and clustering, machine translation, and
information retrieval.</p>
      <p>The complexity and peculiarities of morphological disambiguation vary for each
particular language. For example, for English with its poor morphology and rigid
word order in the sentence, the morphological disambiguation, as a rule, is reduced to
the task of POS tagging and is based on rather simple methods. In Russian,
morphological ambiguity is not so salient as in English, but, nevertheless, it is inherent. Free
word order in Russian adds complexity to the task. In the Tatar language, as in other
agglutinative languages of the Turkic group, morphemes are the most important
meaningful language units that carry both semantic and syntactic information. With a
theoretically unlimited number of morphemes attached to the stem, morphological
ambiguity takes on various forms, which greatly complicates the disambiguation.</p>
      <p>
        Up to now, a basic paradigm of methods for disambiguation has been formed [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
This includes the rule-based methods [
        <xref ref-type="bibr" rid="ref2 ref3">2,3</xref>
        ], machine learning methods based on the
probabilistic models [
        <xref ref-type="bibr" rid="ref4 ref5">4,5</xref>
        ], and hybrid methods [
        <xref ref-type="bibr" rid="ref6 ref7 ref8">6,7,8</xref>
        ]. Developing the National
corpus of the Tatar language “Tugan tel” (http://tugantel.tatar/) and the socio-political
sub-corpus with manual morphological disambiguation made it possible to study this
problem using statistical methods based on machine learning [
        <xref ref-type="bibr" rid="ref3 ref8">3,8</xref>
        ].
      </p>
      <p>
        Analysis of open source codes developed for this task over the past few years has
shown that one of the most effective tools is PurePos 2.0 [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] which implements a
hybrid model based on hidden Markov models, as well as a neural network model
based on recurrent neural networks with long short-term memory LSTM [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Hidden
Markov model is a process model in which a process is considered a Markov process,
and it is not known what state the system is in (its states are hidden), but each state
can produce, with some probability, an event that can be observed. In other words, the
Markov process with unknown parameters is studied, and the task is to recognize
these unknown parameters basing on observables. The results of recognizing POS
tags of Tatar words showed an accuracy of 97% [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
      <p>
        Another approach that rather successfully solves the problem of morphological
ambiguity is based on a recurrent neural network with a long short-term memory
(LSTM) [
        <xref ref-type="bibr" rid="ref10 ref9">9,10</xref>
        ]. In [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], the results (see Table 1) of applying this approach to Turkish,
Russian and Arabic are given.
The analysis of the used context size in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] deserves a special attention. The authors
compared different sizes and types of contexts and experimentally revealed the most
appropriate type for each language. It turned out that for the Turkish language it is
sufficient to construct vectors based on surface word forms without explicitly defining
their morphological features, but using all the words in the sentence. Whereas for
Russian, agreement in gender, number and case is important, which in turn requires
not only surface word forms, but also their morphological features in the context. At
the same time, optimization based on the conditional random field method (CRF)
helps to achieve better results (disambiguation accuracy 91.13%). The situation is
similar with the Arabic language, when surface word forms are not enough for full
disambiguation. This can be explained by the fact that in Arabic the level of
ambiguity is higher than Turkish. If, for example, in Turkish, on average, there are 2.81
parsing options per word, and in Russian 5.81, then in Arabic there are 11.31. Therefore,
for correct model training, a completely disambiguated tagged context is required.
      </p>
      <p>This article describes the results of applying the neural network model based on the
LSTM architecture to morphological disambiguation in the National corpus of the
Tatar language.
2</p>
    </sec>
    <sec id="sec-2">
      <title>The Tatar Language</title>
      <p>
        The Tatar language belongs to the Turkic group that forms a subfamily of Altaic
languages. It is spoken in West-central Russia (in the Volga region) and in the southern
parts of Siberia. The number of Tatars in Russia in 2010 was 5,31 million people [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
In 2013, the existing language classifications [
        <xref ref-type="bibr" rid="ref12 ref13">12, 13</xref>
        ] described Tatar as an
underresourced language.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>LSTM model for morphological disambiguation</title>
      <p>Model training requires tagged disambiguated texts. The method supposes that each
parse of an ambiguous word and its context is juxtaposed with vectors. In the first
case, the vector is based on its lemma and morphological features, and in the second
case, on the surface forms of the surrounding words; in addition, the vector can be
expanded by morphological features. Here, the context is not limited to several words
of the immediate vicinity of words and can reach the size of the entire sentence. After
that, on the basis of the resulting pair of vectors, the distribution of conditional
probabilities is constructed; from these the most probable parse is selected as the correct
one.</p>
      <p>
        According to [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], the LSTM model is designed to build a vector representation of
an ambiguous word (vectors are constructed on the basis of the lemma and
morphological features of each of the alternatives, then they are united into R matrix and the
surrounding context (indicated by h vector). After using the softmax function on the
product of R matrix and h vector, the distribution of probabilities of each parsing
option in this particular context is constructed, on the basis of which morphological
ambiguity is resolved in favor of the most likely alternative:
3.1 Vector representation of the ambiguous word and its context
Let us take an ambiguous word with the following morphological parsing:
where
parsing option; each
, a lemma K symbols long of the ith
is the jth tag (morphological feature) of the ith parsing
option (which contains L of such tags). To construct the vector of the lemma, a
bidirectional LSTM is used on top of each symbol of the lemma; for the vector of
morphological features, we use a bidirectional LSTM over the tags. First, the bidirectional
LSTM creates representation of the input vector by computing
the direct and the inverse sequence, and combines the two sequences using the
Rectified Linear Unit (ReLU).
where
      </p>
      <p>is a LSTM function with input values x and y.</p>
      <p>Thus, the corresponding vector representations are constructed separately for the
lemma and for the tag sequence (morphological features). Next, the resulting vectors
are combined using the hyperbolic tangent:
Next, vectors are combined into R matrix, where each row belongs to a particular
parse.</p>
      <p>
        One of the methods for constructing the context vector described in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] is to use only
the surface forms of the surrounding words (without morphological features). For this,
the bidirectional LSTM model is used over each xi word, constructing a separate
vector for each word. Then for the left context, the vectors are assembled from right to
left, and for the right context – from left to right (see Fig. 2.). After that, the vectors
are combined using the hyperbolic tangent:
Next, in order to perform the morphological disambiguation, the distribution of
alternative probabilities is constructed – for this, softmax function from the product of
vector and R matrix is taken, and the most probable parse is selected as the correct
one (according to the same formula as described in the previous section):
      </p>
      <p>
        Sometimes, surface forms of the surrounding words in the context are not enough for
morphological disambiguation. Apart from these, it is necessary that all ambiguities in
the surrounding words are resolved, i.e. data on the lemma and on all morphological
features corresponding to the given context are needed. In such cases, the remedy is
sequential disambiguation, when information about the allowed option is transmitted
further, and the next case of ambiguity is resolved on its basis (in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], this approach is
defined as Left-to-Right).
      </p>
      <p>In such cases, the LSTM model builds a vector based on the lemma and
morphological features of the word from the context (if they are ambiguous, then the one in
favor of which the disambiguation was made is selected) and thus vector is
calculated and then the disambiguation is performed:
where is a vector from
tion stage.</p>
      <p>A
, the parsing option selected at the previous
disambigua(
)</p>
    </sec>
    <sec id="sec-4">
      <title>Data preparation</title>
      <p>
        At the initial stage of work, statistical data on the frequency of word forms with
multivariate parses, presented in Table 2, were obtained from the text base of the National
corpus of the Tatar language “Tugan tel” [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The morphological module
implemented on the basis of the HFST toolkit is used for the morphological tagging of the
corpus. [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
The total volume of the corpus at this stage was 21.940.452 tokens; the share of
tokens with multivariate parses was 25.75%.
      </p>
      <p>At the same time, the maximum length of the word form presented in the corpus
consists of the stem and twelve grammatical affixes.</p>
      <p>
        To carry out experiments with model training, it was necessary to have a
morphologically disambiguated corpus. The part of socio-political sub-corpus of the National
corpus of the Tatar language “Tugan tel” was used as training data. The sub-corpus
statistics are given in Table 3.
Number of unique
morphological forms
1.898
346
Manual morphological disambiguation of the socio-political sub-corpus was carried
out by experts using a Web-based toolkit for morphological disambiguation in the
corpus of the Tatar language [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
      </p>
      <p>Manual morphological disambiguation was organized in several stages.</p>
      <p>At stage 1 selected texts from socio-political sub-corpus were automatically tagged
using the morphological analyze. Then certain types of ambiguity were automatically
disambiguated where possible, as well as redundant and incorrect parses were
removed.</p>
      <p>At stage 2 annotators performed manual disambiguation using web-toolkit for
morphological disambiguation in dialog mode. They selected the right parsing option
based on the context.</p>
      <p>At stage 3 main experts performed total manual review of the tagged texts
disambiguated at stage 2. This double-checking helped us make sure that the tagging and
disambiguation of the training data is correct.</p>
      <p>As a result, for our experiments 56.524 morphologically disambiguated sentences
were prepared.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Experiments and Evaluation</title>
      <p>
        As one can see from Table 2, the tagged data sample was divided into a training
sample and a test sample. LSTM models were trained only using the training set, and the
test sample was used just for testing. Based on approach described in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], we
considered each sentence to be a minibatch for training. The objective function used for
training was the total cross-entropy loss between the selected parse and the correct
parse for every token in the sentence. Stochastic gradient descent and
backpropagation were used to adjust the parameters for our model. All LSTMs in our models were
trained with a single hidden layer. We used a hidden dimension size of 100 for the
tag, stem, and surface form LSTMs and 200 for the context and previous parse
LSTMs.
      </p>
      <p>Tables 4, 5 provide an estimate of the accuracy of several indicators: lemma
recognition, morpheme sequence recognition and disambiguation.
Number of options
n=2
n=3
n=4
n=5
n=6
n=7
n=8
Total
two parsing options: 84.61%, when overall accuracy is 79.10%. In one hand, more
variants increase complexity, in another hand, such words (see Table 2) do not have
enough examples, so as a result, model lacks accuracy with them.
The results of LSTM are virtually close to those of other disambiguation methods.
The main benefit of the proposed method is that the model can be trained taking into
account the size and peculiarities of the context. So the highest accuracy rate of the
morphological disambiguation in the corpus of the Tatar language was achieved with
the construction of vectors taking into account all the words in the sentence as the
surrounding context. In addition, the vector of the surrounding context was expanded
using morphological features.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>This paper presents the results of work on morphological disambiguation of the Tatar
language using the neural network model based on the LSTM architecture. Given the
limited set of corpus data for training, the results of experiments showed a fairly good
level of accuracy for morphological disambiguation, 79.10%. We believe that the
lower accuracy of the neural network model is primarily related to the amount of
training data, since systems with neural networks are not sufficiently effective when
training on a limited set of data.</p>
      <p>At the same time, the obtained results can be effectively used in creating a
morphologically disambiguated “golden” sub-corpus, significantly reducing the number of
multivariate parses requiring manual morphological disambiguation.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Gataullin</surname>
            ,
            <given-names>R.R.</given-names>
          </string-name>
          :
          <article-title>Analiticheskij obzor metodov razresheniya morfologicheskoj mnogoznachnosti [Analytical review of the methods of morphological disambiguation]. Rossijskij nauchnyj elektronnyj zhurnal (Elektronnye biblioteki</article-title>
          )
          <volume>19</volume>
          (
          <issue>2</issue>
          ),
          <fpage>98</fpage>
          -
          <lpage>114</lpage>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Zin</surname>
          </string-name>
          <article-title>'kina</article-title>
          ,
          <string-name>
            <surname>Yu</surname>
          </string-name>
          .V.,
          <string-name>
            <surname>Pyatkin</surname>
            ,
            <given-names>N.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nevzorova</surname>
            ,
            <given-names>O.A.</given-names>
          </string-name>
          :
          <article-title>Razreshenie funkcional'noj omonimii v russkom yazyke na osnove kontekstnyh pravil [Context rule based functional disambiguation in Russian]</article-title>
          .
          <source>In: Proceedings of the International Conference “Dialog-2005”</source>
          , pp.
          <fpage>198</fpage>
          -
          <lpage>202</lpage>
          . Nauka, Moscow (
          <year>2005</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Gataullin</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khakimov</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Suleymanov</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gilmullin</surname>
          </string-name>
          , R.:
          <article-title>Context-Based Rules for Grammatical Disambiguation in the Tatar Language</article-title>
          . In: Nguen,
          <string-name>
            <surname>N.T.</surname>
          </string-name>
          et al. (eds).
          <source>ICCCI</source>
          <year>2017</year>
          ,
          <string-name>
            <surname>Part</surname>
            <given-names>II</given-names>
          </string-name>
          , LNAI, vol.
          <volume>10449</volume>
          , pp.
          <fpage>529</fpage>
          -
          <lpage>537</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Sak</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gongur</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Saraclar</surname>
          </string-name>
          . M.:
          <article-title>Morphological disambiguation of Turkish text with perceptron algorithm</article-title>
          .
          <source>In: Computational Linguistics and Intelligent Text Processing</source>
          , 8th International Conference CICLing, Mexico City, Mexico,
          <year>February 2007</year>
          , pp.
          <fpage>107</fpage>
          -
          <lpage>118</lpage>
          .
          <string-name>
            <surname>Mexico</surname>
          </string-name>
          (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Qinlan</surname>
            <given-names>Shen</given-names>
          </string-name>
          , Daniel Clothiaux, Emily Tagtow, Patrick Littell, Chris Dyer.:
          <article-title>The Role of Context in Neural Morphological Disambiguation</article-title>
          .
          <source>In: Proceedings of COLING</source>
          <year>2016</year>
          ,
          <source>the 26th International Conference on Computational Linguistics: Technical Papers</source>
          , pp.
          <fpage>181</fpage>
          -
          <lpage>191</lpage>
          .
          <string-name>
            <surname>Osaka</surname>
          </string-name>
          (
          <year>2016</year>
          ) http://aclweb.org/anthology/C16-1018, last accessed
          <year>2018</year>
          /10/25.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Orosz</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Novák</surname>
          </string-name>
          , A.:
          <article-title>PurePos 2.0: a hybrid tool for morphological disambiguation</article-title>
          .
          <source>In: Proceedings of Recent Advances in Natural Language Processing</source>
          , pp.
          <fpage>539</fpage>
          -
          <lpage>545</lpage>
          . (
          <year>2013</year>
          ) http://aclweb.org/anthology//R/R13/R13-1071.pdf,
          <source>last accessed</source>
          <year>2018</year>
          /10/25.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Yuret</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ture</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Learning morphological disambiguation rules for Turkish</article-title>
          .
          <source>In: Proceedings of the Human Language Technology Conference of the North American Chapter of the ACL</source>
          , pp.
          <fpage>328</fpage>
          -
          <lpage>334</lpage>
          . New York (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Gilmullin</surname>
            ,
            <given-names>R.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gataullin</surname>
            ,
            <given-names>R.R.</given-names>
          </string-name>
          :
          <article-title>Razreshenie morfologicheskoj mnogoznachnosti tekstov na tatarskom yazyke na osnove instrumentariya PurePos [Morphological disambiguation of Tatar texts using PurePos]</article-title>
          .
          <source>In: Proceedings of the V International Conference on Turkic Languages Processing «TurkLang</source>
          <year>2017</year>
          », pp.
          <fpage>30</fpage>
          -
          <lpage>37</lpage>
          . Fen,
          <string-name>
            <surname>Kazan</surname>
          </string-name>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Berment</surname>
          </string-name>
          , V.:
          <article-title>Me´thodes pour informatiser des langues et des groups de langues peu dote´es</article-title>
          ,
          <string-name>
            <surname>Ph</surname>
            .
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Thesis</surname>
          </string-name>
          , J. Fourier University, Grenoble (
          <year>2004</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Krauwer</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>The basic language resource kit (BLARK) as the first milestone for the language resources roadmap</article-title>
          .
          <source>In: Proceedings of International Workshop on Speech and Computers - SPEECOM</source>
          , pp.
          <fpage>8</fpage>
          -
          <lpage>15</lpage>
          . Moscow (
          <year>2003</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Hochreiter</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>Long short-term memory</article-title>
          .
          <source>Neural Computation</source>
          <volume>9</volume>
          (
          <issue>8</issue>
          ),
          <fpage>1735</fpage>
          -
          <lpage>1780</lpage>
          (
          <year>1997</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Gers</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          :
          <article-title>Learning to Forget: Continual Prediction with LSTM</article-title>
          .
          <source>Neural Computation</source>
          <volume>12</volume>
          (
          <issue>10</issue>
          ),
          <fpage>2451</fpage>
          -
          <lpage>2471</lpage>
          (
          <year>2000</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Lewis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Paul</surname>
          </string-name>
          , Gary F. Simons, and Charles D. Fennig (eds.): Ethnologue: Languages of the World, http://www.ethnologue.
          <source>com last accessed</source>
          <year>2018</year>
          /10/25.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Gilmullin</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gataullin</surname>
          </string-name>
          , R.:
          <article-title>Morphological Analysis System of the Tatar Language</article-title>
          . In: Nguen,
          <string-name>
            <surname>N.T.</surname>
          </string-name>
          et al. (eds).
          <source>ICCCI</source>
          <year>2017</year>
          ,
          <string-name>
            <surname>Part</surname>
            <given-names>II</given-names>
          </string-name>
          , LNAI, vol.
          <volume>10449</volume>
          , pp.
          <fpage>519</fpage>
          -
          <lpage>528</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Gataullin</surname>
            ,
            <given-names>R.R.</given-names>
          </string-name>
          :
          <article-title>Web-instrumentarij dlya snyatiya morfologicheskoj mnogoznachnosti v tekstovom korpuse tatarskogo yazyka [Web-based toolkit for morphological disambiguation in the corpus of Tatar texts]</article-title>
          .
          <source>In: Proceedings of the V International Conference on Preservation and Development of Native Languages in a Multinational State</source>
          , pp.
          <fpage>71</fpage>
          -
          <lpage>73</lpage>
          . Otechestvo,
          <string-name>
            <surname>Kazan</surname>
          </string-name>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>