In order to find the highest-scored segmentation with the last word being characters b, ..n − 1, the last word needs to be combined with all different segmentations of characters 0..b − 1 so that the highest scored can be selected.
because the largest-range feature templates span only over two words (see Table 1), the highest scored among the segmentations of characters 0..b − 1 with the last word being characters b ..b − 1 will also give the highest score when combined with the word b..n − 1.