LZ parsing also has important theoretical properties. The number of phrases, \(z\) , into which LZ parses
a text has become the defacto measure of compressibility for dictionary-based methods [1]}, which in particular are most effective on highly repetitive sequences [2]}. While there are
measures that are stronger than LZ [3]}, [4]}, these are NP-complete to
compute. The LZ parse, which can be computed greedily in linear time [5]}, is
then the stronger measure of dictionary-based compressibility on which to
build practical compressors.
