Structural Semantic Interconnections: A Knowledge-Based Approach to Word Sense Disambiguation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Semantic Web Service Composition in IRS-III: The Structured Approach
CEC '05 Proceedings of the Seventh IEEE International Conference on E-Commerce Technology
SA-REST and (S)mashups: Adding Semantics to RESTful Services
ICSC '07 Proceedings of the International Conference on Semantic Computing
Similarity search for web services
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
WSMO-Lite: Lightweight Semantic Descriptions for Services on the Web
ECOWS '07 Proceedings of the Fifth European Conference on Web Services
A JESS-enabled context elicitation system for providing context-aware Web services
Expert Systems with Applications: An International Journal
Exploiting Metrics for Similarity-Based Semantic Web Service Discovery
ICWS '09 Proceedings of the 2009 IEEE International Conference on Web Services
Content based service discovery in semantic web services using wordnet
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
IEEE Transactions on Knowledge and Data Engineering
Hi-index | 12.05 |
This paper proposes a semantic Web service discovery framework for finding semantic Web services by making use of natural language processing techniques. The framework allows searching through a set of semantic Web services in order to find a match with a user query consisting of keywords. By specifying the search goal using keywords, end-users do not need to have knowledge about semantic languages, which makes it easy to express the desired semantic Web services. For matching keywords with semantic Web service descriptions given in WSMO, techniques like part-of-speech tagging, lemmatization, and word sense disambiguation are used. After determining the senses of relevant words gathered from Web service descriptions and the user query, a matching process takes place. The performance evaluation shows that the three proposed matching algorithms are able to effectively perform matching and approximate matching.