Semantic search
semantic_searchSearch a memory's classes and objects — meaning AND keywords.
Two rankers run and their results are fused: a vector leg that matches by
meaning (finds the paraphrase) and a keyword leg that matches the literal
words (finds the rare token a vector smooths away — an error code, a
surname, a part number). Each hit carries `via` saying which legs found
it; a hit both agreed on is a stronger answer than one matched on
keywords alone. Ties break toward the NEWER row.
Because the keyword leg needs no index, search still answers on a memory
that was never embedded — with a `note` saying the semantic half was
unavailable. `memory` is the slug from list_my_memories. `kind` =
'class' | 'object' | omit. Check `status` and defer on 'unapproved'.
`expand=1` inlines each top object hit's FIRST RING — properties plus
relationship groups with counts and member previews — so you learn what a
hit is and what it touches without a get_object per hit. Prefer expand=1
whenever you intend to follow relationships; for reach beyond one ring,
use get_paths instead of hopping get_object calls.Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| kind | No | ||
| query | Yes | ||
| top_k | No | ||
| expand | No | ||
| memory | Yes |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||