{'fraction_non_alphanumeric': 0.019689119170984457, 'fraction_numerical': 0.0010362694300518134, 'mean_word_length': 4.8545454545454545, '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}}
Enhancement of LZAP (Lempel Ziv All Prefixes) Compression Algorithm

In this paper we proposed a dictionary based lossless data compression algorithm which is an enhanced version of LZAP. The compression process of the proposed method starts with an empty dictionary. The encoder will always try to find longest match. If there is no match, then the next character will be encoded with 9 bits. If a match is found, then it will be encoded with corresponding dictionary index. Here, the code length of the dictionary index will be determined by the code length of maximum dictionary index. The dictionary entries will be added in whole compression process. Whenever the dictionary gets full, it will remove all entries of the dictionary. Experimental results were performed and these results show that our proposed method performs better than other conventional compression algorithm like WinZip, Gzip, LZW, LZAP etc. when the file size is greater than one Megabyte.