Dynamic programming (DP) in the form of the inside-outside algorithm can be used to calculate the expectations, if the features are sufficiently local (Miyao and Tsujii, 2002) ; however, the memory requirements can be prohibitive, especially for automatically extracted, wide-coverage grammars. In<cite> Clark and Curran (2004b)</cite> we use cluster computing resources to solve this problem.