<!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 Pre-trained Matching Model Based on Self- and Inter-ensemble For Product Matching Task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Shiyao Xu</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>Shijia E</string-name>
          <email>e.shijia@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Li Yang</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>Yang Xiang</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Focal Loss SWA.</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Tencent</institution>
          ,
          <addr-line>Shanghai</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Tongji University</institution>
          ,
          <addr-line>Shanghai</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The product matching task aims to identify that if a pair of product deriving from di erent websites refer to the same product or not. While the accumulated semantic annotations of products make it possible to study deep neural network-based matching methods, product matching is still a challenging task due to su ering from the class imbalance and heterogeneity of textual descriptions. In this paper, we directly regard product matching as a semantic text matching problem and propose a pre-trained matching model based on both self- and inter-ensemble. BERT is the main module in our approach for binary classi cation of product pairs. We perform two types of ensemble methods: self-ensemble using stochastic weight averaging (SWA) for the same model, and inter-ensemble combing the prediction of di erent models. Additionally, the focal loss is adopted to alleviate the imbalance problem of positive and negative samples. Experimental results show that our model outperforms existing deep learning matching approaches. The proposed model achieves an F1-score of 85.94% on the test data which ranks second in the SWC2020 on Mining the Web of HTML-embedded Product Data Task One. Our implementation has been released 3.</p>
      </abstract>
      <kwd-group>
        <kwd>Product Matching</kwd>
        <kwd>BERT</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>In recent years, online shops (e-shops) are increasingly adopting semantic markup
languages to describe their products to improve their visibility. Those semantic
annotations are conducive to the further analysis of product o ers. However,
di erent annotation systems used by e-shops often lead to data inconsistencies
or con icts. Product matching is the task of identifying the similarity of product
o er pairs, which is the fundamental technology to construct a uni ed system
such as product knowledge graphs. Moreover, product matching can improve the
e ciency and experience of online purchasing. As for customers, matching the
Copyright c 2020 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).
3 https://github.com/englishbook/product-matching
same product on di erent websites is convenient for them to compare and nd
the best choice quickly. As to the e-commerce platform, the matching results can
be used for product recommendation. Therefore, product matching is a crucial
problem in the e-commerce domain.</p>
      <p>
        Product o ers are described by the textual information (e.g. title, description,
and brand). We can think of product matching as a semantic text matching
problem. Although many previous works have been done on text matching and
have shown great success with deep neural networks [
        <xref ref-type="bibr" rid="ref12 ref15 ref6">15, 12, 6</xref>
        ], the task remains a
great challenge in the e-commerce environment. On the one hand, the semantics
of the natural language are diverse and complex, especially on the Internet.
Eshops like to use many exaggerated words and new words to attract customers.
On the other hand, there is a problem of class imbalance. Despite the huge
quantity of product o ers, most of the pairs of products are not matched which
makes the number of negative samples much larger than the positive ones.
      </p>
      <p>
        To address those limitations, we propose a pre-trained matching model based
