{'fraction_non_alphanumeric': 0.018306636155606407, 'fraction_numerical': 0.0, 'mean_word_length': 5.4411764705882355, '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}}
Fuzzy regular tree expressions

The concept of fuzzy tree substitution, fuzzy tree concatenation and fuzzy tree closure are defined, it is shown that we can obtain fuzzy regular tree languages by substitution, concatenation, closure operation on the fuzzy regular tree languages. Finally, we introduce the notion of fuzzy regular tree expressions, and the equivalences of fuzzy regular tree expressions and fuzzy tree automata is proved.