EdTech Tracker

← Coding lens

vector search

technique judged 98% likely a named technique or architecture

First seen
2022-07-13
Independent sources
13
Articles
111
Last 4 weeks vs prior
0 vs 27

See how it has spread across media tiers

Mentions over time

Articles per week (by publish date) using the term, in any spelling.
09.5192022-W282025-W352026-W41
Table view
WeekArticlesSources
2022-W2811
2023-W5111
2024-W0511
2024-W0811
2024-W1122
2024-W1311
2024-W1531
2024-W2211
2024-W2311
2024-W2411
2024-W2511
2024-W2611
2024-W2911
2024-W3311
2024-W4011
2024-W4111
2024-W4732
2024-W4911
2024-W5011
2024-W5211
2025-W0211
2025-W0911
2025-W2111
2025-W2211
2025-W2311
2025-W2411
2025-W2711
2025-W3511
2025-W4011
2025-W4911
2026-W0111
2026-W0411
2026-W0711
2026-W0811
2026-W0941
2026-W11122
2026-W1211
2026-W1332
2026-W1511
2026-W1611
2026-W1811
2026-W1911
2026-W2011
2026-W2442
2026-W2511
2026-W3233
2026-W3311
2026-W3421
2026-W3511
2026-W3632
2026-W3721
2026-W3831
2026-W3922
2026-W40195
2026-W4162

In their words

Structure your context retrieval as intent-specific pipelines: Intent: urgent_delivery ├─ Primary: Order status (DynamoDB, <100ms) ├─ Secondary: Shipping partner API (network call, <500ms) ├─ Tertiary: Customer tier/VIP status (cache, <50ms) └─ Fallback: Previous support tickets (search index) Intent: refund_request ├─ Primary: Transaction record (database) ├─ Secondary: Refund policy version (con

Return only a number between 0 and 1.""" response = await self.judge.ainvoke(prompt) try: scores.append(float(response.strip())) except: scores.append(0.5) return sum(scores) / len(scores) if scores else 0 def _compute_consistency(self, all_outputs) -> float: # Semantic similarity between runs (simplified) agreements = 0 total = 0 for outputs in all_outputs: for i in range(len(outputs)): for j in

A plain similarity search gives you the closest chunks.

embedder ( query ) # Stage 2: Vector search (fetch more for reranking) raw_results = self .

split () return sentence_bleu ( ref_tokens , pred_tokens ) def compute_bertscore ( references : list [ str ], predictions : list [ str ]) -> dict : """ BERTScore: semantic similarity using embeddings.

Extend it with: Database tools (SQL queries) API integrations (Slack, GitHub, Notion) Browser automation (Playwright) Image generation (DALL-E, Stable Diffusion) Vector search (your RAG system!) The pattern is always: define tool → register schema → execute → return result.

Coordination Patterns, Version-Aware | Dimension | LangGraph | CrewAI | AutoGen (existing systems) | Microsoft Agent Framework (new projects) | |---|---|---|---| | Status | Actively developed | Actively developed | Maintenance mode — no new features; community-managed | 1.0 GA April 2026 ; Microsoft's recommended successor | | Mental model | Explicit graph: nodes are steps, edges are transitions |

Strategy How it works Best for Watch out for Fixed-size Split every N tokens, usually with overlap Quick baselines, uniform text Cuts mid-sentence and mid-idea Recursive Split on paragraphs, then sentences, then words, until chunks fit General prose; a solid default Ignores document structure beyond separators Structure-aware Split on headings, sections, code blocks, table boundaries Docs, wikis,