{'fraction_non_alphanumeric': 0.03860294117647059, 'fraction_numerical': 0.007352941176470588, 'mean_word_length': 4.797872340425532, '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}}
A method to make some fuzzy relations T‐transitive

A new method is given for a finite reflexive relation with a fixed set of properties and a t‐norm T, so that a different, but similar, T‐transitive relation could be found. The transitive closure is greater than the given relation; however, the T‐transitivized relation defined in this article is less than or equal to the original one, while reaching or maintaining, in this case, the T‐conditionality. The algorithm also verifies if a relation is T‐transitive. ©1999 John Wiley & Sons, Inc.