A Semantic Matchmaker for Ranking Web Services

This paper is concerned with the matchmaker for rankingweb services by using semantics. So far several methods of semanticmatchmaker have been proposed. Most of them, however, focus onclassifying the services into predefined categories rather thanproviding a ranking result. In this paper, a new method of semanticmatchmaker is proposed for ranking web services. It is proposed to use thesemantic distance for estimating the matching degree between a service anda user request. Four types of semantic distances are defined and fouralgorithms are implemented respectively to calculate them. Experimentalresults show that the proposed semantic matchmaker significantlyoutperforms the keyword-based baseline method.