Pith. sign in

REVIEW 4 major objections 4 minor 40 references

Enhancing Context Modeling with a Query-Guided Capsule Network for Document-level Translation

T0 review · 4 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Query-guided capsule clustering of context words lifts document translation over attention baselines.

desk verdict A genuinely new capsule routing mechanism for document-level NMT, but the reported evidence for its advantage is far weaker than the abstract suggests. read the letter →

arxiv 1909.00564 v2 pith:BZEAEWKS submitted 2019-09-02 cs.CL

Zhengxin Yang , Jinchao Zhang , Fandong Meng , Shuhao Gu , Yang Feng , Jie Zhou This is my paper · ORCID
classification cs.CL
keywords document-levelneuralmachinetranslationcapsulenetworksdynamicroutingquery-guidedattentioncontextmodelingPearsoncorrelationTransformerEnglish-German
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper argues that document-level translation improves when historical context is not compressed into a single attention vector but clustered into several perspective capsules under the guidance of the sentence currently being translated. To do this it introduces a query-guided capsule network whose iterative routing uses the Pearson correlation between each context word and the query to raise or lower that word's vote, together with a regularization term that pulls source-side and target-side capsule representations closer in training. On English-German experiments over TED talks, news, and Europarl, the model reports the best BLEU and Meteor scores on TED and Europarl, beating both the context-agnostic Transformer and context-aware hierarchical and selective attention baselines. If the claim holds, translation systems can decide which parts of prior sentences matter for the current sentence rather than treating all context alike.

What carries the argument

The carrying object is the query-guided capsule network (QCN), an improved dynamic routing procedure over lower-level capsules $u_i$ (context words from previous sentences, each concatenated with a distance one-hot vector) and higher-level capsules $v_j$ (perspective features). The query $q$ is a linear projection of the summed embeddings of the current source sentence. In each routing iteration the coupling coefficients $c_{ij}=\mathrm{softmax}(\alpha_i)$ are augmented by $p_{ij}=\tanh(\mathrm{PCCs}(u_i,q_j))$, the higher-level capsule is formed as $s_j=\sum_i (c_{ij}+p_{ij})\hat{u}_{j|i}$ and then squashed, and the query is updated to $q_j\leftarrow(q_j+v_j)/2$. Pearson correlation, defined in Eq. (7), is the linear correlation between two vectors; positive correlation raises a context word's contribution and negative correlation lowers it. This routing mechanism is what lets the network select context relevant to the current sentence, and the regularization layer's PCC loss is what ties the source and target capsule spaces together during training.

What would settle it

Train the same QCN model on the TED English-German set with the query-guided terms $p_{ij}$ replaced by zeros or by random signs while keeping every other component fixed. If BLEU stays within noise of the reported 25.19, the Pearson-correlation routing is not the active ingredient; if it drops toward the context-agnostic Transformer's 23.28, the query guidance is load-bearing.

Watch

Extended reading notes

Core claim

On the paper's own terms, the discovery is that capsule-style clustering—each context word voting for one of several higher-level feature capsules—can replace a single compressed context representation, and the vote can be steered by the current source sentence. The improved routing computes a Pearson correlation between each context-word capsule and the query vector, adds a tanh-squashed version of that correlation to the ordinary coupling coefficient, and during each iteration updates the query toward the higher-level capsule it has just produced. These query-guided context capsules are then fed into the Transformer encoder through an additional attention sub-layer. A separate regularization layer runs ordinary capsule networks over encoder and decoder inputs and adds a Pearson-correlation loss that keeps the two sides in a shared semantic space. The reported result is that this combination surpasses hierarchical and selective attention baselines on two of the three English-German test sets, with the largest margin on TED.

Load-bearing premise

The load-bearing premise is that the linear correlation between a context word's vector and the current-sentence query is a dependable sign of whether that context word matters for the translation, and that repeatedly averaging the query with the extracted perspective capsules does not wash out the query's own meaning.

Editorial extensions

