{'fraction_non_alphanumeric': 0.011682242990654205, 'fraction_numerical': 0.0, 'mean_word_length': 5.2101449275362315, '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 Language Support for Autoassociative Memory

Data structures such as arrays or hashmaps use exact key lookups and memory addresses for retrieving entries. This diers from a more relational model of memory such as human memory, which learns from heuristics and pattern matching as it receives input from its surrounding environment. Analogously, an autoassociative memory receives an input and returns a output value that may only be similar to the input and to the other memory values according to learned patterns. Our programming language library seeks to introduce a novel interface to this autoassociative memory in order to facilitate programming eciency for the end user. Specically, the interface will provide an easier way to handle structured input data for the user, as well as managing user-dened types in the autoassociative memory.