Once P L (x | l) is computed for all possible values of l and x, calculating the language score can be trivially computed.
computing the translation score φ T requires the computation of the word alignments in φ T over all possible segmentations, which requires O(|x| 6 ) operations using a naive approach [O(|x| 4 ) segmentation candidates, and O(|x| 2 ) operations for aligning each pair of segments].