{'fraction_non_alphanumeric': 0.02034428794992175, 'fraction_numerical': 0.003129890453834116, 'mean_word_length': 5.597938144329897, '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}}
Cache balancing with proportionate cutting strategy

Caching mechanism had been widely used in many applications particularly in CPU optimization, internet application, data structure etc. Our research in text processing reveals that caching mechanism is also applicable to solve performance problem of text analyzers. In this paper we describe the strategy called ‘proportionate cutting’ for balancing (maintaining) limited size cache. Our experiment shows that by proportionate cutting at 0.5 threshold's value gives good performance to the cache. This actually allows of using limited cache in text processing with high frequency words.