If this is right

  • Document-level translation can improve by routing context words into multiple perspective capsules rather than folding all context into one attention vector.
  • The current source sentence can serve as the query that decides which historical context features are extracted, making context selection sentence-specific.
  • Adding the Pearson-correlation regularization between source and target capsule representations yields further gains on TED and Europarl, suggesting that aligning source and target at capsule level helps coherent translation.
  • With only the previous three sentences, the model matches or beats a whole-document selective attention baseline on Europarl, so long context windows are not always necessary.
  • The claimed gains are not uniform across domains: on the News set, long-sentence filtering hurts performance and the model does not surpass the context-aware baselines.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper's experiments, the same query-guided routing could be tested on dialogue response generation and long-document summarization, where the current utterance or query sentence must select relevant history from a long context.
  • Because the relevance gate is a fixed linear correlation, replacing it with a learned similarity function is a direct extension; if a learned gate improves on TED, the linear-correlation assumption is the limiting factor.
  • The source-target capsule regularization suggests a general recipe of aligning intermediate representations across languages at the capsule level, which could be probed on low-resource or multilingual pairs.
  • The paper's scope experiments show BLEU and Meteor peak at different numbers of historical sentences, so learning the context-window size adaptively is a plausible next step beyond the fixed three-sentence setting.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper proposes a Query-guided Capsule Network (QCN) for document-level neural machine translation, together with a regularization layer based on Pearson correlation coefficients that ties source- and target-side capsule representations during training. The method is integrated into a Transformer by adding a context-aware attention sub-layer in the encoder. The authors report experiments on English-German TED, News, and Europarl corpora and claim that their model significantly outperforms strong context-agnostic and context-aware baselines on multiple datasets of different domains. The central empirical claim is that the full model, Transformer + QCN + Regularization Term, beats hierarchical attention and selective-attention baselines on TED and Europarl, while the News result is explained as being hurt by GPU-memory-driven filtering of long sentences.

Significance. If the claimed gains were statistically solid, the paper would make a useful contribution: it introduces a novel routing mechanism for document-level context modeling, releases code, and applies capsule networks to document-level NMT for the first time. The proposed mechanism is mechanistically plausible, and the ablation design is a reasonable attempt to separate the contributions of the routing module and the regularization term. However, the evidence presented in Table 2 does not support the abstract's 'significantly outperform on multiple datasets' claim: the News result is below every context-aware baseline, the Europarl BLEU gain over the best baseline is only +0.07, and no significance tests, confidence intervals, or multi-seed runs are reported. The contribution is therefore interesting but currently under-validated.

major comments (4)
  1. [Abstract and Section 4.2, Table 2] The central claim that the method 'can significantly outperform strong baselines on multiple data sets of different domains' is contradicted by the paper's own News results. In Table 2, the full model scores 22.37 BLEU on News, which is 2.66 BLEU below HAN (25.03) and 2.47 below SAN (24.84). Section 4.2 attributes this to long-sentence filtering for GPU memory, but that is a self-admitted confound that prevents the 'multiple datasets' claim from holding on one of the three domains. The abstract and Section 4.2 should be revised to report state-of-the-art on two of three datasets, or the News experiment should be repeated without the filtering confound so that the claimed cross-domain generalization can be assessed.
  2. [Section 4.2, Table 2] No statistical support is provided for the claimed gains. On Europarl, the full model improves over the best context-aware baseline (SAN) by only +0.07 BLEU (29.82 vs. 29.75), a difference that is likely within run-to-run and evaluation noise. No confidence intervals, paired significance tests, or multiple random-seed results are reported anywhere, despite the abstract's use of the word 'significantly'. The authors should provide multi-seed runs with standard deviations and paired tests (or at minimum bootstrap confidence intervals) for the BLEU and Meteor differences that underlie the headline claims.
  3. [Section 4.2, Figures 4 and 5] The hyperparameters 'number of historical sentences' and 'number of feature capsules' are selected using Figures 4 and 5, which plot TED scores, but the paper does not state whether these plots use the development set or the test set. If the TED test set was used for hyperparameter selection, the reported +0.61 BLEU gain over HAN on TED may partly reflect test-set overfitting. The authors should clarify which split is used in these figures and, if it is the test set, either re-select hyperparameters on development data or report the selection procedure transparently.
  4. [Table 2, ablation rows] The ablation does not cleanly isolate the contribution of the QCN routing mechanism. The 'Transformer + Regularization Term' row alone reaches 24.55 TED BLEU and 29.42 Europarl BLEU, while 'Transformer + QCN' alone reaches 24.41 and 29.48. The full model's improvement over the regularization-only variant is only +0.64 TED BLEU and +0.40 Europarl BLEU, while the regularization term alone already accounts for most of the gain over the Transformer baseline (24.55 vs. 23.28 on TED). The paper should either provide a finer ablation that holds the regularization term fixed while adding QCN, or temper the claim that the new routing mechanism is the primary source of the improvement.
