Specializing string matchers is a canonical example of partial evaluation. A naive implementation of a string matcher repeatedly matches a pattern against every substring of the data string; this operation should intuitively benefit from specializing the matcher with respect to the pattern. In practice, however, producing an efficient implementation by performing this specialization using stand...

Discovering correspondences between schema elements is a crucial task for data integration. Most matching tools are semi-automatic, e.g. an expert must tune some parameters (thresholds, weights, etc.). They mainly use several methods to combine and aggregate similarity measures. However, their quality results often decrease when one requires to integrate a new similarity measure or when matchin...

In this paper, we describe the Template Matcher, a system built at SRI to provide robust natural-language interpretation in the Air Travel Information System (ATIS) domain. The system appears to be robust to both speech recognition errors and unanticipated or difficult locutions used by speakers. We explain the motivation for the Template Matcher, describe in general terms how it works in compa...

We derive a compiler for ML-style pattern matches. It is conceptually simple and produces reasonably good compiled matches. The derivation is inspired by the instrumentation and partial evaluation of na ve string match-ers. Following that paradigm, we rst present a general and na ve ML pattern matcher, instrument it to collect and exploit extra information, and show that partial evaluation of t...

In this paper, we present YAM, a schema matcher factory. YAM (Yet Another Matcher) is not (yet) another schema matching system as it enables the generation of a la carte schema matchers according to user requirements. These requirements include a preference for recall or precision and a training data set (a set of expert correspondences or a domain of interest). YAM uses a knowledge base that i...

We derive a compiler for ML style pattern matches It is conceptu ally simple and produces reasonably good compiled matches The derivation is inspired by the instrumentation and partial evaluation of na ve string match ers Following that paradigm we rst present a general and na ve ML pattern matcher instrument it to collect and exploit extra information and show that partial evaluation of the in...

The current use of semantic similarity with a reference ontology in ontology alignment (OA) systems is reviewed. An extended matcher is described that incorporates semantic similarity with the use of a reference ontology. This matcher has been implemented using as a basis AgreementMaker’s mediating matcher. Specific experiments using the OAEI anatomy track are performed using the Uberon ontolog...

This paper addresses the problem of selecting a name from a very large list using spelling recognition. In order to greatly reduce the computational resources required, we propose a tree-based lexical fast match scheme to select a short list of candidate names. Our system consists of a free letter recognizer, a fast matcher, and a rescoring stage. The letter recognizer uses n-grams to generate ...