In each case we show that the quantity can be expressed as the value that maximises a product of functions or else as the sum of a product of functions, each of which depends on a small subset of the variables X.
the dynamic programming algorithms presented here require the information encoded in properties to be local with respect to the features F used in the packed parse representation.