Intelligent Lookup Wizard

Match messy text records across datasets using fuzzy and composite algorithms.

25|7|Updated Feb 7, 2026
One-click install
npx skills add https://github.com/MarioDeFelipe/sap-datasphere-plugin-for-claude-cowork --skill intelligent-lookup-wizard
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: Intelligent Lookup Wizard
Source: https://github.com/MarioDeFelipe/sap-datasphere-plugin-for-claude-cowork/tree/main/skills/datasphere-intelligent-lookup
Command: npx skills add https://github.com/MarioDeFelipe/sap-datasphere-plugin-for-claude-cowork --skill intelligent-lookup-wizard

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes references (resource) components.

What problem does it solve?

The Intelligent Lookup Wizard addresses the challenge of matching and harmonizing records across disparate systems when exact keys are missing or inconsistent, eliminating manual reconciliation and reducing duplicate master data caused by typos, abbreviations, and format differences.

Core Features & Use Cases

  • Configurable matching strategies: Choose exact, fuzzy (Jaro-Winkler, Levenshtein), phonetic (Soundex/Metaphone), token-based, or composite hybrid rules.
  • Multi-column weighted scoring: Combine primary and secondary fields (name, address, postal code) with custom weights and thresholds to improve precision.
  • Preprocessing and normalization: Case normalization, punctuation removal, abbreviation expansion, and diacritic handling to improve match rates.
  • Review and approval workflow: Batch review by score ranges, side-by-side comparisons, and manual approve/reject/skip states for governed MDM processes.
  • Real-world uses: Vendor deduplication, customer record consolidation, product catalog harmonization, and cross-system reconciliation between ERP/CRM systems.

Quick Start

Run an intelligent lookup to match VendorInput to VendorMaster using Jaro-Winkler at a 0.85 threshold with normalization and review matches in the batch review interface.

Frequently Asked Questions about Intelligent Lookup Wizard

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I match vendor records across datasets when exact keys are missing or inconsistent?

To match vendor records without exact keys, apply fuzzy matching algorithms like Jaro-Winkler and Levenshtein to reconcile inconsistent text data. This process normalizes typos and format differences, yielding harmonized master data records.

What is the best way to deduplicate customer records caused by abbreviations and format differences?

The best way to deduplicate customer records is using composite matching rules with multi-column weighted scoring and preprocessing. Expanding abbreviations and normalizing text improves match rates, resulting in consolidated customer master data.

Can I use phonetic matching for product catalog harmonization across ERP and CRM systems?

Yes, you can use phonetic matching algorithms like Soundex or Metaphone for product catalog harmonization. Applying these algorithms during cross-system reconciliation identifies similar sounding product names, producing a unified catalog.

How do I tune fuzzy matching thresholds to improve precision during data integration?

You tune fuzzy matching thresholds by adjusting similarity scores, such as setting a Jaro-Winkler threshold at 0.85, and applying custom weights to primary and secondary fields. This configuration increases match precision during data integration.

Does fuzzy matching for master data harmonization include a review and approval workflow?

Yes, fuzzy matching for master data harmonization includes a batch review workflow with side-by-side comparisons. This workflow provides manual approve, reject, or skip states to govern the master data management process.

When should I use token-based matching instead of Levenshtein distance for data reconciliation?

Use token-based matching instead of Levenshtein distance when reconciling records with transposed words or swapped address components. Token-based algorithms evaluate word-level similarity, capturing structural variations that character-distance metrics miss.