<!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 Framework for Neural Machine Translation by Fuzzy Analogies</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Liyan Wang</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bartholomäus Wloka</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yves Lepage</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Vienna</institution>
          ,
          <addr-line>Vienna, 1190</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Waseda University</institution>
          ,
          <addr-line>Kitakyushu, 808-0135</addr-line>
          ,
          <country country="JP">Japan</country>
        </aff>
      </contrib-group>
      <fpage>47</fpage>
      <lpage>55</lpage>
      <abstract>
        <p>This paper introduces a novel translation technique, driven by modeling fuzzy analogies that capture approximate conformity to parallel transformations between fragments in sentences. We conduct preliminary experiments on English-Japanese translations with a data set of limited size. The results show the potential of using fuzzy analogies for translation, achieving an increase of about 6 BLEU points compared to NMT.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Machine translation</kwd>
        <kwd>Fuzzy analogy</kwd>
        <kwd>Limited data</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Methodology</title>
      <p>
        The proposed method is built on the indirect paradigm of example-based MT in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Similar
to this, given translation queries  , we first construct sentence analogies as  :  ::  :  ,
say
bill
1
1
1
1
0
0
1


wanted
to
say
something
i
,
analogy. We divide by the length of  to get the analogical score. If A : B :: C : D is a strict analogy,
the score is 1.
where  ,  , and  are source examples retrieved from translation memory, that will
maximize analogical score with  . By looking up the annotated translations of (, , 
), we can
obtain corresponding analogical equations in the target language. Following this, we exploit
a previously learnt model to generate solutions of target analogies as translation results, i.e.,
 ′ :  ′ ::  ′ : 
⇒
      </p>
      <p>=  ′.</p>
      <p>To retrieve sentence analogies, we first pre-compute candidate pools for terms  ,  , and 
by collecting the  nearest neighbors of</p>
      <p>using cosine similarity between sentence embeddings.</p>
      <p>Theoretically, there will be a cubic number of possible combinations of sentence quadruples
(, , ,</p>
      <p>
        ). To reduce the computational cost, we prune candidate quadruples. We leave
out the quadruples with no lexical overlap between  and  , and between 
and  . Finally,
for each  , we rank the quadruples by analogical score, and select the first  ones. As in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ],
we use alignments between (, , ,
      </p>
      <p>) considered as sequences of (sub-)words. We count
the number of trivial analogies of the form a : a :: b : b or a : b :: a : b for every aligned
(sub-)word quadruple. Figure 1 illustrates the computation of analogical scores.</p>
      <p>Next, we train a sequence-to-sequence model to solve analogies, so as to derive translation
answers. Suppose  :  ::  :</p>
      <p>and  ′ :  ′ ::  ′ :  ′ are a retrieved source analogy and
its corresponding translation. We concatenate 7 sentences (excluding  ′) in two monolingual
analogies as input  , to train the model to generate the solution  ′ by optimizing cross-entropy
(CE) between probability distributions conditional on the context of input and preceding target
tokens:
ℒ CE = −
log  ( ′| &lt;′ ,  )
(1)
To encourage the model to be more confident in reconstructing target fragments that are in
analogical relationships, while being flexible to non-analogical relationships, we introduce a
weighting scalar in (1). Formally, the aim is to minimize weighted CE (WCE):
︁∑
where   takes the value of 1 for trivial analogies, and 0.5 else. For each target token, a weighted
value is determined by its corresponding aligned token in  .</p>
    </sec>
    <sec id="sec-3">
      <title>3. Preliminary Experiments</title>
      <sec id="sec-3-1">
        <title>3.1. Datasets</title>
        <p>We experiment with parallel sentences from the Japanese-English Subtitle Corpus1, with 50,000
