{'fraction_non_alphanumeric': 0.023148148148148147, 'fraction_numerical': 0.0, 'mean_word_length': 5.098591549295775, '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}}
Real-Time Constrained Fuzzy Arithmetic

Klir introduced constrained fuzzy arithmetic (CFA) as a solution to the unnecessary precision loss when dealing with fuzzy quantities that represent linguistic variables. Since then, some attempts have been made to make CFA efficient, but none of these solutions is suitable for real-time applications. In this paper, we will propose a new CFA algorithm that can be used in such environments.