Skip to search formSkip to main contentSkip to account menu

Semantic matching

Semantic matching is a technique used in computer science to identify information which is semantically related. Given any two graph-like structures… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Web-based QA, pioneered by Kwok et al. (2001), successfully demonstrated the power of Web redundancy. Early WebQA systems, such… 
2012
2012
In this paper, we present our participation in the Medical Records Track of TREC 2012. This is the second time we take part in… 
2007
2007
Modelling complex processes in the service oriented architecture paradigm typically requires the composition of a number of… 
2006
2006
We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes… 
2006
2006
Web service composition is a difficult and important requirement for the success of the Semantic Web. In this paper, we present a… 
2006
2006
This work approaches the problem of delivering services in a personalized way in an eTourism scenario. Our research, on one side… 
2005
2005
The amount of machine oriented data on the web as well as the deployment of agent/Web Services are simultaneously increasing… 
2003
2003
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem… 
2003
2003
We are interested in the interaction of databases in Peer-to-Peer (P2P) networks. In this paper we propose a new solution for P2P…