pairs for training, 2,000 for validation, and 2,000 for test. In this work, we primarily investigate
the translation quality from English to Japanese. The source sentences contain approximately
nine words on average. For each data set, we take source sentences as queries and look for
fuzzy analogies from the source part of translation memory (i.e., the training set). The strictness
in analogies depends on how closely the queries match the examples in memory. We assess the
closeness between the data sets and the memory by computing the similarity using the length
of longest common subsequence between sentences at the word level. Specifically, we compare
the query sentence to the twenty most similar examples in the memory, excluding itself in the
case of the training set. Table 1 shows the statistics of three data sets. On average, the three
data sets exhibit similar characteristics, where source sentences are found to have an overlap of
four words with their corresponding similar sentences in the memory.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Implementation Details</title>
        <p>
          In order to retrieve analogies from the corpus, we first use a Sentence-BERT [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] model2 to
represent sentences as vectors. Subsequently, for each query  , we collect twenty examples
as the candidates of  and  , which are the nearest neighbors to  in the embedding space.
Sentences  are selected from the twenty closest neighbors to each candidate for  . We
pretokenize sentences into sub-words using a SentencePiece [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] model with the vocabulary size
of 250,0003. We then enumerate (, , ,  ) from collected candidates and filter possible
quadruples by the overlap constraint between  and  , and between  and  at the sub-word
level. Next, We use mGIZA [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] and Moses4 to estimate sub-sentential alignments. Base on
that, we compute analogical score for each possible quadruple. For each  , we select one fuzzy
analogy for translation.
        </p>
        <p>
          To learn from analogy, we fine-tune a pre-trained mBART [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] model5 on fuzzy analogies
that are retrieved from the training set. We utilize the large-scale mBART model consisting of
a 12-layer encoder and a 12-layer decoder. The target sentences are generated using a beam
size of 5 during decoding. To fine-tune the model, we freeze the encoder part and update the
parameters of the last 6 layers of the decoder. The frozen model is trained using a batch size of
8 for a maximum of 20 epochs. In the case there are no improvements for three consecutive
epochs, we halt the training process before completing all the epochs (early stopping). Finally,
we save the model that demonstrates the best performance on the validation set.
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Results and Analysis</title>
        <p>We compare to an NMT system by fine-tuning the same pre-trained mBART model on the data
sets of parallel sentences. The baseline NMT model is trained using the consistent settings as
described above. On 50,000 parallel sentences, NMT obtains a BLEU score of only 2.9. Our
system using (1) achieved an improvement of 5.6 and the use of (2) leads to a further gain of
about 0.4 BLEU points. Even though fuzzy analogies relax the strictness, the inclusion of partial
evidence in parallel transformations still helps in deducing possible translation.</p>
        <p>In the retrieved analogies, query sentences are covered by examples under the analogy
constraint to diferent extents with analogical scores ranging from 0 to 1. Figure 2 shows the
number of fuzzy analogies constructed for the sentences in the three data sets, categorized
by their respective scores. In general, three sets of analogy data demonstrate a comparable
distribution in the extent of fuzzy matches between sentence transformations. The majority of
analogies fall within the score range of 0.3 to 0.7. This indicates that approximately 30%-70% of
tokens in query sentences are associated with examples in the analogy relationship.</p>
        <p>Next, we examinate the model performance in inferring translation answers by solving
fuzzy analogies with diferent scores. Figure 3 shows that our model is capable of reasoning
analogies with lower scores, where less than half of a query sentence is linked to translation
examples through analogical associations. This suggests that fuzzy analogies can capture relative
knowledge of two languages, which can even assist in translating queries that are distant from
memory. We also compare to an NMT baseline on translating each test sentence. In Figure 3,
blue points (415 out of 2,000) indicate the cases where our model performs worse than NMT in
BLEU. Relatively, there are fewer underperforming cases when analogies have higher scores
(&gt;0.7). In Table 2, we list examples of two methods in translating sentences that are either close
3To enable the learning model (e.g., mBART) to identify analogical transformations in quadruples, we use the
SentencePiece model with the same tokenization as in mBART.
4http://www2.statmt.org/moses/
5https://huggingface.co/facebook/mbart-large-50</p>
        <p>×1,000
