An Algorithm On Web Services Matchmaking Based On Ontology And Its Word Similarity

With the fast development of the internet, the growing number of web services available on the web raises an challenging search problem: how to efficiently locate functionality-desired web services among numbers of web services. However, traditional web services discovering technology is done by keyword match based on the syntactic description of web services. Such web services discovering technology cannot capture the semantic information of web service and is lack of intelligence. The purpose of semantic web is to extend the current web, makes the information on the web semantic and understood, managed by machines. So semantic-based web service discovering technology is becoming a hot research topic.The research on web services discovering comprise three sub problems: (1) Web services discovering involves four parts: discovering requestor, request processing unit, services provider and the locus of the services description, how to organize these four parts in a running environment ; (2) How to map the heterogeneous service description model utilized by the service requestor and provider; (3) The performance and efficiency of the service matchmaking algorithm. Among these three problems, the third is the most significant, but the solutions to the initial two problems will make a difference to the solution of the third one. This thesis focus on the research of web services matchmaking algorithm on the assumption that the services descriptions and the request processing unit are in the same centralized...