{'fraction_non_alphanumeric': 0.025936599423631124, 'fraction_numerical': 0.0, 'mean_word_length': 4.991379310344827, '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}}
Abduction and Memoing

Abduction is a inference procedure with wide applicability to knowledge-based processing. Abduction is known to be NP-hard; i.e. over models of since N, runtimes are expected to be O(k N). Memoing is a technique for storing the results of prior computations, thus decreasing the inferencing time required if some particular inference is required more than once. Memoing is known to decrease the runtimes of certain computations. Here, we experiment with memoing to reduce the computational cost of abduction. These experiments were unsuccessful. We conclude that memoing is not suitable for optimising abduction due to the context-dependent nature of abductive inference.