Algorithm Research Of Semantic Annotation For Web Service

This project is supported by National Natural Science Foundation of China, No.90204010,2003.1 2005.12.WSDL has realized information exchange in the Web Service. However, more attention is paid to the special realization and semantic publish and discover is ignored, so current Web Service isn't mature. It is the most important task to make WSDL semantic today.This thesis advances the formal definition of the semanteme in the semantic web, based on it, advances the way semanteme is described and derived and discusses the semantic completeness. To be used in the actual network, the method of semantic amplification is defined. Then the formal definition of the semantic web is completed and it advances the whole model of semantic web. MWSAF is introduced in detail here. It is used to insert semantic information into the WSDL files by annotating WSDL items with related ontologies. There are two match algorithms, one is based on concept name and another is based on concept structure.This thesis analyses the original match algorithm based on concept name. It computes the last match degree based on the all match algorithms in the improved algorithm. Specially, the match degree not only shows the relationship between the matched concepts but also shows the matched algorithm's applicability according to the current matched concepts.This thesis analyses the original match algorithm based on concept structure. To indicate different concepts' different importance, the sub-concepts are weighted in the improved algorithm. The relationship between weight and using frequency is proved and the computing method is reasoned out.At last, the conclusion and prospect are made. The potential research area in the match algorithm based on concept structure is talked about.