{'fraction_non_alphanumeric': 0.018115942028985508, 'fraction_numerical': 0.0, 'mean_word_length': 5.2330827067669174, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
The prevention of error propagation in dictionary compression with update and deletion

In earlier work we presented the k-error protocol, a technique for protecting a dynamic dictionary lossless compression method from error propagation as the result of errors on the communication channel or compressed file. Experiments showed that in practice this approach is both fast and highly effective against a noisy channel or faulty storage medium. This past work addressed dictionary-based methods where new strings are added over time. Here we address the issue of dynamically deleting strings. Although without modification most standard methods used in practice (e.g., LRU strategies) perform poorly with respect to error propagation, we propose and analyze some that are very robust, including a strategy based on leaf pruning.