Unverified50% confidenceFactExact time
A 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.
1
Sources
50%
Confidence
Long-term
Relevance
8/11/2026
First Seen
Sources
Related Claims
UnverifiedLevenshtein 自动机是一种有限状态自动机，对给定查询词和最大编辑距离 k，能识别所有与查询词编辑距离不超过 k 的字符串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.63% similarUnverifiedRAG 框架将稠密段落检索（Dense Passage Retrieval, DPR）与生成式语言模型结合58% similarUnverifiedDXF的高度结构化确定性语法使大模型可以像生成代码一样生成DXF内容，这是AI在结构化输出任务上优于开放式创作的原因56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/732509API
curl https://kongchang.com/api/v1/knowledge/claims/732509MCP
get_claim(id=732509)