0Pricing
LLM Apps in Production (RAG + Vector DB + Caching) · 课时

向量嵌入与相似度搜索

掌握向量嵌入及其生成方式的概念，并了解相似度搜索如何实现相关文档检索。

向量嵌入与相似度搜索 是 CoddyKit 上的免费 LLM Apps in Production (RAG + Vector DB + Caching) 课时。 这是第 2 节课，共 4 节。 你可以在下方免费阅读本课时的完整内容 — 然后在浏览器中使用内置代码编辑器和全天候 AI 导师进行实践。 这是 LLM Apps in Production (RAG + Vector DB + Caching) 学习路径的一部分，你的进度在网页和 CoddyKit 应用中同步。 LLM Apps in Production (RAG + Vector DB + Caching) 课程共包含 4 节课。

本课时的部分内容尚未翻译，以英文显示。

Vectors for Meaning

Welcome! In the world of Large Language Models (LLMs), understanding text isn't just about words. It's about meaning.

Computers naturally work with numbers, not human language. How do we bridge this gap to help LLMs understand the meaning of text?

What are Vector Embeddings?

Vector embeddings are numerical representations of text (or images, audio, etc.). Think of them as a list of numbers that capture the 'essence' or 'meaning' of a piece of information.

  • Each piece of text (a word, sentence, or document) gets its own unique vector.
  • These vectors are usually long lists of floating-point numbers (e.g., [0.123, -0.456, 0.789, ...]).

The Magic Behind Embeddings

How are these magical numbers created? Special machine learning models, often called embedding models, are trained to convert text into these vectors.

These models learn to map similar meanings to vectors that are numerically 'close' to each other in a high-dimensional space.

Semantic Similarity Explained

The core idea is that if two pieces of text have similar meanings, their vector embeddings will be close together.

For example, the embedding for "cat" would be closer to "kitten" than to "car". This 'closeness' is what allows computers to understand semantic similarity.

Generating Embeddings (Concept)

In a real RAG system, you'd use an API from a provider like OpenAI, Cohere, or an open-source model to generate embeddings for your text data.

You feed the text, and the API returns the vector. It's that simple from a usage perspective!

Code: Mock Embedding Generation

Here's a Python example showing how you might conceptually interact with an embedding function. In reality, get_embedding would make an API call.

def get_embedding(text):
    """
    Simulates an embedding model. Returns a dummy vector.
    """
    if "hello" in text.lower():
        return [0.1, 0.2, 0.3]
    elif "goodbye" in text.lower():
        return [0.8, 0.7, 0.6]
    else:
        return [0.0, 0.0, 0.0]

if __name__ == "__main__":
    text1 = "Hello, CoddyKit!"
    text2 = "Time to say goodbye."
    text3 = "Another sentence."

    print(f"Vector for '{text1}': {get_embedding(text1)}")
    print(f"Vector for '{text2}': {get_embedding(text2)}")
    print(f"Vector for '{text3}': {get_embedding(text3)}")

Why Similarity Search?

Once you have all your documents (or chunks of documents) converted into embeddings, how do you find the most relevant ones when a user asks a question?

This is where similarity search comes in. It's the process of finding embeddings that are 'closest' to a given query embedding.

How Similarity Search Works

Similarity search mathematically measures the 'distance' or 'angle' between vectors. Common methods include:

  • Cosine Similarity: Measures the angle between two vectors. A smaller angle (closer to 1) means higher similarity.
  • Euclidean Distance: Measures the straight-line distance between two points (vectors). A smaller distance means higher similarity.

These calculations quickly identify the most semantically similar documents.

Embeddings + Search = RAG Power

In RAG, when a user asks a question:

  1. The question is converted into an embedding.
  2. Similarity search is performed against a database of document embeddings.
  3. The top N most similar document chunks are retrieved.

These retrieved chunks then provide context to the LLM, making its answers more accurate and grounded.

Quick Check on Embeddings

Vector embeddings are crucial for RAG. Let's test your understanding.

Recap: Embeddings & Search

Great job! You've learned about the foundational concepts of vector embeddings and similarity search.

  • Vector embeddings turn text into numbers, capturing meaning.
  • Embedding models create these vectors.
  • Similarity search uses mathematical distance to find the most relevant vectors (and thus documents) to a query.

These techniques are at the heart of how RAG systems find and provide relevant context to LLMs.

常见问题解答

「向量嵌入与相似度搜索」课时是免费的吗？

是的 — 「向量嵌入与相似度搜索」的完整文本可在网页上免费阅读。要进行交互式练习（内置代码编辑器和全天候 AI 导师）并解锁 LLM Apps in Production (RAG + Vector DB + Caching) 课程的其余内容，请升级到 CoddyKit PRO。 LLM Apps in Production (RAG + Vector DB + Caching) 课程共包含 4 节课。

「向量嵌入与相似度搜索」这节课中我会学到什么？

掌握向量嵌入及其生成方式的概念，并了解相似度搜索如何实现相关文档检索。 你通过在浏览器中直接运行的动手代码来练习 LLM Apps in Production (RAG + Vector DB + Caching)，全天候 AI 导师会在你学习这节课的过程中回答你的问题。

学习 LLM Apps in Production (RAG + Vector DB + Caching) 需要有经验吗？

无需任何先前经验。CoddyKit 上的 LLM Apps in Production (RAG + Vector DB + Caching) 课程适合初学者到高级学习者，你可以从这里开始或从头开始，按照自己的节奏学习。 这是第 2 节课，共 4 节。

「向量嵌入与相似度搜索」课时需要多长时间？

大多数 CoddyKit 课程大约需要 5–10 分钟。每节课都很精短且互动，所以你能稳步进步，并在网页和应用中从离开的地方继续。

我能在这节 LLM Apps in Production (RAG + Vector DB + Caching) 课中编写并运行代码吗？

能。每节 LLM Apps in Production (RAG + Vector DB + Caching) 课都包含内置代码编辑器，你可以在浏览器中直接编写并运行真实代码，并获得即时 AI 反馈 — 无需本地设置。

此课程中的所有课时

  1. 向量数据库的必要性
  2. 向量嵌入与相似度搜索
  3. 集成向量数据库
  4. 索引、过滤与混合搜索
← 返回 LLM Apps in Production (RAG + Vector DB + Caching)