The search process can be rewritten as: Given the fact that the number of segmentations f K 1 grows exponentially with respect to the number of characters K, it is impractical to firstly enumerate all possible f K 1 and then to decode.
it is possible to enumerate all the alternative segmentations for a substring of c J 1 , making the utilisation of word lattices tractable in PB-SMT.