A New Web Service Discovery Method Based on Semantic

To discovery Web services in Internet, many approaches have been proposed such as UDDI and DWS. The problem of those methods is that they are just a kind of simple syntax match based on keywords. They make the match inflexible, sometimes even unfaithful. This paper proposes a new algorithm to discover web services based on semantic. It uses tree-form data structure to describe the web services and give all the nodes a weight value by certain strategy, then compute the semantic similarity between the web services requested and the services registered. This algorithm makes services matching basing on semantic relationships at conceptual level. To validate the feasibility and effectiveness of the algorithm, we construct a self-developed prototype system named WSD. The experiments prove that this algorithm has high recall and precision than other methods.