Write: g: s to stand for all elements of the set of segmentations of a string s.
M(s) is the maximum probability of a segmentation of string s.
Can implement this directly to get a correct but exponentially inefficient algorithm.
Recurrence: T(1) = 1, 
. HW:
solve it.
