{'fraction_non_alphanumeric': 0.013685239491691105, 'fraction_numerical': 0.0, 'mean_word_length': 5.87248322147651, '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 unified graph-based framework for deriving nominal interscheme properties, type conflicts and object cluster similarities

The availability of automatic tools for inferring semantics from database schemes is very relevant in designing large cooperative information system applications involving many information sources. Deriving semantics from existing data sources exploits properties of objects belonging to different input schemes (interscheme properties), such as synonymies, homonymies, type conflicts, and subscheme similarities. The paper gives a contribution in this context by proposing a collection of graph based techniques for a uniform derivation of all interscheme properties. All techniques are characterized by a common core consisting of the computation of a maximum weight matching on suitable bipartite graphs. The computation of the maximum weight matching is based on a suitable metrics which is used to measure object semantic similarities. A running example is provided to illustrate the approach.