[KongchangAI]
Unverified50% confidenceTradeoffExact time

MBR解码需要从模型中采样数十到数百个候选译文并对每对候选计算效用得分,计算复杂度为O(n²)

1
Sources
50%
Confidence
Long-term
Relevance
8/21/2026
First Seen

Sources

Related Claims

Cite This Claim

Stable URI
https://kongchang.com/claim/784047
API
curl https://kongchang.com/api/v1/knowledge/claims/784047
MCP
get_claim(id=784047)