{'fraction_non_alphanumeric': 0.0199764982373678, 'fraction_numerical': 0.0, 'mean_word_length': 5.218978102189781, '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}}
Service Matching Based on Semantic Descriptions

Matchmaking is an important aspect of Web Services interactions. In a dynamic environment such as the Internet, matchmaking services require rich and flexible metadata as well as efficient matching algorithms. The Semantic Web technologies, especially OWL and OWL-S, are gaining momentum and generating suitable technologies and tools to cover both the metadata and the algorithmic aspects. In this paper, we introduce a step-by-step matching algorithm that can be used to determine the semantic similarity of two Web Services. The matching algorithm is based on the Description Logics reasoning services and operates on service descriptions in OWL and OWL-S, with the matching results ranked. The algorithm is implemented in a prototype system, based on the well-known Racer description logics system.