Why Superlinked?

Table of Contents

• Why Superlinked?

  • Your users expect better search

  • Enter Superlinked

  • But can't I put all my data in json, stringify it and embed using LLM?

  • Okay, But can't I ...

    • 1. Use different already existing storages per attribute, fire multiple searches and then reconcile results?

    • 2. Use Metadata filters or Candidate re-ranking

  • Okay, seems like Superlinked proposes a nice approach, but

  • How does it fit in the big picture?

Your users expect better search

The landscape of search and information retrieval is rapidly evolving. With the rise of AI and large language models, user expectations for search capabilities have skyrocketed. Your users now expect that your search can handle complex, nuanced queries that go beyond simple keyword matching. Just hear what Algolia CTO has to say -

"We saw 2x more keywords search 6 months after the ChatGPT launch." Algolia CTO, 2023

They have 17,000 customers accounting for 120B searches/month. This trend isn't isolated. Across industries, we're seeing a shift towards more sophisticated search queries that blend multiple concepts, contexts, and data types.

Vector Search with text-only embeddings (& also multi-modal) fails on complex queries, because complex queries are never just about text. They involve other data too!

Consider these examples:

1. E-commerce: A query like "comfortable running shoes for marathon training under $150" involves text, numerical data (price), and categorical information (product type, use case).

2. Content platforms: "Popular science fiction movies from the 80s with strong female leads" combines text analysis, temporal data, and popularity metrics.

3. Job search: "Entry-level data science positions in tech startups with good work-life balance" requires understanding of text, categorical data (industry, job level), and even subjective metrics.

Example of queries needing other data than text

Enter Superlinked

This is where Superlinked comes in, offering a powerful, flexible framework designed to handle the complexities of modern search and information retrieval challenges. Superlinked is a vector embedding solution for AI teams working with complicated data within their RAG, Search, Recommendations and Analytics stack.

Let's quickly go through an example. Keep in mind that there are a ton of new concepts thrown at you, but this is just to illustrate how Superlinked 'looks'. We'll go over each concept in detail in the following sections.

Imagine you are building a system that can deal with a query like “recent news about crop yield”. After collecting your data, you define your schema, ingest data and build index like this:

Schema definition

@schema
class News:
    id: IdField
    created_at: Timestamp
    like_count: Integer
    moderation_score: Float
    content: String

@schema
class User:
    id: IdField
    interest: String

@event_scehma
class Event:
    id: IdField
    news: SchemaReference[News]
    user: SchemaReference[User]
    event_type: String

Encoder definition

recency_space = RecencySpace(timestamp=news.created_at)
popularity_space = NumberSpace(number=news.like_count, mode=Mode.MAXIMUM)
trust_space = NumberSpace(number=news.moderation_score, mode=Mode.MAXIMUM)
semantic_space = TextSimilarity(
    text=[news.content, user.interest], model="sentence-transformers/all-mpnet-base-v2"
)

Define Indexes

index = Index(
    spaces=[recency_space, popularity_space, trust_space, semantic_space],
    effects=[Effect(semantic_space, event.user, 0.8 * event.news)],
)

You define your queries and parameterize them like this:

Query definition

query = (
    Query(
        index,
        weights={
            recency_space: Param("recency_weight"),
            popularity_space: Param("popularity_weight"),
            trust_space: Param("trust_weight"),
            semantic_space: Param("semantic_weight"),
        },
    )
    .find(news)
    .similar(semantic_space.text, Param("content_query"))
    .with_vector(user, Param("user_id"))
)

Debug in notebook, run as server

OnlineExecutor(
    sources=[RestSource(news), RestSource(user)],
    index=[index],
    query=[query],
    # vector_database = MongoDBVectorDatabase(...),
    # vector_database = RedisVectorDatabase(...),
)

# SparkExecutor()   <-- Coming soon in Superlinked Cloud

curl -X POST \
    'http://localhost:8000/api/v1/search/query' \
    --header 'Accept: */*' \
    --header 'Content-Type: application/json' \
    --data-raw '{
        "content_query": "crop yields",
        "semantic_weight": 0.5,
        "recency_weight": 0.9,
        "popularity_weight": 0.5,
        "trust_weight": 0.2,
    }'

Handle natural language queries

#In a notebook like this:

query = (
    Query(...)
    .with_natural_query(Param("recent news about crop yield"))
)

# As an API call like this:

curl -X POST \
    'http://localhost:8000/api/v1/search/query' \
    --header 'Accept: */*' \
    --header 'Content-Type: application/json' \
    --data-raw '{
        "natural_language_query": "recent news about crop yield"
    }'

Discover the powerful capabilities Superlinked offers here.

But can't I put all my data in json, stringify it and embed using LLM?

Stringify and embed approach produces unpredictable results. For example (code below):

• Embed 0..100 with OpenAI API

• Calculate and plot the cosine similarity

• Observe the difference between expected and actual results

from openai import OpenAI
import numpy as np
from sklearn.metrics.pairwise import cosine_similarity

response = OpenAI().embeddings.create(
    input=[str(i) for i in range(0, 101)],
    model="text-embedding-3-small",
)
embeddings = np.array([r.embedding for r in response.data])
scores = cosine_similarity(embeddings, embeddings)

OpenAI embeddings result in noisy, non-monotonic cosine similarity scores. For example, CosSim(25, 50) equals to 0.69 when CosSim(32, 50) equals 0.42 meaning 25 is more similar to 50 than 32 which doesn't make sense. Superlinked number embeddings avoid such inconsistencies by design.

Okay, But can't I ...

1. Use different already existing storages per attribute, fire multiple searches and then reconcile results?

Our naive approach (above) - storing and searching attribute vectors separately, then combining results - is limited in ability, subtlety, and efficiency when we need to retrieve objects with multiple simultaneous attributes. Moreover, multiple kNN searches take more time than a single search with concatenated vectors.

It's better to store all your attribute vectors in the same vector store and perform a single search, weighting your attributes at query time.

Read more here: Multi-attribute search with vector embeddings

2. Use Metadata filters or Candidate re-ranking

When you convert a fuzzy preference like “recent”, “risky” or “popular” into a filter, you model a sigmoid with a binary step function = not enough resolution.

Semantic ranking & ColBERT only use text, learn2rank models need ML Engineers. Broad queries eg “popular pants” can’t be handled by re-ranking at all, due to poor candidate recall.

Okay, seems like Superlinked proposes a nice approach, but

1. How can I build with it at scale?

   Superlinked Server offers a streamlined deployment solution for Superlinked projects. With a single script, you can create a Superlinked application featuring REST endpoints and Vector Database integration. This enables quick implementation of advanced search capabilities, allowing you to focus on leveraging Superlinked's features rather than managing infrastructure, from prototype to production.

How does it fit in the big picture?

Superlinked framework diagram