Unverified50% confidenceConceptExact time
The Aho-Corasick algorithm is a multi-pattern string matching algorithm that can detect a large number of keywords simultaneously in a single scan, with time complexity approximately linear in the text length and the number of patterns.
1
Sources
50%
Confidence
Long-term
Relevance
10/17/2026
First Seen
Sources
Related Entities
Related Claims
Unverified大模型能识别代码模式而非仅代码字面，即便变量名被混淆，只要算法骨架与已知算法匹配便能还原语义67% similarUnverifiedDeterministic lexical scanning is string-level matching of text based on a fixed rule set, where the same input always yields the same judgment result and no model sampling randomness is involved.66% similarUnverified语义检索技术通过嵌入模型将Skill描述文本转化为高维向量存入向量数据库，通过余弦相似度等算法检索最匹配的技能66% similarUnverifiedA cross-encoder concatenates the query and document into a single sequence for joint encoding via full attention mechanisms, offering high accuracy but with O(n) computational complexity, making it suitable only for re-ranking the top-K results (typically 20–100 items) from initial retrieval.65% similarUnverifiedCombining perplexity, burstiness, and word-frequency anomaly analysis significantly improves AI text detection accuracy compared to any single method.65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1052008API
curl https://kongchang.com/api/v1/knowledge/claims/1052008MCP
get_claim(id=1052008)