Assuming a one-to-one correspondence between source and target phrases, reordering in PSMT means searching through a set of permutations of the source phrases.
two subproblems arise: defining the set of permutations in b allowed during decoding (reordering constraints) and scoring the allowed permutations (reordering models or feature functions).