{'fraction_non_alphanumeric': 0.012048192771084338, 'fraction_numerical': 0.0, 'mean_word_length': 5.3164556962025316, '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}}
Theoretical probability of dependency structural trees

Dependency structural tree is widely used in the research of dependency grammar and parsing, and it is one of the important forms of the syntactic structure of natural language. The research of the theoretical forms and their probabilities are of great importance to probability-based disambiguation of parsing. In this paper we propose the formula and its algorithm to calculate the probability of any well-formed dependency structural tree.