Variants of classical data compression paradigms by Ziv, Lempel, andWelch have been proposed in recent work [1, 2], in which the phrases used for compression are strings of intermittently solid and ?don?t care? characters produced, in a deterministic fashion, by certain autocorrelations of the sourcestring generated by the very mechanics of parsing. In the present work, various lossless and lossy adaptations and extensions of that paradigm are developed and tested, for the most part susceptible to simple linear time implementation. This is in contrast to the existing lossy variants of the Ziv-Lempel family of encoders, which have been traditionally built around the iterated quest for the best match within an assigned fidelity, thereby resulting in algorithms that are inherently superlinear and not easy to implement and analyze.