超越 grep：为上下文丰富型 AI 编码支架正名

英文标题：Beyond grep: The case for a context-rich AI coding harness

Augment Code 工程副总裁 Vinay Perneti 接受 Ars Technica 采访，阐释了其语义上下文引擎如何通过嵌入、检索模型和向量数据库预先索引代码库。与基于 grep 的方法不同，Augment 的方案聚焦语义检索，在大规模私有代码库中优势尤为明显，因为大模型已熟记公开仓库，而私有代码需要真正的理解。这一讨论为 AI 编码工具的上下文策略选择提供了新的技术见解。

打开原文相关 3 · 机会 0

中文

Augment Code 做出了一个截然不同的选择，尽管两家公司并非在测试相同的干预措施或追求相同的优化目标；其产品使用嵌入、检索模型和向量数据库对仓库进行预索引，然后再检索概念相关的代码。因此，为了获得这场讨论的另一方观点，我与 Augment Code 工程副总裁 Vinay Perneti 进行了交流。

Perneti 简要介绍了 Augment Code 的差异化方法，给出了其团队对优势的评估，回应了精简型支架的一些论点，并分享了他对开发者普遍关心的 AI 工具和代理工作流相关问题的看法。

与 Vinay Perneti 的对话

为篇幅和清晰起见，本采访经过编辑。

Ars Technica ：能请你解释一下 Augment Code 的上下文引擎是如何工作的吗？

Vinay Perneti ：那么，退一步讲，某个开发者想要实现什么？他们希望完成一项特定任务，并把它交给一个代理。如今代理有意思的地方在于，它们的上下文窗口有限，每次都需要先获取该任务所需的全部上下文，然后再处理。

获取上下文有两种方法。一种是基于 grep 的。Claude Code、Codex 和其他代理都采用了这种方法。第二种是语义检索。对 Augment 来说，我们一直走的是语义路线，我来描述一下它的构建模块。

我认为有两个核心部分。一是系统中有一对嵌入模型和检索模型在协同工作，另一个是有一个向量数据库和一整套高度优化的后端系统，使得检索能在亚毫秒级内完成。

Ars Technica ：这种方法在某一类代码库上会比另一类更具优势吗？

Perneti ：是的，事实表明，优势在大规模私有代码库中。我来说明原因。

对于大多数基准测试所在的公开开源仓库，每个模型基本上都已经记住了仓库内容。这些模型足够大，实际上能记住整个仓库。因此，当你试图完成某件事时，模型多少已经知道该去哪里找，从而能快速得到结果。

English / 原文

Augment Code has made a substantially different bet, although the two companies are not necessarily testing the same interventions or optimizing for the same outcomes; its product pre-indexes the repository using embeddings, a retrieval model, and a vector database, then retrieves conceptually relevant code. So to get the other side of that discussion, I spoke with Vinay Perneti, Augment Code’s VP of Engineering.

Perneti briefly described Augment Code’s differing approach, offered his own team’s evaluations of the advantages, responded to some of the arguments for a leaner harness, and shared his perspective on some of the concerns developers have about AI tools and agentic workflows more broadly.

A conversation with Vinay Perneti

This interview has been edited for length and clarity.

Ars Technica : Can you explain how Augment Code’s context engine works?

Vinay Perneti : So, if I take a step back, what is it that a particular developer is trying to achieve? They want a particular task implemented and they give it to an agent. And the interesting thing with agents today is they have a limited context window, and every time they need to essentially go get all of the context needed for that and then work on it.

There’s two approaches to context. One is grep-based. Claude Code and Codex and other agents have done that. The second is the semantic retrieval bit. For Augment, we’ve always taken the semantic route, and I’ll describe the building blocks of that.

I would say there’s two core pieces. One is, we have an embedding and a retrieval model pair that are working in the system, and then you have a vector database and an entire, highly optimized back-end system that makes it possible to retrieve in sub-milliseconds.

Ars : Does it have an advantage in one kind of code base versus another?

Perneti : Yeah, it actually turns out the advantage comes in large, private codebases. And here is why I say that.

For all the public, open source repos where most of the benchmarks are run, every single model has basically memorized the repo. These models are large enough that they’re actually able to memorize the whole repo. So when you’re trying to get something done, the models kind of already know where to look so they can get to an outcome quickly.