{'fraction_non_alphanumeric': 0.009821428571428571, 'fraction_numerical': 0.0, 'mean_word_length': 5.026881720430108, '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}}
An efficient recall in diversified training samples using Bidirectional Associative Memory

This work attempts to understand the intricacies of the working model of Neural Networks in pattern recognition. The system recognizes the input pattern against the stored ones. It also accepts some decent amount of noise in the input pattern and aims at efficiently recognizing the pattern correctly. The objective of this system is to find how effectively it recognizes characters that are stored as patterns in the system and map the input to the stored pattern, when the input patterns are diversified. And in order to achieve this, the idea of Bidirectional Associative Memory is used. Bidirectional Associative Memory is a two level non linear neural network. One important performance attribute of discrete BAM is the ability to recall the stored pairs particularly in the presence of noise. This is one of the main objective of the system, to recognize patterns in the presence of some permissible noise and study how the system has problems with recalling correct patterns when the training samples are not diversified.