{'fraction_non_alphanumeric': 0.009523809523809525, 'fraction_numerical': 0.00873015873015873, 'mean_word_length': 4.705882352941177, '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}}
Compression using Matrix Folding Algorithm

Space optimization is a particular phenomenon which has puzzled the computer programmers worldwide. More and more data needs to be stored into ever decreasing space. Several techniques are utilized to either decompress the files or better manage the memory. The first aspect involves the mathematics behind the conversion and the second aspect involves physics to store more data on to smaller chips. The proposed formulation i.e. The Matrix Folding Algorithm serves the first aspect of Space optimization by making use of mathematical calculations to reduce the size of a matrix. Matrix Folding Algorithm is a technique to reduce the space occupied by a square matrix to a level of 25% of the original size. The algorithm is based on mathematical calculations applied on the original values in order to double fold the matrix first from right to left and then from bottom to top. Like many other algorithms this one also has limitations that the original matrix should have numbers ranging from 0 through 15 only when we consider a system where the integer takes 2 bytes of space. And the matrix should have numbers ranging from 0 through 255 only when we consider a system where the integer takes 4 bytes of space.