{'fraction_non_alphanumeric': 0.018837018837018837, 'fraction_numerical': 0.0, 'mean_word_length': 5.266666666666667, '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}}
Pattern recognition in the database of a mask layout

The request of pattern recognition has been frequently brought up by both mask and wafer engineers. Despite different intentions, pattern recognition is usually the first step of many applications and hence plays a major role to accomplish certain tasks. For the purpose of this work, pattern recognition is defined as searching a specific polygon or a group of particular patterns from a chip layout. Operator scan is truly not an efficient approach of pattern recognition, in particular, for cases with huge design database of advanced semiconductor integrated circuits. Obviously, an automation system of pattern recognition is necessary and benefits the data preparation process. Two categories of pattern recognition are discussed in the present study, 'fuzzy search' and 'exact match.' Each category has its own application, but the searching algorithms could be much different. Details of searching algorithms are given for both categories of pattern recognition. Due to the nature of industrial standard, the scope of the present application is limited to database with GDSII format. Hence, coordinate searching is internally used inside the searching engine.