TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Levenshtein Automata (2010)

61 点作者 beau将近 10 年前

3 条评论

lorenzhs将近 10 年前
Levenshtein automata seem to pop up on here every once in a while. They are quite interesting from a theory perspective, but (like many things devised by the theory community) incredibly complex in practice. Lucene 4.0 uses them for fuzzy queries, you can read the full story of how they struggled to get them working somewhere in the Lucene blog.<p>If you want to implement fuzzy string matching, I would look at something like <a href="http:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;1008.1191" rel="nofollow">http:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;1008.1191</a> . The experiments look impressively fast.
评论 #9696423 未加载
评论 #9698191 未加载
评论 #9698475 未加载
billwashere将近 10 年前
I suggest everyone check out the rest of the algorithms on that site. They are cool. <a href="http:&#x2F;&#x2F;blog.notdot.net&#x2F;tag&#x2F;damn-cool-algorithms" rel="nofollow">http:&#x2F;&#x2F;blog.notdot.net&#x2F;tag&#x2F;damn-cool-algorithms</a>
unhammer将近 10 年前
and in ocaml: <a href="https:&#x2F;&#x2F;github.com&#x2F;c-cube&#x2F;spelll&#x2F;blob&#x2F;master&#x2F;spelll.ml#L124" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;c-cube&#x2F;spelll&#x2F;blob&#x2F;master&#x2F;spelll.ml#L124</a>