s
e
igo 10
l
a
n
a
g
n
i
n
i
ra 5
t
f
o
r
e
b
m
u
N 0</p>
        <p>×100
train
valid
test
2
to or distant from translation memory.</p>
        <p>Do diferent source analogies constructed for the same query result in diverse translation
outputs? We conduct additional experiments to address this question. For each test sentence,
we retrieve five fuzzy analogies with the maximum scores and then employ the model trained
specifically to handle one analogy per query to solve each of these analogies. Table 3 presents
ifve distinct translations to a query sentence. As shown by the example, it is possible for the
model to generate more idiomatic translations that closely convey the intended meaning, using
Examples of translating sentences that are either close to or distant from the memory. For each generated
Japanese answer, we also provide the corresponding English translation below, which has been translated
using Google Translate. The underlines denote formal matchs to the references. For the upper instance,
NMT achieves a higher BLEU score but it fails to specifically mention the content regarding worry,
whereas our model efectivly captures the meaning of the original sentence. Regarding the translation of
the distant query that involves specialized terms not present in the memory, NMT seems to draw upon
knowledge from its pre-trained data. However, the translation is not accurate. Our model provides a
translation for the word "called" by leveraging hints from the analogy, but does not convery an accurate
translation for the term itself.</p>
        <sec id="sec-3-3-1">
          <title>Test query close to the memory</title>
        </sec>
        <sec id="sec-3-3-2">
          <title>Query Ref. NMT</title>
          <p>ah... i’m sorry i made you worry.
あ... 心配かけてすみません。
あ... ごめんなさいごめんなさい。
(ah... i’m sorry, i’m sorry.)
Ours
analogical score: 0.82
⇒  = あ... ごめんね心配かけちゃって。
(ah... i’m sorry i made you worry.)
i’m sorry for bother- i... i’m sorry. i wasn’t
ing you. thank you.
す い ま せ ん で し
た。失礼します!
:
:
being careful enough.
す・・すみません
でした私が十分な
注意を払っていま
せんでした
::
i’m fine. i’m sorry for
making you worry.</p>
          <p>:
ah... i’m sorry i made
you worry.</p>
          <p>大丈夫です。すい
:: ませんご心配おか :
けして</p>
        </sec>
        <sec id="sec-3-3-3">
          <title>Test query distant from the memory</title>
        </sec>
        <sec id="sec-3-3-4">
          <title>Query</title>
          <p>called alpha lipoxanthine glucoside</p>
          <p>Ref. [スピーカ] 「アルファー・リボキサンチン・グルコシド」n略して
NMT
アルファリン酸オキシトリン酸グリシトリン酸
(alpha phosphate oxyphosphate glycitrate)
Ours
analogical score: 0.0
that’s the name.
そう名付けること
にしたよ。
: biotech company.</p>
          <p>it is called alexon
そ れ は ア レ ク ソ
:
ン・バイオテック
という会社なんで
すけど
⇒  = アルパルス・グローブという名で
(under the name alpuls grove)</p>
          <p>lincoln.
:: the name is abraham : called alpha
lipoxan</p>
          <p>thine glucoside
::
名 は エ イ ブ ラ ハ
ム・リンカーン
:
analogies with less evidence. We speculate that enlarging the number of fuzzy analogies will
facilitate models in acquiring more potential associations in two languages.</p>
        </sec>
        <sec id="sec-3-3-5">
          <title>BLEU</title>
          <p>
            4. Conclusion and Future Work
In this paper, we introduced a novel translation approach based on the mechanism of using
indirect analogies for translation. Unlike the work in [
            <xref ref-type="bibr" rid="ref5">5</xref>
            ], we proposed to handle partial analogies
