{'fraction_non_alphanumeric': 0.011464968152866241, 'fraction_numerical': 0.0, 'mean_word_length': 5.894736842105263, '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}}
Dynamic service match-making model and algorithm

The model and algorithm to determine appropriate services for dynamic requirements are developed. Customer requirements are classified into static and dynamic requirements, then the services and dynamic requirements are decomposed within the same dimensions into specialized sub items. By mapping these decomposed sub items to the same ontology concept tree, the similarity between a service and the corresponding dynamic requirement can be calculated. The weighted average of theses similarities are calculated for eventually determining the matching value of the service and dynamic requirements. Comparing different service and dynamic requirements matching values helps service providers to make better service match-making choice.