mlsanityData to 13 Oct 2026

Modeling Voting for System Combination in Machine Translation

arXiv 2007.06943 ↗First posted 14 Jul 2020cs.CL cs.LGcited by 18

Not on the map. Why?

Abstract (arXiv)

System combination is an important technique for combining the hypotheses of different machine translation systems to improve translation performance. Although early statistical approaches to system combination have been proven effective in analyzing the consensus between hypotheses, they suffer from the error propagation problem due to the use of pipelines. While this problem has been alleviated by end-to-end training of multi-source sequence-to-sequence models recently, these neural models do not explicitly analyze the relations between hypotheses and fail to capture their agreement because the attention to a word in a hypothesis is calculated independently, ignoring the fact that the word might occur in multiple hypotheses. In this work, we propose an approach to modeling voting for system combination in machine translation. The basic idea is to enable words in hypotheses from different systems to vote on words that are representative and should get involved in the generation process. This can be done by quantifying the influence of each voter and its preference for each candidate. Our approach combines the advantages of statistical and neural methods since it can not only analyze the relations between hypotheses but also allow for end-to-end training. Experiments show that our approach is capable of better taking advantage of the consensus between hypotheses and achieves significant improvements over state-of-the-art baselines on Chinese-English and English-German machine translation tasks.

Key facts. Cited by 18 papers in the map (data through 13 Oct 2026). First posted on arXiv 14 Jul 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 3; 2022: 2; 2023: 6; 2024: 6; 2025: 1.

18 papers.

Sort:

  1. 2021RefSum: Refactoring Neural Summarizationcited by 25
  2. 2023Pre-trained Embeddings for Entity Resolution: An Experimental Analysis [Experiment, Analysis & Benchmark]cited by 13
  3. 2022Bridging the Gap between Reality and Ideality of Entity Matching: A Revisiting and Benchmark Re-Constructioncited by 10
  4. 2023Through the Fairness Lens: Experimental Analysis and Evaluation of Entity Matchingcited by 9
  5. 2023Data Cleaning and Machine Learning: A Systematic Literature Reviewcited by 9
  6. 2024Effective Instruction Parsing Plugin for Complex Logical Query Answering on Knowledge Graphscited by 8
  7. 2021Deep Transfer Learning for Multi-source Entity Linkage via Domain Adaptationcited by 7
  8. 2022FlexER: Flexible Entity Resolution for Multiple Intentscited by 6
  9. 2024Learning from Natural Language Explanations for Generalizable Entity Matchingcited by 6
  10. 2024AnyMatch -- Efficient Zero-Shot Entity Matching with a Small Language Modelcited by 5
  11. 2023A Critical Re-evaluation of Benchmark Datasets for (Deep) Learning-Based Matching Algorithmscited by 4
  12. 2023The Battleship Approach to the Low Resource Entity Matching Problemcited by 4
6 more
  1. 2024Threshold-Independent Fair Matching through Score Calibrationcited by 4
  2. 2024Evaluating Blocking Biases in Entity Matchingcited by 3
  3. 2021Interpretable and Low-Resource Entity Matching via Decoupling Feature Learning from Decision Makingcited by 2
  4. 2023Heterogeneous Entity Matching with Complex Attribute Associations using BERT and Neural Networkscited by 1
  5. 2024FairEM360: A Suite for Responsible Entity Matchingcited by 1
  6. 2025TransClean: Finding False Positives in Multi-Source Entity Matching under Real-World Conditions via Transitive Consistencycited by 1