{'fraction_non_alphanumeric': 0.013636363636363636, 'fraction_numerical': 0.0015151515151515152, 'mean_word_length': 5.064220183486238, '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}}
Programming expert systems at the K-tree level

In working with the construction of expert systems over the past several years we have had two main goals: the development of useful expert system applications and the development of general methods for designing and implementing expert system applications. We have described how K-Trees were used to construct an expert system for advising mathematics and computer science majors about course selection. [1] More recent work on a new expert system has shown that the K-Tree method is a general design and programming technique that can be extended to work with applications involving reasoning with uncertainty.