Unverified50% confidenceFactExact time
Levenshtein 自动机是一种有限状态自动机，对给定查询词和最大编辑距离 k，能识别所有与查询词编辑距离不超过 k 的字符串
1
Sources
50%
Confidence
Long-term
Relevance
8/11/2026
First Seen
Sources
Related Claims
UnverifiedA 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.78% similarUnverifiedWER 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.62% similarUnverifiedEdit distance (Levenshtein distance) measures the minimum number of single-character edit operations required to transform one string into another.58% similarUnverifiedA token is the smallest semantic unit segmented by subword tokenization algorithms such as BPE, and is not simply equivalent to a single character or word.58% similarVerifiedToken是大语言模型处理文本的基本计量单位，由BPE（字节对编码）等分词算法生成56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/731173API
curl https://kongchang.com/api/v1/knowledge/claims/731173MCP
get_claim(id=731173)