We use an algorithm resembling probabilistic bottom-up parsing to build a WIDL-expression for an input Chinese string: each contiguous span u 7   .
reordering of the component tiles are permitted by the S c operators (assigned non-zero probability), but the longer the movement from the original order of the tiles, the lower the probability.