minor comments (4)
  1. [Algorithm 1 and Eq. (7)] The notation in Eq. (7) is ambiguous: the sums run over dimensions of the vectors A and B, but the formula as written does not make this explicit, and the indexed symbols a_i and b_i are not defined in the surrounding text. Please define the dimension index clearly.
  2. [Algorithm 1, lines 29-31] The update q_j <- (q_j + v_j)/2 is stated without discussion of whether this averaging preserves the query signal across iterations. A short justification for this specific update rule would improve readability and help the reader assess the mechanism described in Section 3.2.
  3. [Throughout] There are several typographical errors, including 'recieves' (Section 3.2), 'firslty' (Section 5), and the author name 'V oita' (references). These should be corrected in a final revision.
  4. [Section 4.1] The phrase 'we use the default Adam optimizer with a fixed learning rate of 0.0001' is slightly unclear: 'default' typically refers to the hyperparameters beta1, beta2, and epsilon, but the learning rate is explicitly set. Please clarify the optimizer configuration.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the paper is an empirical architecture study whose gains are measured against external baselines, and no equation or fitted parameter is repackaged as a prediction.

full rationale

The paper makes an empirical claim that a Query-guided Capsule Network plus a PCC regularization term improves document-level NMT over strong baselines, as reported in Table 2 on TED, News, and Europarl. This is not a derivation chain: no equation in the paper computes a reported BLEU or Meteor score from a fitted parameter, and no hyperparameter is renamed as a prediction. The regularization term in Eq. (11), PCCs(Capsenc(xj), Capsdec(yj)), is a training objective added during optimization, not a post-hoc fit used to manufacture the headline result. Algorithm 1 describes routing updates whose effect is then measured against external baselines (Vaswani et al. 2017; Miculicich et al. 2018; Maruf et al. 2019), so the central comparison is self-contained with respect to independently reported systems. The self-citations that appear, such as Gu and Feng (2019) and Zhang et al. (2018b), are cited in background or motivation alongside external references and are not load-bearing for the claimed gains. The more serious concerns are empirical: the Europarl BLEU gain over SAN is only +0.07, the News result is 2.66 BLEU below HAN, no significance tests are reported, and Section 4.2 itself admits that filtering long sentences hurts News performance. Those are correctness and robustness caveats, however, not circularity. Because the central claim is validated by comparison to externally obtained baselines and no step reduces to its own input by construction, the appropriate circularity score is 0.

Assumptions & free parameters 4 free parameters · 4 assumptions · 0 invented entities

The central claims rest on standard deep-learning assumptions plus two ad hoc modeling choices: PCC as a routing signal and query-averaging. Several hyperparameters are hand-tuned on score curves, and the paper introduces no separate physical entities. The most fragile premise is that linear correlation between word capsules and a query is semantically meaningful for routing.

free parameters (4)
  • number of historical context sentences = 3
    Selected from a BLEU/Meteor trade-off on the TED dataset (Figure 4); used for all datasets without per-domain tuning.
  • number of higher-level feature capsules = 4
    Selected from Figure 5 on TED; chosen because both BLEU and Meteor are relatively good at 4.
  • routing iterations r = 4
    Fixed at 4 during hyperparameter experiments; no sensitivity analysis for this value is reported.
  • news long-sentence filter threshold
    The paper says long sentences were filtered to fit GPU memory but gives no threshold, and this filtering likely affects the News comparison.
