Unverified50% confidenceFactExact time
对于长度为 n 的查询词和编辑距离 k，Levenshtein 自动机的状态数约为 O(n×(2k+1)^k)，随 k 增大呈指数级上升
1
Sources
50%
Confidence
Long-term
Relevance
8/11/2026
First Seen
Sources
Related Claims
Unverified精确的 K 近邻搜索（KNN）时间复杂度为 O(n×d)，在数百万级别记忆条目下延迟不可接受，ANN 算法通过牺牲极小精度换取数量级速度提升67% similarUnverifiedUkkonen 的对角线剪枝可将编辑距离计算的平均复杂度降至 O(k×min(m,n))，其中 k 为编辑距离阈值65% similarUnverified使用 Levenshtein 自动机判断候选词是否接受的时间复杂度仅与候选词长度线性相关（O(n)），无需重新计算编辑距离矩阵63% similarUnverifiedThe computational complexity of EKF-SLAM is O(n²) because the dimensions of the covariance matrix grow linearly with the number of landmarks63% similarUnverifiedDuring the autoregressive generation phase, generating each new token requires recalculating attention over all historical tokens, with computational complexity growing as O(n²) with sequence length; KV Cache can reduce this to O(n) incremental operations.61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/731177API
curl https://kongchang.com/api/v1/knowledge/claims/731177MCP
get_claim(id=731177)