Unverified50% confidenceFactExact time
WER calculation is based on the edit distance (Levenshtein distance) algorithm, which uses dynamic programming to find the optimal alignment path between the reference text and the hypothesis text.
1
Sources
50%
Confidence
Long-term
Relevance
8/7/2026
First Seen
Sources
语码转换ASR评测：WER为何失灵及替代方案
Related Claims
Unverified嵌入模型采用双塔（Bi-encoder）架构，将查询和文档独立编码成向量，然后通过余弦相似度等方式计算距离66% similarUnverifiedEdit distance (Levenshtein distance) measures the minimum number of single-character edit operations required to transform one string into another.64% similarUnverifiedA Levenshtein automaton is essentially a DFA that can recognize all strings whose edit distance from the query term does not exceed k, with a time complexity of O(n) for determining a candidate word, linear in the length of the candidate word.63% similarUnverifiedLevenshtein 自动机是一种有限状态自动机，对给定查询词和最大编辑距离 k，能识别所有与查询词编辑距离不超过 k 的字符串62% similarUnverified学术界正在探索基于语义嵌入的相似度检测方案，将文本映射到高维向量空间后计算语义距离以识别AI改写后的内容同源性，但大规模实时部署的计算成本仍是挑战58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/705576API
curl https://kongchang.com/api/v1/knowledge/claims/705576MCP
get_claim(id=705576)