id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_y2ft2jwmyrby7fpj24hznq275e	Yin-Wen Chang	A Polynomial-Time Dynamic Programming Algorithm for Phrase-Based Decoding with a Fixed Distortion Limit	2017	14	.pdf	application/pdf	8626	1357	86	A Polynomial-Time Dynamic Programming Algorithm for Phrase-Based Decoding of phrase-based translation models in the general case is known to be NPcomplete, by a reduction from the traveling for phrase-based decoding with a fixed distortion limit. novel representation that gives a new perspective on decoding of phrase-based models. the general case decoding of phrase-based translation models is NP-complete. 1An earlier version of this paper states the complexity of decoding with a distortion limit as O(I32d) where d is the distortion limit and I is the number of words in the sentence; however (2010) make use of bit string coverage vectors, giving an exponential number of possible states; in contrast to our approach, the translations are not formed This section first defines the bandwidth-limited traveling salesman problem, then describes a polynomial time dynamic programming algorithm for the We now describe the dynamic programming algorithm for phrase-based decoding with a fixed distortion limit.	./cache/work_y2ft2jwmyrby7fpj24hznq275e.pdf	./txt/work_y2ft2jwmyrby7fpj24hznq275e.txt