assumptions (4)
  • ad hoc to paper Pearson correlation coefficient between a word capsule and the query vector is a valid signal for routing agreement
    Used in Algorithm 1 line 7 to compute pij and line 27 to adjust coupling; no independent evidence shows that linear correlation captures semantic relevance for translation.
  • ad hoc to paper Updating the query by averaging it with the emerging higher-level capsule preserves the intended query guidance
    Algorithm 1 line 29; the authors provide no analysis showing that the averaged vector remains a faithful representation of the current source sentence.
  • domain assumption Previously translated sentences in the document contain information needed for the current sentence
    Standard premise of document-level NMT, invoked in Eq. (2) and throughout Section 3.
  • domain assumption The Transformer architecture is a suitable base model for document-level NMT
    The approach is built on Vaswani et al. (2017); no alternative backbone such as RNNs is tested.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Enhancing Context Modeling with a Query-Guided Capsule Network for Document-level Translation." pith.science (2026). https://pith.science/paper/BZEAEWKS

@misc{pith2026190900564,
  author       = {Pith},
  title        = {Pith review of: Enhancing Context Modeling with a Query-Guided Capsule Network for Document-level Translation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/BZEAEWKS}},
  note         = {Machine review of arXiv:1909.00564}
}
read the original abstract

Context modeling is essential to generate coherent and consistent translation for Document-level Neural Machine Translations. The widely used method for document-level translation usually compresses the context information into a representation via hierarchical attention networks. However, this method neither considers the relationship between context words nor distinguishes the roles of context words. To address this problem, we propose a query-guided capsule networks to cluster context information into different perspectives from which the target translation may concern. Experiment results show that our method can significantly outperform strong baselines on multiple data sets of different domains.

Figures

Figures reproduced from arXiv: 1909.00564 by the authors.

