Since this value is additive and gives the total code length of X for language Y , we adopt this value in our approach.
considering the additive characteristic of the description length formulated previously as formula (1), we denote the minimized description length for a given text X simply as DP (X), which can be decomposed recursively as follows 6 : the computation of DP (X) is decomposed into obtaining the addition of two terms by searching through t ∈ {0, .