Up to A k , we get a list of candidates T : T 1 , T 2 , ..., T L , ranked by probabilities P k (T |S) in descending order.
3 Joint optimization and its fast decoding algorithm We denote a word in the source language by S, a segmentation of S by A, and a word in the target langauge by T .