<!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>Multi-Task Classification Model for Muitilingual Patents</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yongxin Peng</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Xinyu Tong</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yueyun Zhang</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yonghe Lu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Artificial Intelligence, Sun Yat-sen University</institution>
          ,
          <addr-line>Tangjiawan, Zhuhai, 519082</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>School of Information Management, Sun Yat-sen University</institution>
          ,
          <addr-line>Waihuan east street No.132, Guangzhou, 510006</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The existing patent text classification models perform well in many commonly-used languages but show suboptimal performance with corpora from the Association of Southeast Asian Nations (ASEAN). This paper proposes a multi-task modeling approach to train a multilingual patent classification model, which applies to patent texts of multiple languages, including commonly-used and low-resource languages. The model learns joint text embeddings by training a multilingual patent classifier and a cross-lingual text-pair similarity discriminator using monolingual classification labeled data and aligned bilingual corpora at the sentence or paragraph level. The method shows competitive performance, achieving up to 5% improvement in accuracy over mBERT on cross-lingual patent classification tasks in Thai and English.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Patent classification</kwd>
        <kwd>Multilingual classification</kwd>
        <kwd>Multi-task learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Automatic classification of patent documents is crucial
for intellectual property protection, patent management,
and information retrieval. Designing an accurate and
automated patent classification model can provide significant
support for patent inventors and examiners. While
existing text classification models perform well with patents in
commonly-used languages such as English and Chinese,
they struggle with patents written in low-resource
languages from the ASEAN region. This challenge is often
due to the lack of labeled data, a common issue across
various NLP tasks, including text classification, named entity
recognition (NER), and sentiment classification.</p>
      <p>
        Recently, multilingual pre-trained models have been
