Textual compression by collapsible tries

Summary form only given. In this paper, 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. Whereas a thorough analytical treatment of the proposed method seems hard, the basic algorithm and its main variants show good performance and latitude of practical applicability.