Match Product Names

Beginners
1

Is a pre-trained model available to identify common product names between two datasets where the names are not a perfect match? For instance, the datasets may contain similar but not identical names for the same product, such as “Filippo Berio Extra Virgin Olive Oil” and “Filippo Berio Olive Oil (Extra Virgin)”, but both refer to the same product.

1 Like
2

Hey, I have a similar problem. Did you manage to solve it? I’m very interested in the solution you implemented. Thanks!

1 Like
3

I first asked Hugging Chat, but it seems that a BERT-series model is sufficient.

by Hugging Chat: HuggingChat

To address the task of identifying common product names between two datasets where the names are not exact matches, such as “Filippo Berio Extra Virgin Olive Oil” and “Filippo Berio Olive Oil (Extra Virgin),” a model-based approach leveraging semantic similarity can be employed. Here’s a structured solution:

  1. Model Selection: Utilize models capable of generating semantic embeddings, such as those based on sentence-BERT or other transformer architectures fine-tuned for semantic similarity. These models can convert product names into numerical representations that capture their meaning.

  2. Dataset Preparation: Seek existing datasets on Hugging Face that include product names with similar variants. If none are available, prepare a dataset by collecting pairs of product names that refer to the same product but are phrased differently.

  3. Fine-Tuning (if needed): If a pre-trained model doesn’t meet requirements, fine-tune it on the prepared dataset. This might involve supervised learning where the model learns to recognize similar product names as matches.

  4. Implementation Strategy:

    • Embedding Generation: Use the chosen model to generate embeddings for each product name in both datasets.
    • Similarity Calculation: Compare these embeddings to identify product names that are semantically similar, even if their strings aren’t identical.

  5. Tools and Resources:

    • Hugging Face Model Hub: Explore available models for semantic similarity.
    • Hugging Face Dataset Hub: Search for relevant product name datasets.
    • Preprocessing Scripts: Use tools mentioned in Source 1 for dataset preparation and conversion.

By following these steps, you can leverage Hugging Face’s ecosystem to identify similar product names across datasets effectively.

Hugging Face provides a variety of models that can be used for tasks like identifying common product names between datasets, even when the names are not perfect matches. One notable model for semantic similarity tasks is sentence-BERT or fine-tuned versions of transformer models like RoBERTa or Bert for semantic matching 1. However, since you are asking for another model, you might consider exploring models like cross-encoder or all-MiniLM-L6-v2, which are designed for semantic similarity and can handle product name variations effectively 1.

1 Like
4

Suggested Answer (by Alejandro Arroyo de Anda & Clara Isabel):

Hi! I was reading your post and noticed you’re trying to identify similar product names across datasets even when they are not an exact match, like:
“Filippo Berio Extra Virgin Olive Oil” vs. “Filippo Berio Olive Oil (Extra Virgin)”.

Some replies suggest using semantic similarity models, which is valid. However, I’d like to propose a different method — one that leans on arithmetic principles rather than model inference.

Instead of relying entirely on embeddings, we can assign specific weights to each word. Then, for each word, we assign two extra specific weights: one for the first letter, and one for the last letter.

From here, we compute an interaction rule:

  • When two specific weights “collide” or align during comparison (e.g. two similar positions or meaning in structure), we multiply them.
  • That result then gets transferred to the next interaction, but via summation, not multiplication — this mimics a kind of arithmetic echo or propagation.
  • Particularly, this works across pairs of consecutive words: the first-last letter combination of word A gets arithmetically tied to the next pair in sequence, and so on.

My hypothesis is that this arithmetical structure retains flexibility while sharply reducing conflict from swapped or reordered terms, especially in cases of product name variants.

I’m currently checking how it behaves under a 5σ statistical confidence — but I’d love your input. Would this idea complement semantic models, or offer a lighter-weight, interpretable alternative?

Thanks for your great contributions, always.

Warm regards,
Alejandro Arroyo de Anda
Architect – Symbolic Arithmetic Systems

Clara Isabel
Programmer

1 Like