Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation

机器翻译 计算机科学 人工智能 判决 短语 桥接(联网) 基于迁移的机器翻译 自然语言处理 人工神经网络 翻译(生物学) 推论 词(群论) 灵活性(工程) 基于实例的机器翻译 机器学习 哲学 统计 信使核糖核酸 化学 基因 生物化学 语言学 数学 计算机网络
作者
Yonghui Wu,Mike Schuster,Zhifeng Chen,Quoc V. Le,Mohammad Norouzi,Wolfgang Macherey,Maxim Krikun,Yuan Cao,Qin Gao,Klaus Macherey,Jeff Klingner,A. F. M. Shahen Shah,Melvin Johnson,Xiaobing Liu,Łukasz Kaiser,Stephan Gouws,Yasuhiro Kato,Takeo Kudo,Hideto Kazawa,Keith Stevens,George Thomas Kurian,Nishant Patil,Wei Wang,Cliff Young,Jason Smith,Jason Riesa,Alex Rudnick,Oriol Vinyals,Greg S. Corrado,Macduff Hughes,J. Michael Dean
出处
期刊:Cornell University - arXiv 被引量:2337
摘要

Neural Machine Translation (NMT) is an end-to-end learning approach for automated translation, with the potential to overcome many of the weaknesses of conventional phrase-based translation systems. Unfortunately, NMT systems are known to be computationally expensive both in training and in translation inference. Also, most NMT systems have difficulty with rare words. These issues have hindered NMT's use in practical deployments and services, where both accuracy and speed are essential. In this work, we present GNMT, Google's Neural Machine Translation system, which attempts to address many of these issues. Our model consists of a deep LSTM network with 8 encoder and 8 decoder layers using attention and residual connections. To improve parallelism and therefore decrease training time, our attention mechanism connects the bottom layer of the decoder to the top layer of the encoder. To accelerate the final translation speed, we employ low-precision arithmetic during inference computations. To improve handling of rare words, we divide words into a limited set of common sub-word units (wordpieces) for both input and output. This method provides a good balance between the flexibility of character-delimited models and the efficiency of word-delimited models, naturally handles translation of rare words, and ultimately improves the overall accuracy of the system. Our beam search technique employs a length-normalization procedure and uses a coverage penalty, which encourages generation of an output sentence that is most likely to cover all the words in the source sentence. On the WMT'14 English-to-French and English-to-German benchmarks, GNMT achieves competitive results to state-of-the-art. Using a human side-by-side evaluation on a set of isolated simple sentences, it reduces translation errors by an average of 60% compared to Google's phrase-based production system.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
小敏完成签到 ,获得积分10
1秒前
3秒前
6秒前
6秒前
7秒前
皋皋完成签到,获得积分10
7秒前
林佳缪完成签到,获得积分10
8秒前
10秒前
Ni发布了新的文献求助10
11秒前
万能图书馆应助bolunxier采纳,获得10
12秒前
12秒前
xpx完成签到 ,获得积分10
13秒前
啊哈发布了新的文献求助10
13秒前
13秒前
maox1aoxin应助苗条的立果采纳,获得80
15秒前
15秒前
重要奇迹发布了新的文献求助10
18秒前
贺天发布了新的文献求助10
18秒前
18秒前
勤劳念薇完成签到,获得积分10
20秒前
重要奇迹完成签到,获得积分20
23秒前
24秒前
whg完成签到,获得积分10
25秒前
dm完成签到,获得积分10
25秒前
28秒前
nightmare发布了新的文献求助10
29秒前
31秒前
欧阳香彤发布了新的文献求助10
33秒前
勤劳念薇发布了新的文献求助10
34秒前
nightmare完成签到,获得积分10
35秒前
超帅连虎完成签到,获得积分10
37秒前
小果冻梨发布了新的文献求助10
38秒前
英俊的铭应助最爱吃火锅采纳,获得10
38秒前
李健的粉丝团团长应助FaFa采纳,获得10
39秒前
秋雪瑶应助依米zhang采纳,获得10
40秒前
41秒前
zzzzx完成签到,获得积分10
42秒前
华仔应助小果冻梨采纳,获得10
44秒前
44秒前
欧阳香彤完成签到,获得积分10
44秒前
高分求助中
Manual of Clinical Microbiology, 4 Volume Set (ASM Books) 13th Edition 1000
Sport in der Antike 800
De arte gymnastica. The art of gymnastics 600
Berns Ziesemer - Maos deutscher Topagent: Wie China die Bundesrepublik eroberte 500
Stephen R. Mackinnon - Chen Hansheng: China’s Last Romantic Revolutionary (2023) 500
Sport in der Antike Hardcover – March 1, 2015 500
Boris Pesce - Gli impiegati della Fiat dal 1955 al 1999 un percorso nella memoria 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2422947
求助须知:如何正确求助?哪些是违规求助? 2111885
关于积分的说明 5347191
捐赠科研通 1839322
什么是DOI,文献DOI怎么找? 915615
版权声明 561229
科研通“疑难数据库(出版商)”最低求助积分说明 489747