Figure 1
Figure 1. The overall architecture consists of three modules: the [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Query-guided Capsule Network, the green blocks in the middle of the figure are lower-level cap￾sules ui , right-side blocks indicate the higher-level capsules vj and the query vector q is initially tiled to length |v| and updated with corresponding higher-level capsules. Here shows a Query-guided Capsule Net￾work with 3 high-level (feature) capsules. In each iter￾ation, the PCCs is computed according to the input ve… view at source ↗
Figure 3
Figure 3. Regularization Layer. In the training stage, [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: Effect of Contextual Information Scope. It [PITH_FULL_IMAGE:figures/full_fig_p007_4.png]
Figure 7
Figure 7. Figure 7: PCCs distribution of a sentence has 17 words [PITH_FULL_IMAGE:figures/full_fig_p008_7.png]
Figure 6
Figure 6. Figure 6: Agreement distribution of a sentence (26 [PITH_FULL_IMAGE:figures/full_fig_p008_6.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

40 extracted references · 22 canonical work pages

  1. [1]

    URL: " 'urlintro :=

    ENTRY address author booktitle chapter edition editor howpublished institution journal key month note number organization pages publisher school series title type volume year eprint doi pubmed url lastchecked label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block STRINGS urlintro eprinturl eprintpr...

  2. [2]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize " " * FUNCT...

  3. [3]

    Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. 2014. Neural machine translation by jointly learning to align and translate. arXiv preprint arXiv:1409.0473

    arXiv 2014

  4. [4]

    Mauro Cettolo, Christian Girardi, and Marcello Federico. 2012. Wit ^3 : Web inventory of transcribed and translated talks. In Proceedings of the 16 ^ th Conference of the European Association for Machine Translation (EAMT) , pages 261--268, Trento, Italy

    work page 2012

  5. [5]

    Shuhao Gu and Yang Feng. 2019. Improving multi-head attention with capsule networks. In Proceedings of the 8th CCF International Conference on Natural Language Processing and Chinese Computing

    work page 2019

  6. [6]

    Christian Hardmeier. 2012. Discourse in statistical machine translation. a survey and a case study. Discours. Revue de linguistique, psycholinguistique et informatique. A journal of linguistics, psycholinguistics and computational linguistics, (11)

    work page 2012

  7. [7]

    Christian Hardmeier and Marcello Federico. 2010. Modelling pronominal anaphora in statistical machine translation. In IWSLT (International Workshop on Spoken Language Translation); Paris, France; December 2nd and 3rd, 2010., pages 283--289

    work page 2010

  8. [8]

    Christian Hardmeier, Joakim Nivre, and J \"o rg Tiedemann. 2012. https://www.aclweb.org/anthology/D12-1108 Document-wide decoding for phrase-based statistical machine translation . In Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, pages 1179--1190, Jeju Island, Kore...

    work page 2012

Show all 40 references
  1. [9]

    Christian Hardmeier, Sara Stymne, J \"o rg Tiedemann, and Joakim Nivre. 2013. https://www.aclweb.org/anthology/P13-4033 D ocent: A document-level decoder for phrase-based statistical machine translation . In Proceedings of the 51st Annual Meeting of the Association for Computa...

    2013

  2. [10]

    Geoffrey E Hinton, Alex Krizhevsky, and Sida D Wang. 2011. Transforming auto-encoders. In International Conference on Artificial Neural Networks, pages 44--51. Springer

    2011

  3. [11]

    Geoffrey E Hinton, Sara Sabour, and Nicholas Frosst. 2018. https://openreview.net/forum?id=HJWLfGWRb Matrix capsules with EM routing . In International Conference on Learning Representations

    2018

  4. [12]

    S \'e bastien Jean, Stanislas Lauly, Orhan Firat, and Kyunghyun Cho. 2017. Does neural machine translation benefit from larger context? CoRR, abs/1704.05135

    2017 arXiv

  5. [13]

    Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980

    2014 arXiv

  6. [14]

    Philipp Koehn. 2005. Europarl: A parallel corpus for statistical machine translation. In MT summit, volume 5, pages 79--86

    2005

  7. [15]

    Philipp Koehn, Hieu Hoang, Alexandra Birch, Chris Callison-Burch, Marcello Federico, Nicola Bertoldi, Brooke Cowan, Wade Shen, Christine Moran, Richard Zens, et al. 2007. Moses: Open source toolkit for statistical machine translation. In Proceedings of the 45th annual meeting ...

    2007

  8. [16]

    Shaohui Kuang, Deyi Xiong, Weihua Luo, and Guodong Zhou. 2017. Cache-based document-level neural machine translation. arXiv preprint arXiv:1711.11221

    2017 arXiv

  9. [17]

    Alon Lavie and Abhaya Agarwal. 2007. Meteor: An automatic metric for mt evaluation with high levels of correlation with human judgments. In Proceedings of the Second Workshop on Statistical Machine Translation, pages 228--231. Association for Computational Linguistics

    2007

  10. [18]

    Sameen Maruf and Gholamreza Haffari. 2018. https://www.aclweb.org/anthology/P18-1118 Document context neural machine translation with memory networks . In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 127...

    2018

  11. [19]

    Sameen Maruf, Andr \'e FT Martins, and Gholamreza Haffari. 2019. Selective attention for context-aware neural machine translation. In Proceedings of the 2019 Conference of the North A merican Chapter of the Association for Computational Linguistics: Human Language Technologies...

    2019

  12. [20]

    Fandong Meng and Jinchao Zhang. 2019. Dtmt: A novel deep transition architecture for neural machine translation. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 33, pages 224--231

    2019

  13. [21]

    Thomas Meyer and Bonnie Webber. 2013. Implicitation of discourse connectives in (machine) translation. In Proceedings of the Workshop on Discourse in Machine Translation, pages 19--26

    2013

  14. [22]

    Lesly Miculicich, Dhananjay Ram, Nikolaos Pappas, and James Henderson. 2018. https://www.aclweb.org/anthology/D18-1325 Document-level neural machine translation with hierarchical attention networks . In Proceedings of the 2018 Conference on Empirical Methods in Natural Languag...

    2018

  15. [23]

    Kishore Papineni, Salim Roukos, Todd Ward, and Wei-Jing Zhu. 2002. Bleu: a method for automatic evaluation of machine translation. In Proceedings of the 40th annual meeting on association for computational linguistics, pages 311--318. Association for Computational Linguistics

    2002

  16. [24]

    Sara Sabour, Nicholas Frosst, and Geoffrey E Hinton. 2017. Dynamic routing between capsules. In Advances in neural information processing systems, pages 3856--3866

    2017

  17. [25]

    Rico Sennrich, Barry Haddow, and Alexandra Birch. 2016. https://doi.org/10.18653/v1/P16-1162 Neural machine translation of rare words with subword units . In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages ...

    2016 doi

  18. [26]

    Karin Sim Smith. 2017. https://doi.org/10.18653/v1/W17-4814 On integrating discourse in machine translation . In Proceedings of the Third Workshop on Discourse in Machine Translation, pages 110--121, Copenhagen, Denmark. Association for Computational Linguistics

    2017 doi

  19. [27]

    Ilya Sutskever, Oriol Vinyals, and Quoc V Le. 2014. http://papers.nips.cc/paper/5346-sequence-to-sequence-learning-with-neural-networks.pdf Sequence to sequence learning with neural networks . In Z. Ghahramani, M. Welling, C. Cortes, N. D. Lawrence, and K. Q. Weinberger, edito...

    2014

  20. [28]

    J \"o rg Tiedemann and Yves Scherrer. 2017. https://doi.org/10.18653/v1/W17-4811 Neural machine translation with extended context . In Proceedings of the Third Workshop on Discourse in Machine Translation, pages 82--92, Copenhagen, Denmark. Association for Computational Linguistics

    2017 doi

  21. [29]

    Zhaopeng Tu, Yang Liu, Shuming Shi, and Tong Zhang. 2018. https://doi.org/10.1162/tacl_a_00029 Learning to remember translation history with a continuous cache . Transactions of the Association for Computational Linguistics, 6:407--420

    2018 doi

  22. [30]

    Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, ukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. In Advances in neural information processing systems, pages 5998--6008

    2017

  23. [31]

    Elena Voita, Pavel Serdyukov, Rico Sennrich, and Ivan Titov. 2018. Context-aware neural machine translation learns anaphora resolution. In ACL

    2018

  24. [32]

    Longyue Wang, Zhaopeng Tu, Andy Way, and Qun Liu. 2017. https://doi.org/10.18653/v1/D17-1301 Exploiting cross-sentence context for neural machine translation . In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, pages 2826--2831, Copenhag...

    2017 doi

  25. [33]

    Mingxuan Wang, Jun Xie, Zhixing Tan, Jinsong Su, Deyi Xiong, and Chao Bian. 2018. http://arxiv.org/abs/1811.00287 Towards linear time neural machine translation with capsule networks . CoRR, abs/1811.00287

    2018 arXiv

  26. [34]

    Yonghui Wu, Mike Schuster, Zhifeng Chen, Quoc V Le, Mohammad Norouzi, Wolfgang Macherey, Maxim Krikun, Yuan Cao, Qin Gao, Klaus Macherey, et al. 2016. Google's neural machine translation system: Bridging the gap between human and machine translation. arXiv preprint arXiv:1609.08144

    2016 arXiv

  27. [35]

    Liqiang Xiao, Honglun Zhang, Wenqing Chen, Yongkun Wang, and Yaohui Jin. 2018. Mcapsnet: Capsule network for text with multi-task learning. In Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, pages 4565--4574

    2018

  28. [36]

    Hao Xiong, Zhongjun He, Hua Wu, and Haifeng Wang. 2019. Modeling coherence for discourse neural machine translation. CoRR, abs/1811.05683

    2019 arXiv

  29. [37]

    Min Yang, Wei Zhao, Jianbo Ye, Zeyang Lei, Zhou Zhao, and Soufei Zhang. 2018. https://doi.org/10.18653/v1/D18-1350 Investigating capsule networks with dynamic routing for text classification . In Proceedings of the 2018 Conference on Empirical Methods in Natural Language Proce...

    2018 doi

  30. [38]

    Jiacheng Zhang, Huanbo Luan, Maosong Sun, Feifei Zhai, Jingfang Xu, Min Zhang, and Yang Liu. 2018 a . https://www.aclweb.org/anthology/D18-1049 Improving the transformer translation model with document-level context . In Proceedings of the 2018 Conference on Empirical Methods ...

    2018

  31. [39]

    Wen Zhang, Yang Feng, Fandong Meng, Di You, and Qun Liu. 2019. Bridging the gap between training and inference for neural machine translation. In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pages 4334--4343. Association for Computat...

    2019

  32. [40]

    Wen Zhang, Jiawei Hu, Yang Feng, and Qun Liu. 2018 b . Refining source representations with relation networks for neural machine translation. In Proceedings of the 27th International Conference on Computational Linguistics, pages 1292--1303

    2018

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.