Initial experimental results for the different models using our algorithm are given in Section 5.
as we show below, the key to efficiency is deriving local expressions for the change in coding length that will be caused by resegmentation on a particular prefix p. this coding length change, ∆CODE p , should depend only on direct properties of p, those morphs V p = {v k = ps k } for which it is a prefix, and those strings S p = {s k |ps k ∈ V p } (p's continuations).