Results 1 - 10
of
4,817
Efficient semantic matching
, 2004
"... We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into prop ..."
Abstract
-
Cited by 855 (68 self)
- Add to MetaCart
We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes
Semantic matching of web services capabilities
, 2002
"... Abstract. The Web is moving from being a collection of pages toward a collection of services that interoperate through the Internet. The first step toward this interoperation is the location of other services that can help toward the solution of a problem. In this paper we claim that location of web ..."
Abstract
-
Cited by 581 (24 self)
- Add to MetaCart
of web services should be based on the semantic match between a declarative description of the service being sought, and a description of the service being offered. Furthermore, we claim that this match is outside the representation capabilities of registries such as UDDI and languages such as WSDL. We
S-match: an algorithm and an implementation of semantic matching
- In Proceedings of ESWS
, 2004
"... semantic matching ..."
Semantic matching: Algorithms and implementation
- JOURNAL ON DATA SEMANTICS
, 2007
"... We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each other. Semantic matching is based on two ideas: (i) we discover mappings by computing semantic relation ..."
Abstract
-
Cited by 75 (29 self)
- Add to MetaCart
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each other. Semantic matching is based on two ideas: (i) we discover mappings by computing semantic
Semantic matching with S-Match
- in Semantic Web Information
, 2009
"... We view matching as an operation that takes two graph-like structures (e.g., lightweight ontologies) and produces an alignment between the nodes of these graphs that correspond semantically to each other. Semantic matching is based on two ideas: (i) we discover an alignment by computing semantic re- ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
We view matching as an operation that takes two graph-like structures (e.g., lightweight ontologies) and produces an alignment between the nodes of these graphs that correspond semantically to each other. Semantic matching is based on two ideas: (i) we discover an alignment by computing semantic re
Semantic Matching in Search
"... In this talk, we will give a high level introduction to our book entitled “Semantic Matching in Search”, which was published recently in Foundations and Trends in Informa-tion Retrieval [1]. We will start our talk by pointing out the importance of semantic matching for natural language processing an ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
In this talk, we will give a high level introduction to our book entitled “Semantic Matching in Search”, which was published recently in Foundations and Trends in Informa-tion Retrieval [1]. We will start our talk by pointing out the importance of semantic matching for natural language processing
Abstract Semantic Matching
, 2003
"... We think of match as an operator that takes two graph-like structures (e.g., database schemas or ontologies) and produces a mapping between elements of the two graphs that correspond semantically to each other. The goal of this paper is to propose a new approach to matching, called semantic matching ..."
Abstract
- Add to MetaCart
We think of match as an operator that takes two graph-like structures (e.g., database schemas or ontologies) and produces a mapping between elements of the two graphs that correspond semantically to each other. The goal of this paper is to propose a new approach to matching, called semantic
Towards Explaining Semantic Matching
, 2004
"... Interoperability among systems using di#erent term vocabularies requires some mapping between terms in the vocabularies. Matching applications generate such mappings. When the matching process utilizes term meaning (instead of simply relying on syntax), we refer to the process as semantic matching. ..."
Abstract
- Add to MetaCart
Interoperability among systems using di#erent term vocabularies requires some mapping between terms in the vocabularies. Matching applications generate such mappings. When the matching process utilizes term meaning (instead of simply relying on syntax), we refer to the process as semantic matching
Semantic Matching in Rewrite Theories
, 1997
"... #Semantic matching" is the process of generating a basis set of substitutions #of terms for variables# that makes one term equal to another in a speci#ed theory.We restrict ourselves here to matching problems in equational theories that can be presented as programs in the form of convergent r ..."
Abstract
- Add to MetaCart
#Semantic matching" is the process of generating a basis set of substitutions #of terms for variables# that makes one term equal to another in a speci#ed theory.We restrict ourselves here to matching problems in equational theories that can be presented as programs in the form of convergent
Element Level Semantic Matching
- IN PROCEEDINGS OF MEANING COORDINATION AND NEGOTIATION WORKSHOP AT ISWC
, 2004
"... We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes . The matching process is essentially divided into two steps: element level and structure level. Element level matchers consider only labels of nodes, while structure ..."
Abstract
-
Cited by 27 (15 self)
- Add to MetaCart
We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes . The matching process is essentially divided into two steps: element level and structure level. Element level matchers consider only labels of nodes, while structure
Results 1 - 10
of
4,817