{'fraction_non_alphanumeric': 0.013991769547325103, 'fraction_numerical': 0.0, 'mean_word_length': 5.268041237113402, '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 comparison of schema matching threshold function and ANFIS generated membership function

Schema matching has the task of identifying semantically related entities in schemas. In the classic approach, a semantic distance is established among schema entities of the input schemas, based on which values the entity pairs are classified as match or non-match by means of a threshold value. This approach is, however, cumbersome in some schema matching related problem, like the accuracy measure maximization and the cutting threshold problem. In our earlier works, we proposed the concept of the schema matching threshold function for such cases. We assumed that the schema matching threshold function is, however, highly related to the concept of fuzzy membership functions. This assumed relation has encouraged us to perform a comparison between the schema matching threshold function and the fuzzy membership function which comparison is the topic of this paper. We used ANFIS for obtaining membership functions which were mapped to adequate threshold functions in order to be able to compare them. The outcome of our comparative analysis was that these mapped function pairs significantly resemble to each other.