{'fraction_non_alphanumeric': 0.02244039270687237, 'fraction_numerical': 0.0, 'mean_word_length': 5.4324324324324325, '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}}
LogMap-P: On matching ontologies in parallel

An enormous amount of research have been published related to ontology matching. The core motivation behind these researches aim to develop matching techniques that result in highly accurate ontology matching systems. However the performance (in terms of execution time) of these matching techniques is predominantly unexplored and is equally important. Among the well established research implementations, LogMap an open source system, is considered as state-of-the-art in ontology matching due to its accuracy. This paper presents LogMap-P, an enhanced version of LogMap with motivation to boost performance while preserving the accuracy of the matching techniques.