that capture approximate conformity between sentence transformations. We call that fuzzy
analogies. To solve fuzzy analogies between sentences, we trained an mBART model to generate
translations given source quadruples and three known translations in the target analogies.
We conducted a comparison between our approach and an NMT baseline under low resource
constraints. Additionally, we investigated the impact of analogical quality on translation.
          </p>
          <p>In future work, we will conduct ablation studies to search for optimal configurations for
modeling analogies. In addition, we will expand this work to diferent language pairs and
directions, as well as investigate the influence of corpus size on performance.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Acknowledgments</title>
      <p>The research reported in this paper was supported in part by a grant for Kakenhi (kiban C) from
the Japanese Society for the Promotion of Science (JSPS), n° 21K12038 “Theoretically founded
algorithms for the automatic production of analogy tests in NLP”.
はい。それがいい : 確いかかもにな、それが良 :: るっていいことだ :
かと思います。
好きなことを頑張
と思いますけど
⇒  = じゃあはっきり言うなら... 。
( well, to put it bluntly...)
( to put it bluntly... sorry for being mean.)
よ? これ。痛っ。
やまだ。ヘ俺ヘのッ方。がい何いだ : あぁ、最良だった :: い確かかもにな、それが良 :</p>
      <p>と思うよ
⇒  = はっきり言うなら... 意地悪いのは悪いけど。
i think it’s better if
0.40 imgyuseisdse.it’s better on : aybeply, ifogrutehses bite’sstp.rob-:: i think that’s best. : you frankly say your
0.40 i think that’s best. : aybeply, ifogrutehses bite’sstp.rob-:: what you like.</p>
      <p>i think it’s great to do : iyotuhifnrkaniktl’ys sbaeyttyerouirf
確かに、それが良 : あと思ぁう、よ最良だった :: 好るっきてないこといこを頑と張だ :
いかもな
⇒  = はっきり言うなら... 意図は正直に言うべきよ
( to put it bluntly... you should be honest about your intentions)</p>
      <p>と思いますけど
( to put it bluntly, your meanness is bad.)
よ? これ。痛っ。
やまだ。ヘ俺ヘのッ方。がい何いだ : 確かに、それが良 :: とあ思ぁう、よ最良だった :</p>
      <p>いかもな
⇒  = はっきり言うなら君の意地悪は悪いけどな。
0.40 imgyuseisdse.it’s better on : i think that’s best. :: aybeply, ifogrutehses bite’sstp.rob-: iyotuhifnrkaniktl’ys sbaeyttyerouirf
0.40 aybeply, ifogrutehses bite’sstp.rob-: i think that’s best. :: imgyuseisdse.it’s better on : iyotuhifnrkaniktl’ys sbaeyttyerouirf
intentions.</p>
      <sec id="sec-4-1">
        <title>BLEU</title>
        <p>by solving the first five fuzzy analogies with diferent analogical scores. The reference translation is
"あの... ズバッと訴えたい事を伝えたほうがいいと思うんです。". We highlight the answer that
closely matches the reference according to the human evaluation.</p>
        <p>score Analogy and solution
