{'fraction_non_alphanumeric': 0.014689265536723164, 'fraction_numerical': 0.0, 'mean_word_length': 5.110344827586207, '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}}
A modified form of software science measures

In attempting to describe the quality of computer software, one of the most frequently mentioned measurable attributes is the complexity of the flow of control. During the past several years, there have been many attempts to quantify this aspect of computer program, approaching the problem from such diverse points of view as graph theory and software science. Existing software science provides a general measure of program complexity, but it fails to adequately quantify program control flow complexity except for the linearization issue. In this paper, weights are assigned to the operators and operands which are part of the control structures. Although similar type of approach was used by Ramamurthy &amp; Melton for few control structures, there was a need for a generalized approach and this paper is an attempt in this direction.