{'fraction_non_alphanumeric': 0.018922852983988356, 'fraction_numerical': 0.0, 'mean_word_length': 5.811881188118812, '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}}
On structural information similarity measurements

Measuring structural similarities is attracting more and more attention from researchers. In this paper, we define structural information content (SIC) for measuring the structural information of a structure, and introduce topological match degree to measure to what extent a subtree is matched. By recursively computing SICs and thus computing topological match degrees, we evaluate the structural information similarities of data trees to pattern tree. In the paper, we present two algorithms for recursively calculating SICs with computation complexity of O(M), and use examples to instantiate the feasibility of the proposed method.