on both self- and inter-ensemble for product matching in this paper. 1) For
semantic complexity, we apply pre-trained BERT to model text pairs. BERT [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]
is pre-trained on a large-scale unlabeled dataset and then ne-tuned for
downstream product matching task. Compared to traditional DNN models, BERT
has learned richer semantic information. 2) For class imbalance, we adopt the
focal loss [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] to better optimize parameters. It makes the training process can
focus on a few uncertain samples. 3) For generalization, we combine both
selfand inter-ensemble methods. Self-ensemble integrates model weights of the same
model at di erent training epochs. Inter-ensemble averages the matching score
resulting from di erent models. Our ensemble model achieves an F1-score of
85.94% in the nal evaluation of the product matching task on the SWC2020
challenge.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        With the development of deep learning, large amounts of matching models based
on deep neural networks have emerged and shown their e ectiveness. Previous
works mainly focus on the siamese architecture [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Those approaches generally
take word embeddings of text pairs pre-trained by word2vec [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] as input,
convert word embeddings to text representations, and then compute the similarity
between two text representations. Convolutional neural network (CNN) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and
recurrent neural network (RNN) [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] are the two mainstream methods used for
text modeling. ESIM [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and EACNNs [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] incorporate attention mechanisms
into models to pay more attention to the relevant parts of text pairs. However,
they all depend on the quality of the training dataset and face the di culty of
polysemy.
      </p>
      <p>
        Recently, pre-trained language models are proposed and have achieved
signi cant improvement in various NLP tasks, with state-of-the-art models such as
BERT [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], RoBERTa [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], and XLNET [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. The main idea of them is the
pretraining language model on large-scale unlabeled corpus before ne-tuning on
downstream tasks. Therefore, pre-trained models contain rich semantic
information and generate contextualized embeddings instead of xed ones. In this paper,
we adopt pre-trained BERT as the base model to solve the product matching
task where the semantics of textual descriptions is relatively complex.
3
3.1
      </p>
    </sec>
    <sec id="sec-3">
      <title>Model Description</title>
      <sec id="sec-3-1">
        <title>Data</title>
        <p>The WDC product data corpus, the largest publicly available product data
corpus, is released by the Web Data Commons project in 2018. The corpus consists
of 26 million products originating from 79 thousand websites. Products in the
corpus are described by these properties: id, cluster id, category, title,
description, brand, price, and speci cation table. Products with the same cluster id
indicate the same product. In the SWC2020 challenge product matching task
4, organizers provide a dataset containing matching and non-matching pairs of
products only from Computers &amp; Accessories category. It is sampled from the
product data corpus according to the clusters (68K product pairs for training,
1.1K for validation, and 1500 for testing). We also utilize an extended training
dataset 5 with all the four product categories derived by the same sample
strategy (214K for training, and 4.4K for validation). Matching models can learn
more information from extra categories and thus make a more accurate
prediction on samples from Computers. The statistics of these training datasets are
listed in Table 1.</p>
        <p>Besides, some data preprocessing operations are performed before inputting
product information into models. We remove stopwords (using NLTK) and
lowercase all textual descriptions.
4 https://ir-ischool-uos.github.io/mwpd/index.html
5 http://webdatacommons.org/largescaleproductcorpus/v2/index.html</p>
        <p>Matching Score</p>
        <p>…
T(
E(
…
…</p>
        <p>T)
E)</p>
        <p>T[&amp;*+]
BERT</p>
        <p>E[&amp;*+]</p>
        <p>T(,
E(,
…
…</p>
        <p>T-,
E-,</p>
        <p>T[&amp;*+]
E[&amp;*+]
Input Layer
[CLS] Tok 1 … Tok M [SEP] Tok 1’ … Tok N’ [SEP]</p>
        <p>Product A
Information</p>
        <p>Product B</p>
        <p>Information</p>
        <p>Although products are described by many attributes, most of the elds
contain NULL values. The title attribute of all products is lled, and the lling rate
of the description attribute is relatively high. Therefore, we mainly focus on these
two attributes. We concatenate the textual information of product pair by [SEP]
token at rst, and then add [CLS] and [SEP] tokens at the beginning and end
respectively as the input of BERT, x = [[CLS] tA dA [SEP ] tB dB [SEP ]]. BERT
can model the input tokens through the multi-layer bidirectional Transformer
encoder and generate high-level representations. The output state of BERT that
corresponds to [CLS] token is used as the pair representation. We feed the
representation into a fully connected layer with the sigmoid activation function and
obtain the nal matching score p between two product o ers.
where pt = p when the ground truth is 1, otherwise pt = 1 p. The weight
factor 2 [0; 1] is set according to class frequency to balance the importance
of positive and negative samples. For convenience, we de ne t similar to pt.
Moreover, the focusing parameter 2 [0; 5] is introduced to di erentiate easy
and hard examples. In that way, the samples that have been accurately classi ed
contribute less to the loss so that model can focus training on few hard cases.</p>
      </sec>
      <sec id="sec-3-2">
        <title>Ensemble</title>
        <p>Final Result</p>
        <p>Inter-ensemble
Model 1</p>
        <p>Model 2
…</p>
        <p>Model m
Self-ensemble</p>
        <p>BERT</p>
        <p>BERT
…</p>
        <p>BERT
Epoch  Epoch  + 1</p>
        <p>Epoch  +</p>
        <p>
          Self-ensemble: for the same model at di erent training. As illustrated in
Figure 2, we use the stochastic weight averaging strategy [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] in the training phase.
When the model is about to converge, the model weights trained at di erent
epochs are averaged as the nal weights of the model. Compared with the
traditional method that only retains the weights at the nal epoch, SWA can help
avoid the local optimal solution and improve the generalization ability without
increasing training cost.
        </p>
        <p>Inter-ensemble: for di erent models. Di erent models have their advantages.
For example, models trained by the cross-entropy loss should predict more
accurately on substantial non-matched samples, while models with the focal loss
should perform better on few hard examples. In this paper, multiple models are
obtained by training on di erent datasets, inputs, and loss functions. As
illustrated in Figure 2, we average the prediction probability of these models as the
nal results to combine the strengths of di erent models.
3.5</p>
      </sec>
      <sec id="sec-3-3">
        <title>Post-processing</title>
        <p>Many attributes are not fed into the model for training, but they are undoubtedly
useful for product matching. In the SWC2020 challenge, we attempt to take
full advantage of them to correct the prediction results. The values of category
attributes are assigned to four uni ed categories. Two products belonging to
di erent categories must be non-matched. For test pairs with prediction results of
1 but di erent categories, we correct their results to 0. The following experiments
demonstrate the e ectiveness of the post-processing operation. Similarly, the
brand and price can also be used for correction in the future.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Experiments</title>
      <p>4.1</p>
      <sec id="sec-4-1">
        <title>Experimental Setups</title>
        <p>
          Product textual information is padded or truncated to a xed length. The max
length is set to 64 and 200 for the input only with product title and the
concatenation of title and description, respectively. For pre-trained BERT, we initialize
the model by the weights of BERTbase. For focal loss, is set to 0.75, and
is set to 2 to focus on hard positive samples. The optimizer we adopt is Adam
[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] with constant learning rate of 2 10 5. We start to use the SWA and early
stopping strategy after the fth training epoch.
4.2
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>Results on the Validation Set</title>
        <p>The F1 score on the positive class is used as the evaluation metric. We have
trained multiple models with di erent architectures and training strategies.
Models trained on the All dataset are also evaluated on the validation set with four
categories. Table 2 shows the experimental results of these models on the
validation set in detail. We can nd that the performance of pre-trained BERT
for the product matching task is signi cantly better than other classic matching
models (e.g. CNN, ESIM). Incorporating focal loss and SWA strategy further
improves the BERT models. Moreover, post-processing can indeed correct some
prediction errors e ectively.
After obtaining various models, we select several models that perform better on
the validation set and try to integrate them by inter-ensemble strategy.
Averaging the matching score predicted by multiple models can combine their strengths.
The results of our ensemble models on the validation set in the Computers
dataset are presented in Table 3. Ensemble models are generally better than
single models. In the nal evaluation of the test data, we submitted the
prediction result of our best ensemble model. As shown in Table 4, we achieve an
F1-score of 85.94% on the test set which ranks second. The experimental results
demonstrate the e ectiveness and generalization ability of our proposed model.
In this paper, we propose a pre-trained matching model based on both
selfand inter-ensemble for product matching. Pre-trained BERT is adopted as the
base matching model. We incorporate the SWA strategy in the training phase to
improve the generalization ability of models and combine the output of di erent
models to make full use of their advantages. Experimental results show that
our model achieves great improvement compared with existing state-of-the-art
matching models.</p>
        <p>An interesting direction of future work is to pre-train BERT on product data
corpus so that it can learn more product description ways. Also, post-processing
operations are worthy of further study, especially in industry practice.</p>
        <p>Acknowledgments This work was supported by the National Key Research
and Development Program of China (Grant No. 2019YFB1704402) and 2019
Tencent Marketing Solution Rhino-Bird Focused Research Program.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bromley</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bentz</surname>
            ,
            <given-names>J.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bottou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guyon</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , LeCun, Y.,
          <string-name>
            <surname>Moore</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sckinger</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shah</surname>
          </string-name>
          , R.:
          <article-title>Signature Veri cation using a \Siamese" Time Delay Neural Network</article-title>
          .
          <source>In: Proceedings of the International Journal of Pattern Recognition and Arti cial Intelligence</source>
          . vol.
          <volume>7</volume>
          , pp.
          <volume>669</volume>
          {
          <issue>688</issue>
          (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ling</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wei</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jiang</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Inkpent</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Enhanced LSTM for Natural Language Inference</article-title>
          .
          <source>In: Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics</source>
          . pp.
          <volume>1657</volume>
          {
          <fpage>1668</fpage>
          .
          <article-title>Association for Computational Linguistics</article-title>
          (
          <year>July 2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Devlin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>M.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toutanova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          : BERT:
          <article-title>Pre-training of Deep Bidirectional Transformers for Language Understanding</article-title>
          .
          <source>In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          . pp.
          <volume>4171</volume>
          {
          <fpage>4186</fpage>
          . Association for Computational Linguistics (
          <year>June 2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          :
          <article-title>Convolutional Neural Network Architectures for Matching Natural Language Sentences</article-title>
          .
          <source>In: Proceedings of the 27th International Conference on Neural Information Processing Systems</source>
          . vol.
          <volume>2</volume>
          , pp.
          <year>2042</year>
          {
          <year>2050</year>
          . Curran Associates, Inc. (
          <year>December 2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Izmailov</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Podoprikhin</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garipov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vetrov</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , Wilson,
          <string-name>
            <surname>A.G.</surname>
          </string-name>
          :
          <article-title>Averaging Weights Leads to Wider Optima and Better Generalization</article-title>
          . Computing Research Repository arXiv:
          <year>1803</year>
          .
          <volume>05407</volume>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kang</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kwak</surname>
          </string-name>
          , N.:
          <article-title>Semantic Sentence Matching with Densely-connected Recurrent and Co-attentive Information</article-title>
          .
          <source>In: Proceedings of the Thirty-Third AAAI Conference on Arti cial Intelligence</source>
          . pp.
          <volume>6586</volume>
          {
          <fpage>6593</fpage>
          . AAAI press (
          <year>January 2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kingma</surname>
            ,
            <given-names>D.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ba</surname>
            ,
            <given-names>J.L.</given-names>
          </string-name>
          :
          <article-title>Adam: A Method for Stochastic Optimization</article-title>
          .
          <source>In: Proceedings of the 3rd International Conference for Learning Representations (May</source>
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>T.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goyal</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Girshick</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>He</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dollar</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Focal loss for dense object detection</article-title>
          .
          <source>In: Proceedings of the IEEE international conference on computer vision</source>
          . pp.
          <volume>2980</volume>
          {
          <issue>2988</issue>
          (
          <year>December 2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ott</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goyal</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Du</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joshi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Levy</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lewis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zettlemoyer</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stoyanov</surname>
          </string-name>
          , V.:
          <article-title>RoBERTa: A Robustly Optimized BERT Pretraining Approach</article-title>
          . Computing Research Repository arXiv:
          <year>1907</year>
          .
          <volume>11692</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Distributed representations of words and phrases and their compositionality</article-title>
          .
          <source>In: Proceedings of the Advances in Neural Information Processing Systems</source>
          . pp.
          <volume>3111</volume>
          {
          <issue>3119</issue>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Mueller</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thyagarajan</surname>
            ,
            <given-names>A.:</given-names>
          </string-name>
          <article-title>Siamese Recurrent Architectures for Learning Sentence Similarity</article-title>
          .
          <source>In: Proceedings of the Thirtieth AAAI Conference on Arti cial Intelligence</source>
          . pp.
          <volume>2786</volume>
          {
          <fpage>2792</fpage>
          . AAAI Press (
          <year>Feburary 2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hamza</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Florian</surname>
          </string-name>
          , R.:
          <article-title>Bilateral Multi-Perspective Matching for Natural Language Sentences</article-title>
          .
          <source>In: Proceedings of the Twenty-Sixth International Joint Conference on Arti cial Intelligence</source>
          . pp.
          <volume>4144</volume>
          {
          <issue>4150</issue>
          (
          <year>August 2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , E,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Xiang</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          :
          <article-title>Enhanced attentive convolutional neural networks for sentence pair modeling</article-title>
          .
          <source>Expert Systems with Applications</source>
          <volume>151</volume>
          ,
          <issue>113384</issue>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dai</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          , Carbonell, J.,
          <string-name>
            <surname>Salakhutdinov</surname>
            ,
            <given-names>R.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Le</surname>
            ,
            <given-names>Q.V.</given-names>
          </string-name>
          :
          <article-title>XLNet: Generalized Autoregressive Pretraining for Language Understanding</article-title>
          .
          <source>In: Proceedings of the 32nd International Conference on Neural Information Processing Systems</source>
          . pp.
          <volume>5754</volume>
          {
          <issue>5764</issue>
          (
          <year>December 2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Yin</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          , Schutze, H.,
          <string-name>
            <surname>Xiang</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>ABCNN: Attention-Based Convolutional Neural Network for Modeling Sentence Pairs</article-title>
          .
          <source>Transactions of the Association for Computational Linguistics</source>
          <volume>4</volume>
          ,
          <issue>259</issue>
          {
          <fpage>272</fpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>