← 返回卡片

原书出处

Natural Language Processing in Action, Second Edition

Second Edition · 核验版本的摘录快照 · 导入于 2026-11-14T20:22:29.272Z

There is only one way to find the exact nearest neighbor for your query. Remember how we discussed exhaustive search in chapter 4? Back then, we found the nearest neighbor of the search query by computing its dot product with every vector in the database. That was okay because back then, your database included only a couple dozen vectors. It won’t scale to a database

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Natural Language Processing in Action, Second Edition/_epub-src/OEBPS/Text/chapter-10.html

EPUB SHA-256:0e9a35e49ca446e322e5524e53f39fb6bee5b2b23d9cda10ef052aca770b0b36