Unverified50% confidenceSolutionExact time
当两名标注员标注物体数量不同时，通常采用匈牙利算法进行最优匹配，剩余未匹配的标注计为分歧
1
Sources
50%
Confidence
Long-term
Relevance
8/22/2026
First Seen
Sources
Related Claims
VerifiedThe Hungarian algorithm has a time complexity of O(n³) and can find the globally optimal assignment in bipartite graph matching problems.67% similarUnverifiedIn actual production, hybrid retrieval combining both vector similarity and keyword matching is typically used.66% similarPartially VerifiedTRE支持近似匹配（approximate matching），可以在允许一定编辑距离的情况下进行模糊匹配65% similarUnverified可通过随机交换候选顺序并同步调整标签来缓解位置偏差62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/784276API
curl https://kongchang.com/api/v1/knowledge/claims/784276MCP
get_claim(id=784276)