{'fraction_non_alphanumeric': 0.014824797843665768, 'fraction_numerical': 0.0, 'mean_word_length': 5.319148936170213, '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}}
Selection and consolidation of memorized information for distributed associative memories

Numerous studies have been made on the method of constructing the distributed-type associative memory. This paper discusses the method which selectively memorizes or memorizes by consolidation the information stored in multiple associative memories in a new associative memory. 
 
 
 
In the distributed associative memory, the information (vector) to be stored is memorized in a distributed way in the form of a matrix (called memorization matrix). Then, in general, it is difficult to know precisely the original memorized information from the already constructed associative memory. 
 
 
 
This paper proposes a method which can realize the selection and consolidation of the memorized information by constructing directly the memorization matrix of the new associative memory, using the memorization matrices of the already constructed multiple associative memories. The proposed method has the feature that it is not necessary to derive the information memories in each associative memory or to reconstruct the associative memory from the start using the memorized information (relearning). It is a requirement which arises frequently in the construction, update and use of the associative memory to memorize selectively or in a consolidated form the information memorized in multiple associative memories, in an associative memory. For such a purpose, the proposed method will be useful.