widely used to fine-tune and train text classification
models. Experiments have proven that fine-tuned multilingual
pre-trained models perform well in situations with limited
labeled data. One of these models is multilingual BERT, also
called mBERT, proposed by Devlin et al.[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and trained on
104 languages. With the powerful multilingual text
representation capability of mBERT, Pelicon et al.[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] have created
text representations for news datasets in Slovenian and
Croatian and successfully transferred sentiment classification
tasks across these two languages. XLM by Conneau and
Lample[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], despite being pre-trained using masked language
modeling (MLM) and causal language modeling (CLM) on
mBERT, added a module called translation language
modeling (TLM) to splice parallel translation sentence pairs. XLM
has reported state-of-the-art performance on several NLP
downstream benchmarks and has been widely used in many
multilingual tasks for text representation. Choi et al.[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]
validated the hypothetically strong cross-lingual transfer
properties induced by XLM pre-training, and experiments
with XLM-RoBERTa (XLM-R) indicated that cross-lingual
transfer is most pronounced in semantic textual
similarity. Considering the shortcomings of existing pre-trained
models, new models are constantly being proposed, such as
      </p>
      <p>
        MultiFit by Eisenschlos et al.[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], which facilitates
practitioners in efectively training and fine-tuning language models
in their own language. However, while pre-trained models
contribute significantly to text representation, there are still
areas for improvement.
      </p>
      <p>
        In addition to selecting the most advanced model at the
pre-training stage, some scholars have also enhanced model
performance by using bilingual dictionaries or multilingual
parallel corpora [
        <xref ref-type="bibr" rid="ref6 ref7 ref8">6, 7, 8</xref>
        ]. The main purpose of using
bilingual dictionaries or parallel corpora is to obtain the mapping
relationship between diferent languages, which is valuable
for models to learn cross-language text embedding.
Moreover, some studies have shown that in cross-lingual
classiifcation tasks, models that introduce the mapping
relationship between languages achieve better results than those
relying only on monolingual data [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref9">9, 10, 11, 12</xref>
        ].
Assuming we use a multilingual parallel corpus to assist training,
one method is multi-task modeling [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], which involves
training multiple related tasks together based on shared
representations. The domain-related information possessed by
related tasks serves as a derivation bias to improve the
generalization efect of the main task. Some researchers have
adopted multi-task learning at the stage of text
representation to obtain better representations [
        <xref ref-type="bibr" rid="ref14 ref15 ref16">14, 15, 16</xref>
        ]. Others
have improved the model’s accuracy from the perspective
of auxiliary tasks. For example, in the popular research field
of sentiment classification, researchers have focused on the
correlation between diferent emotions [
        <xref ref-type="bibr" rid="ref17 ref18 ref19 ref20">17, 18, 19, 20</xref>
        ] and
the practice of adding auxiliary tasks. In text classification
research, the basic goal is to use the potential correlation
between related tasks to obtain common features, including
language modeling [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] and domain information [
        <xref ref-type="bibr" rid="ref22 ref23">22, 23</xref>
        ],
to enhance the model’s performance.
      </p>
      <p>In this work, we first adopt a multilingual pre-trained
model to enhance text representation. Then, we jointly train
a multilingual text classifier and a cross-lingual text
similarity discriminator using a multi-task learning approach. This
allows us to learn multilingual patent text embeddings
effectively. During this process, the patent classification task
and the text similarity discrimination task interact through
shared embedding layers, continuously adjusting their
respective parameters. The text similarity discrimination task,
as a sub-task within the multi-task framework, influences
the main patent classification task through its gradient
adjustments.</p>
      <p>The motivation behind this method is to learn
highquality multilingual text embeddings, including
sentencelevel and paragraph-level, in low-resource scenarios. The
contributions of this research are twofold. Firstly, we
construct a patent corpus for low-resource languages of ASEAN
countries and a parallel patent corpus combining common
and low-resource languages. Secondly, we combine
stateof-the-art multilingual pre-trained models with multi-task
frameworks for training. Specifically, the shared word
embedding layer enables both the text classification task and
the text similarity task to update parameters simultaneously
during training. By jointly training these models, the
framework can leverage both text classification data and parallel
text pairs to learn multilingual text embeddings and achieve
better patent classification results.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Methodology</title>
      <p>In this work, multi-task learning is used to jointly train
patent text representations. The main task is patent
classification, while the secondary task is cross-lingual text
similarity, which transfers additional linguistic semantic
information to the main task.</p>
      <sec id="sec-2-1">
        <title>2.1. Patent Classification</title>
        <p>As the main task, patent classification involves dividing
patents into multiple categories. During training, the
objective is to minimize classification error. We use features
extracted from a multilingual pre-trained model as the text
representation, and a two-layer feed-forward network with
a softmax layer as the classifier.</p>
        <p>Given a multi-class classification scenario, the softmax
layer normalizes output values to ensure that each class’s
probability is non-negative and their sum is one. The
calculation formula for one label’s probability is shown in Eq.(1).
Let  denote the probability that the patent text belongs
to the -th class, and  denote the number of labels. Here,
 is a natural constant, and  represents the input vector’s
power value.</p>
        <p>=</p>
        <p>∑︀=− 01 
,  ∈ {0, 1, ...,  − 1}
(1)
The following equation Eq.(2) is about the loss function, in
1–7
(2)
(3)
which  denotes the loss of patent text classification and
 represents the real label of the example. If the model
predicts correctly,  is 1; otherwise, it is 0.</p>
        <p>= −
− 1
∑︁  · ()
=0</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Cross-lingual Text Similarity Task</title>
        <p>The cross-lingual text similarity task actually learns
more language-related semantic information by increasing
the correspondence between diferent languages as auxiliary
signals. The aim of this task is to map diferent languages
into the same semantic space, which means finding the
mapping function  for two languages. Assuming that one
language is Language  and the other is Language , our
purpose is to determine the parameters that satisfy Eq.(3).</p>
        <p>() =</p>
        <p>We regard function  as a series of operations, such as
transforming and rotating the semantic space, as shown in
Fig.1. However,  consists of a complex neural network,
which is dificult to express as a specific mathematical
formula.</p>
        <p>Text similarity discrimination is essentially a binary
classification task. The final prediction results of the model
are either similar or dissimilar. The calculation method of
the loss is shown in Eq.(4), where  represents the loss of
the discriminator and  represents the sample label. If two
sentences or paragraphs are similar, the label is 1; otherwise,
the label is 0. Similarly,  refers to the probability that 
belongs to a positive sample (labeled as 1).</p>
        <p>sim = − [ · log() + (1 − ) · log(1 − )] (4)
Finally, the total loss of multi-task cross-lingual patent
classification is the sum of two loss functions, as shown in
Eq.(5).</p>
        <p>total = clsf + sim
(5)</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Model</title>
      <p>The model we proposed consists of an embedding layer,
a joint feature extractor, a patent label classifier, and a text
similarity discriminator, as shown in Fig.2.</p>
      <sec id="sec-3-1">
        <title>3.1. Embedding layer</title>
        <p>The purpose of the embedding layer is to convert
text into vectors, which are numerical representations that
can be processed by machine learning models. In this work,
we chose English, a widely-used language, and Thai, one
of the ASEAN languages, to demonstrate the model’s
capability to handle multilingual data.Despite the diferent
inputs, the text representation model mBERT shares a series
of parameters.</p>
        <p>To optimize for two distinct tasks—patent label
classification and cross-lingual text similarity discrimination—we
modify the form of inputs according to their specific
requirements. For patent label classification, the input consists of
the entire sentence or paragraph in either English or Thai.
This task aims to classify the patent text into predefined
categories based on its content.</p>
        <p>In contrast, the input for the similarity discrimination
task involves paired sentences or paragraphs in English and
Thai, separated by the delimiter [SEP]. This setup enables
the model to learn the relationship and semantic similarity
between texts in diferent languages. Despite the
diferent input structures, the text representation model mBERT
shares a series of parameters, ensuring that the
multilingual embeddings are consistent and comparable across both
tasks.</p>
        <p>Furthermore, by leveraging mBERT’s pre-trained
capabilities, we significantly reduce the amount of data required
for efective training. This is particularly advantageous in
scenarios involving low-resource languages, where labeled
data is scarce. The embedding layer thus plays a critical
role in bridging linguistic gaps and enhancing the model’s
applicability to diverse multilingual tasks.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Joint Feature Extractor</title>
        <p>In our conception, we aim to learn relationships
between diferent languages and incorporate them into text
classification as complementary knowledge. If the feature
extractor can extract features that satisfy both text
classification and text similarity tasks, the model may efectively map
text in diferent languages to the same semantic space. This
unified semantic space allows for improved cross-lingual
understanding and classification accuracy.</p>
        <p>To achieve this, we designed a joint feature extractor with
the following combinations: mBERT+FC, mBERT+CNN,
mBERT+BiLSTM, and mBERT+Attention.</p>
        <p>(1) mBERT+FC: This combination uses a fully connected
layer to reduce the dimensionality of the embeddings from
mBERT. It provides a straightforward approach to
integrating and processing the extracted features.</p>
        <p>(2) mBERT+CNN: TextCNN captures local patterns and
n-grams within the text. By applying convolutional filters,
it detects key phrases and local dependencies, which are
crucial for understanding the contextual meaning in sentences
and paragraphs.</p>
        <p>(3) mBERT+BiLSTM: BiLSTM captures long-range
dependencies and sequential patterns by processing the text in
both forward and backward directions. This approach is
essential for understanding the nuances and intricate
relationships within complex patent texts.</p>
        <p>(4) mBERT+Attention: Attention mechanisms allow the
model to focus on the most relevant parts of the text,
dynamically weighing the importance of diferent words and
phrases. This selective focus enhances the model’s ability
to highlight critical information, improving the accuracy of
both classification and similarity tasks.</p>
        <p>This joint training process ensures that the embeddings
are optimized for multiple tasks simultaneously, improving
the model’s overall performance. The joint feature extractor
enables the model to understand and classify multilingual
patent texts more efectively, particularly in low-resource
scenarios where annotated data is limited.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Cross-lingual Text Similarity</title>
      </sec>
      <sec id="sec-3-4">
        <title>Discriminator</title>
        <p>
          Generally, the similarity between two sentences or
paragraphs is a score representing the relevance and likelihood
between them. Despite using the same words with identical
writing, text similarity should encompass both syntactic
and semantic information. Syntactic similarity is based on
string matching, while semantic similarity refers to the
similar meaning between words, sentences, paragraphs, and
even documents. Since the calculation of text similarity
in this paper involves diferent languages, more attention
should be given to the degree of semantic similarity across
languages. When calculating semantic similarity, it is
natural to consider a common semantic vector space [
          <xref ref-type="bibr" rid="ref24 ref25">24, 25</xref>
          ],
which can be used to calculate the similarity between texts
within the same dimension.
        </p>
        <p>By leveraging the shared semantic space provided by the
multilingual pre-trained model, the cross-lingual text
similarity discriminator efectively measures the semantic
relevance between texts in diferent languages. This capability
is essential for enhancing the performance of multilingual
applications, ensuring that the model can accurately
identify and utilize semantic similarities across languages. The
output of the discriminator is the probability of text
similarity, represented by a binary classification: 1 for similar and
0 for dissimilar.</p>
      </sec>
      <sec id="sec-3-5">
        <title>3.4. Patent Label Classifier</title>
        <p>The patent label classifier corresponds to the patent
classification task, which is the main goal of our work. This
classifier is designed to categorize patent texts into
predeifned classes based on their content, helping in the eficient
organization and retrieval of patent information.</p>
        <p>The classifier operates by first receiving the vector
representations from the joint feature extractor. These vectors
encapsulate the semantic information derived from the
original patent texts. To make these high-dimensional vectors
1–7
manageable and suitable for classification, the classifier
reduces their dimensionality through a fully connected layer.
This reduction helps in simplifying the complexity of the
data, making the subsequent classification process more
eficient and efective.</p>
        <p>An important feature of our patent label classifier is its
applicability to multilingual data. Since both English and
Thai texts are converted into vectors using the same
embedding process, the classifier can seamlessly handle patents in
both languages.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Experiment</title>
      <sec id="sec-4-1">
        <title>4.1. Datasets</title>
        <p>In this study, we constructed two main datasets: a
parallel corpus for training the similarity computation model
and a classification corpus for the classification task.</p>
        <sec id="sec-4-1-1">
          <title>4.1.1. Cross-lingual Parallel Corpus</title>
          <p>The cross-lingual parallel corpus is a multilingual
dataset composed of original texts and their corresponding
target texts by translation. Given the scarcity of available
corpora in the field of patents, we independently built a
patent parallel corpus for ASEAN languages. Specifically,
we selected 10,000 English patents from the Google
BigQuery dataset and translated their titles and abstracts of
claims into Thai using the Google Translate API. This
translation process created a bilingual parallel corpus, enabling
the model to learn mapping relationships between texts
from diferent languages. The parallel corpus includes both
sentence-level and paragraph-level data, with labels
indicating whether the text pairs have translation correspondence
(1) or not (0), with the latter obtained through shufling.</p>
        </sec>
        <sec id="sec-4-1-2">
          <title>4.1.2. Patent Classification Corpus</title>
          <p>
            For the classification task, we accessed patent data in
both English and Thai from the Google BigQuery dataset by
writing SQL queries to randomly download patents.
Considering that Lee and Hsiang [
            <xref ref-type="bibr" rid="ref26">26</xref>
            ] have shown that only
patent claims are suficient to complete the classification
task, we constructed a patent classification corpus that
includes the patent title, the abstract of the claim, and the
international patent number, which corresponds to the
Cooperative Patent Classification (CPC) system. The CPC is a
result of a partnership between the EPO and the USPTO to
develop a common, internationally compatible classification
system for technical documents, including sections, classes,
subclasses, groups, and complete classification symbols.
          </p>
          <p>To ensure the dataset was balanced, we used random
sampling to adjust the number of patents in each language.</p>
          <p>After processing, the total amount of data for each class
is very close, with approximately 8,000 samples for each
section, although slight variations occur due to the random
sampling process. The dataset is then divided into a training
set, validation set, and test set in the ratio of 8:1:1, resulting
in 64,000 training samples, 8,000 validation samples, and
8,000 test samples. See details in Table 1.</p>
          <p>By constructing these two datasets, we aim to
facilitate both the cross-lingual text similarity task and the
patent classification task, ensuring that our multi-task
learning framework can leverage the rich semantic information
from multilingual texts.
*Multi-Task(Par-level): Cross-lingual text similarity task with paragraph-level parallel corpus
*Multi-Task(Sen-level): Cross-lingual text similarity task with sentence-level parallel corpus</p>
        </sec>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Setting</title>
        <p>In the experiments, we set the following parameters.
The number of iterations is 20 rounds, and the learning
rate is uniformly set to 1e-4. Since the two tasks need to
use shared text embeddings, the parameters of the two
pretrained models are shared, which is equivalent to using
the same mBERT for the vectorized representation of text.
Additionally, since BERT is a 12-layer transformer structure,
we freeze the parameters of the first 9 layers of mBERT
and only allow the parameters in the last three layers to be
updated, with the aim of saving time.</p>
        <p>For training, we alternated between text classification
and text similarity tasks in each batch. Specifically, one
batch would be used to update the model based on the text
classification task, and the next batch would be used to
update the model based on the text similarity task. This
alternating training approach helps in jointly optimizing
the model for both tasks.</p>
        <p>The input dimension for mBERT is 768, which
corresponds to the size of the embeddings produced by the model.
After passing through the feature extractor (which can be a
fully connected layer, CNN, BiLSTM, or Attention
mechanism), the representations are reduced to 128 dimensions
before being fed into the classifier or similarity
discriminator.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Evaluation Methods</title>
        <p>We adopt the commonly used classification accuracy
(Acc) and macro-F1 value as evaluation metrics to
measure our proposed model. To comprehensively analyze the
performance of our multi-task model, we choose fully
connected (FC) layers, CNN, BiLSTM, and Attention as feature
extraction models for comparison. In addition, we set
corresponding single-task learning models as baseline methods.
The evaluation was carried out on both the patent
classification task and the text similarity task to ensure a holistic
assessment of the model’s performance.</p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Results Analysis</title>
        <p>With the settings above, the results of the models are
shown in Table 2. Compared to the baseline experiments,
our proposed multi-task learning model shows better
performance in patent classification overall. The results indicate
that multi-task learning can achieve performance
improvements through related auxiliary tasks during the training
process. After multi-task learning, the performance gap
among models is reduced to less than 3.47% in accuracy and
less than 3.48% in macro-F1. This suggests that learning
sentence pair similarity classification is the most important
factor afecting the performance of multi-task learning models.
The mBERT+Attention combination achieves the best
results in both single-task and multi-task learning. Attention
uses an auto-focusing mechanism to capture the most
important semantic information in sentences, enhancing text
representation and classification performance. Results on
diferent datasets in multi-task learning show that
sentencelevel learning performs better than paragraph-level
learning, except in the mBERT+BiLSTM model. We suppose that
sentence-level learning can focus more on local
information, which is representative of the text topic. Meanwhile,
CNN and Attention have advantages in capturing local
information to an extent, resulting in good outcomes in our
multi-task learning. BiLSTM is more efective at obtaining
semantic information from long texts and performs better
in paragraph-level learning, but the introduction of
BiLSTM has not brought significant improvement in multi-task
learning overall.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>The results show that joint multi-task learning of patent
text classification and cross-lingual text similarity based
on a multilingual pre-trained model is efective, improving
accuracy by 5.39% and macro-F1 by 5.50% over the baseline,
with the highest result reaching 76.54% in accuracy and
76.03% in macro-F1. This demonstrates that joint
multitasking can fully utilize the mapping relationship between two
languages in parallel text pairs and incorporate this
information into the main task of patent classification through
the sub-task of discriminating text similarity. Theoretically,
the overall scheme designed in this study can be transferred
to any low-resource language, and its application can be
extended to multiple tasks such as sentiment classification
and natural language reasoning, not only text classification.
In addition to the portability of tasks, the domain is also
transferable; that is, in addition to patents, it can also be
applied to fields such as medicine and social media.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Discussion and Future Work</title>
      <p>In this paper, we demonstrate that cross-lingual text
discrimination can supplement semantic information for
multilingual text classification tasks. However, this approach
still requires the use of parallel corpora or translation text
pairs. Considering the convenience of data acquisition,
future research needs to focus on reducing dependence on
large data volumes and enhancing the model’s ability to
learn from limited data. Currently, technologies such as
adversarial transfer and domain adaptation can address this
expectation. These technologies eliminate the reliance on
parallel data, enabling the training of models suitable for
multiple languages in an unsupervised manner. However,
these technologies are still in development, particularly in
addressing the issue of distributional shift across languages.
Our future work will also explore more advanced methods
for intelligent multilingual information processing.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgement</title>
      <p>The authors warmly thank reviewers for their valuable
suggestions. This research was partly supported by
KeyArea Research and Development Program of Guangdong
Province (NO.2021B0101420004).
1–7</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , Bert:
          <article-title>Pre-training of deep bidirectional transformers for language understanding (</article-title>
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Pelicon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pranjić</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Miljković</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Škrlj</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pollak</surname>
          </string-name>
          ,
          <article-title>Zero-shot learning for cross-lingual news sentiment classification</article-title>
          ,
          <source>Applied Sciences</source>
          <volume>10</volume>
          (
          <year>2020</year>
          )
          <fpage>5993</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Conneau</surname>
          </string-name>
          , G. Lample,
          <article-title>Cross-lingual language model pretraining</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>32</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>H.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Joe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Min</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gwon</surname>
          </string-name>
          ,
          <article-title>Analyzing zeroshot cross-lingual transfer in supervised nlp tasks</article-title>
          ,
          <source>in: 2020 25th International Conference on Pattern Recognition (ICPR)</source>
          , IEEE,
          <year>2021</year>
          , pp.
          <fpage>9608</fpage>
          -
          <lpage>9613</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.</given-names>
            <surname>Eisenschlos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ruder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Czapla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kadras</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gugger</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Howard,</surname>
          </string-name>
          <article-title>MultiFiT: Eficient multi-lingual language model fine-tuning</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Hong Kong, China,
          <year>2019</year>
          , pp.
          <fpage>5702</fpage>
          -
          <lpage>5707</lpage>
          . URL: https://aclanthology. org/D19-1572. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>D19</fpage>
          -1572.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , L. Zhu, J. Liu,
          <article-title>Unsupervised cross-language model for patent recommendation based on representation</article-title>
          ,
          <source>Data Analysis and Knowledge Discovery</source>
          <volume>4</volume>
          (
          <year>2020</year>
          )
          <fpage>93</fpage>
          -
          <lpage>103</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Artetxe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Schwenk</surname>
          </string-name>
          ,
          <article-title>Massively multilingual sentence embeddings for zero-shot cross-lingual transfer and beyond, Transactions of the Association for Computational Linguistics 7 (</article-title>
          <year>2019</year>
          )
          <fpage>597</fpage>
          -
          <lpage>610</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Athiwaratkun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Cardie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Weinberger</surname>
          </string-name>
          ,
          <article-title>Adversarial deep averaging networks for crosslingual sentiment classification, Transactions of the Association for Computational Linguistics 6 (</article-title>
          <year>2018</year>
          )
          <fpage>557</fpage>
          -
          <lpage>570</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>E.</given-names>
            <surname>Schumacher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mayfield</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dredze</surname>
          </string-name>
          ,
          <article-title>Cross-lingual transfer in zero-shot cross-language entity linking, in: Findings of the Association for Computational Linguistics: ACL-IJCNLP</article-title>
          <year>2021</year>
          ,
          <year>2021</year>
          , pp.
          <fpage>583</fpage>
          -
          <lpage>595</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>X.</given-names>
            <surname>Meng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Cui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <article-title>Multilingual text classification method based on bi-directional long short-term memory and convolutional neural network</article-title>
          ,
          <source>Application Research of Computers</source>
          (
          <year>2020</year>
          )
          <fpage>037</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>R.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Westerfield</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Bingham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fabbri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Verma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Radev</surname>
          </string-name>
          ,
          <article-title>Improving lowresource cross-lingual document retrieval by reranking with deep bilingual representations, in: 57th Annual Meeting of the Association for Computational Linguistics</article-title>
          ,
          <string-name>
            <surname>ACL</surname>
          </string-name>
          <year>2019</year>
          ,
          <article-title>Association for Computational Linguistics (ACL</article-title>
          ),
          <year>2020</year>
          , pp.
          <fpage>3173</fpage>
          -
          <lpage>3179</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>W.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <article-title>Tibetanchinese cross-lingual word embeddings based on muse</article-title>
          ,
          <source>in: Journal of Physics: Conference Series</source>
          , volume
          <volume>1453</volume>
          ,
          <string-name>
            <given-names>IOP</given-names>
            <surname>Publishing</surname>
          </string-name>
          ,
          <year>2020</year>
          , p.
          <fpage>012043</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Niu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <surname>D. R</surname>
          </string-name>
          ,
          <string-name>
            <surname>Q</surname>
          </string-name>
          ,
          <article-title>Domain information sharing method in mongolianchinese machine translation application</article-title>
          ,
          <source>Computer Engineering and Applications</source>
          <volume>56</volume>
          (
          <year>2020</year>
          )
          <article-title>9</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>G.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <article-title>Multitask learning using a hybrid representation for text classification</article-title>
          ,
          <source>Neural Computing and Applications</source>
          <volume>32</volume>
          (
          <year>2020</year>
          )
          <fpage>6467</fpage>
          -
          <lpage>6480</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>B.</given-names>
            <surname>Tian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Xing</surname>
          </string-name>
          ,
          <article-title>Hierarchical interattention network for document classification with multi-task learning</article-title>
          , in: Twenty-Eighth
          <source>International Joint Conference on Artificial Intelligence IJCAI-19</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>K.</given-names>
            <surname>Singla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Can</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Narayanan</surname>
          </string-name>
          ,
          <article-title>A multi-task approach to learning multilingual representations</article-title>
          ,
          <source>in: Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume</source>
          <volume>2</volume>
          :
          <string-name>
            <surname>Short</surname>
            <given-names>Papers)</given-names>
          </string-name>
          ,
          <year>2018</year>
          , pp.
          <fpage>214</fpage>
          -
          <lpage>220</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>N.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <surname>L.</surname>
          </string-name>
          <article-title>Wang, Multi-label emotion classification based on adversarial multi-task learning</article-title>
          ,
          <source>Information Processing &amp; Management</source>
          <volume>59</volume>
          (
          <year>2022</year>
          )
          <fpage>103097</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>K. B. Nelatoori</surname>
          </string-name>
          , H. B.
          <article-title>Kommanti, Multi-task learning for toxic comment classification and rationale extraction</article-title>
          ,
          <source>Journal of Intelligent Information Systems</source>
          (
          <year>2022</year>
          )
          <fpage>1</fpage>
          -
          <lpage>25</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>J.</given-names>
            <surname>Barnes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Velldal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Øvrelid</surname>
          </string-name>
          ,
          <article-title>Improving sentiment analysis with multi-task learning of negation</article-title>
          ,
          <source>Natural Language Engineering</source>
          <volume>27</volume>
          (
          <year>2021</year>
          )
          <fpage>249</fpage>
          -
          <lpage>269</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>X.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jolfaei</surname>
          </string-name>
          <article-title>, Multi-task fuzzy clustering-based multi-task tsk fuzzy system for text sentiment classification</article-title>
          ,
          <source>Transactions on Asian and Low-Resource Language Information Processing</source>
          <volume>21</volume>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>24</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          <article-title>Lin, Multi-task learning with bidirectional language models for text classification</article-title>
          , in: 2019
          <source>International Joint Conference on Neural Networks (IJCNN)</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>J.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>A multidomain text classification method based on recurrent convolution multi-task learning</article-title>
          ,
          <source>Journal of Electronics &amp; Information Technology</source>
          <volume>43</volume>
          (
          <year>2021</year>
          )
          <fpage>2395</fpage>
          -
          <lpage>2403</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Generative multitask learning for text classification</article-title>
          ,
          <source>IEEE Access 8</source>
          (
          <year>2020</year>
          )
          <fpage>86380</fpage>
          -
          <lpage>86387</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>J.</given-names>
            <surname>Eronen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ptaszynski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Masui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Arata</surname>
          </string-name>
          , G. Leliwa,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wroczynski</surname>
          </string-name>
          ,
          <article-title>Transfer language selection for zeroshot cross-lingual abusive language detection</article-title>
          ,
          <source>Information Processing &amp; Management</source>
          <volume>59</volume>
          (
          <year>2022</year>
          )
          <fpage>102981</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>G.</given-names>
            <surname>Glavaš</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Franco-Salvador</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. P.</given-names>
            <surname>Ponzetto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <article-title>A resource-light method for cross-lingual semantic textual similarity</article-title>
          ,
          <source>Knowledge-based systems 143</source>
          (
          <year>2018</year>
          )
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>J.-S.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hsiang</surname>
          </string-name>
          ,
          <article-title>Patent classification by fine-tuning bert language model</article-title>
          ,
          <source>World Patent Information</source>
          <volume>61</volume>
          (
          <year>2020</year>
          )
          <fpage>101965</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>