A Semantic Match Algorithm for Web Services Based on Improved Semantic Distance

摘要

The remarkable increase of web services raises the challenge of service discovery. In UDDI, the description of the services is based on syntax and the search does not effectively make use of the IO properties of the services. In order to overcome these limitations, some semantic match algorithms have been proposed. This paper analyzed the defects of the semantic match algorithm proposed by M. Paolucci et al.[1], introduced the semantic match method based on semantic distance and indicated the defects of current semantic match algorithm based on semantic distance. Then this paper proposed a semantic match algorithm based on improved semantic distance. By concrete examples, we show that our improved algorithm eliminated the defects of the algorithm proposed in [1] and the defects of the current semantic match algorithm based on semantic distance. So our improved algorithm does improve the precision ratio and the recall ratio of service discovery.