0.47 iidtehai.nk that’s a good : i think that’s best. :: iwthhaintkyoitu’sligkree.at to do : iyotuhifnrkaniktl’ys sbaeyttyerouirf
( honestly... if you say mean)
⇒  = 正直なところ... 意地悪いって言ったら
あぁ、最良だった : い確かかもにな、それが良 :: や。ヘヘッ。何だ :
と思うよ</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R.</given-names>
            <surname>Aharoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Johnson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Firat</surname>
          </string-name>
          ,
          <article-title>Massively multilingual neural machine translation</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers),
          <source>Association for Computational Linguistics</source>
          , Minneapolis, Minnesota,
          <year>2019</year>
          , pp.
          <fpage>3874</fpage>
          -
          <lpage>3884</lpage>
          . URL: https://aclanthology.org/N19-1388. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>N19</fpage>
          -1388.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. O. K.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Cho</surname>
          </string-name>
          ,
          <article-title>Meta-learning for low-resource neural machine translation</article-title>
          ,
          <source>in: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing</source>
          , Association for Computational Linguistics, Brussels, Belgium,
          <year>2018</year>
          , pp.
          <fpage>3622</fpage>
          -
          <lpage>3631</lpage>
          . URL: https://aclanthology.org/D18-1398. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>D18</fpage>
          -1398.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Edunov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ghazvininejad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <article-title>Multilingual denoising pre-training for neural machine translation</article-title>
          ,
          <source>Transactions of the Association for Computational Linguistics</source>
          <volume>8</volume>
          (
          <year>2020</year>
          )
          <fpage>726</fpage>
          -
          <lpage>742</lpage>
          . URL: https://aclanthology. org/
          <year>2020</year>
          .tacl-
          <volume>1</volume>
          .47. doi:
          <volume>10</volume>
          .1162/tacl_a_
          <fpage>00343</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Nagao</surname>
          </string-name>
          ,
          <article-title>A framework of a mechanical translation between Japanese and English by analogy principle</article-title>
          ,
          <source>Artificial and human intelligence</source>
          (
          <year>1984</year>
          )
          <fpage>351</fpage>
          -
          <lpage>354</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lepage</surname>
          </string-name>
          , E. Denoual,
          <article-title>Purest ever example-based machine translation: Detailed presentation and assessment</article-title>
          ,
          <source>Machine Translation</source>
          <volume>19</volume>
          (
          <year>2005</year>
          )
          <fpage>251</fpage>
          -
          <lpage>282</lpage>
          . doi:
          <volume>10</volume>
          .1007/ s10590-006-9010-x.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>P.-A.</given-names>
            <surname>Murena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Al-Ghossein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-L.</given-names>
            <surname>Dessalles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cornuéjols</surname>
          </string-name>
          ,
          <article-title>Solving analogies on words based on minimal complexity transformation</article-title>
          , in: C.
          <string-name>
            <surname>Bessiere</surname>
          </string-name>
          (Ed.),
          <source>Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI-20, International Joint Conferences on Artificial Intelligence Organization</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>1848</fpage>
          -
          <lpage>1854</lpage>
          . URL: https://doi.org/10.24963/ijcai.
          <year>2020</year>
          /256. doi:
          <volume>10</volume>
          .24963/ijcai.
          <year>2020</year>
          /256, main track.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>L.</given-names>
            <surname>Miclet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bayoudh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Delhay</surname>
          </string-name>
          , Analogical dissimilarity,
          <source>J. Artif. Int. Res</source>
          .
          <volume>32</volume>
          (
          <year>2008</year>
          )
          <fpage>793</fpage>
          -
          <lpage>824</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          , Sentence-BERT:
          <article-title>Sentence embeddings using Siamese BERTnetworks</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>3982</fpage>
          -
          <lpage>3992</lpage>
          . URL: https://aclanthology.org/D19-1410. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>D19</fpage>
          -1410.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>T.</given-names>
            <surname>Kudo</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Richardson,</surname>
          </string-name>
          <article-title>SentencePiece: A simple and language independent subword tokenizer and detokenizer for neural text processing</article-title>
          ,
          <source>in: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing: System Demonstrations, Association for Computational Linguistics</source>
          , Brussels, Belgium,
          <year>2018</year>
          , pp.
          <fpage>66</fpage>
          -
          <lpage>71</lpage>
          . URL: https://aclanthology.org/D18-2012. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>D18</fpage>
          -2012.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          <article-title>Vogel, Parallel implementations of word alignment tool</article-title>
          , in: Software Engineering, Testing, and
          <article-title>Quality Assurance for Natural Language Processing, Association for Computational Linguistics</article-title>
          , Columbus, Ohio,
          <year>2008</year>
          , pp.
          <fpage>49</fpage>
          -
          <lpage>57</lpage>
          . URL: https: //aclanthology.org/W08-0509.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>