{'fraction_non_alphanumeric': 0.021488871834228703, 'fraction_numerical': 0.005372217958557176, 'mean_word_length': 5.239234449760765, '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}}
Context Refinement - Investigating the Rule Refinement Completeness of SEEK/SEEK2

The pioneer systems for rule refinement are SEEK and SEEK2. Unlike TEIRESIAS, which also has been designed for the acquisition of new inference rules, the systems SEEK and SEEK2 are devoted to the refinement of rules for a rheumatology rule-base (a medical diagnosis application). This article investigates the general refinement completeness of SEEK/SEEK2. A rule refinement system is complete if it solves every possible refinement problem. SEEK2 has refinement heuristics for coping with generalization and specialization problems. Complete rule refinement systems should also have refinement capabilities for tackling a third refinement class to be called context refinement. On the syntactic level, the rheumatology rules which are the subject of the SEEK/SEEK2 refinements have no logical negation in their if-parts. On the semantic, findings which are to be interpreted by the rheumatology rule-base are represented in positive form only. This seems to be the reason for the incompleteness of SEEK2 with regard to context problems, i.e., there was no need for context refinement heuristics. A complete rule refinement system must employ methods for contextualization, as well as generalization and specialization.