The Study on Three-Stage Matching Algorithm Framework of Semantic Similarity

WEB service matching is of great significance in automatic composition and intelligent dynamic composition of services and the service matching algorithm is the key factor determining efficient and fast service matching. Most of the traditional service matching algorithms are syntax-based service matching and are lack of the description of semantics, which will seriously affect the precision and recall rate of service matching. And on the basis of the semantic annotation of service descriptions and semantic-based three-stage service matching models, this paper designs a three-stage matching algorithm framework. And through examples analysis and verification, the proposed matching algorithm is of great significance to improve precision and recall rate of service matching and has important research significance for the follow-up part of the Semantic Web Services such as service selection, service composition, service execution, etc.