知识卡片
查询与文档须使用兼容表示契约
相似度比较需要匹配的嵌入空间、维度和度量,查询文档可按检索模型规定使用不同前缀或编码塔。更新模型时需检查并重建相关索引,不能只因两个向量同维就混用,也不要求Reader与Retriever是同一个模型。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- · 查看原书依据
That’s why you need powerful search tools in your arsenal. Vector databases are the answer to this challenging semantic search problem. Vector databases are powering a new generation of search engines that can quickly find the information you are looking for, even if you need to search the entire internet. But before we get to that, let’s take a look at the basics of semantic
参考来源
- 位置:《Natural Language Processing in Action, Second Edition》第10章《真实世界中的大语言模型》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Natural Language Processing in Action, Second Edition/_epub-src/OEBPS/Text/chapter-10.html)
- 结论依据:摘录中关于查询与文档须使用兼容表示契约的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:That’s why you need powerful search tools in your arsenal. Vector databases are the answer to this challenging semantic search problem. Vector databases are powering a new generation of search engines that can quickly find the information you are looking for, even if you need to search the entire internet. But before we get to that, let’s take a look at the basics of semantic