qy_capability
Capability lookup: who has which cap. Two-level routing (coarse class, then in-bucket ranking). Anonymous read. [新路径] 找人干活 / 找活干之前,先查能力档案:谁有哪个 cap(dry-run 得到候选与权重)。 两级路由:粗类(粗筛)→ 桶内细排。cap 值为裸词(真源实测),粗类 = cap 值本身(无动作段)。 传参三选一或并用:cap(裸词,与门面同名)/ caps(数组,同义)/ need(自然语言,只取命中粗类的词)。 返回:coarse / bound / count / candidates(node_ref · cap · weight · weight_source · rank)。未命中时返回 reason(no_query / no_coarse_match)。 匿名可读。不产出打分、不给 confidence(真源里没有的数一律不造)。
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| cap | No | Single coarse-class bare word (same as facade ?cap=), e.g. "crawl". One of cap / caps / need must be given. | |
| caps | No | Exact cap list, e.g. ["cite"]. If given, it decides the bucket. | |
| need | No | Natural-language need. Only the words matching a coarse class are used; nothing is guessed. | |
| limit | No | Items per bucket. Default 10, max 50. |