按年被提到
20102015 · 2 次2026
算法与数据结构›哈希、压缩与向量化·arXiv:1008.1191 · cs.IR

Improved Fast Similarity Search in Dictionaries

Daniel Karch, Dennis Luxen, Peter Sanders · 2010
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2015-06-10 · 最近 2022-03-06
2不同的人
3活跃月份
4讨论串
0被引(OpenAlex)
arXiv 摘要(候选层不写导读)

We engineer an algorithm to solve the approximate dictionary matching problem. Given a list of words $\mathcal{W}$, maximum distance $d$ fixed at preprocessing time and a query word $q$, we would like to retrieve all words from $\mathcal{W}$ that can be transformed into $q$ with $d$ or less edit operations. We present data structures that support fault tolerant queries by generating an index. On top of that, we present a generalization of the method that eases memory consumption and preprocessing time significantly. At the same time, running times of queries are virtually unaffected. We are able to match in lists of hundreds of thousands of words and beyond within microseconds for reasonable distances.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论lorenzhs · 2015-06

“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. If you w…”

Levenshtein Automata (2010)原评论 ↗
评论lorenzhs · 2015-06

“It's already been answered why this isn't a good idea, but there is a working approach that works similarly: instead of all words within Levenshtein distance N, you store all words with exactly N characters deleted from them. So for each word in your dictionary, store all words that can appear when you delete N characters. That's a much more reasonable nu…”

Levenshtein automata can be simple and fast原评论 ↗
评论lorenzhs · 2016-10

“There is a variety of approximate string matching algorithms that speed up search by using an index. https://arxiv.org/abs/1008.1191 is one that should be fairly easy to implement. Levenshtein automata are another approach that makes the rounds on HN every now and then, but are a tough beast to implement and I wouldn't really recommend them in practice.”

Dictionary of Algorithms and Data Structures (1998)原评论 ↗
评论LordGrey · 2022-03

“What they are calling "Symmetric Delete" seems to be the same as an older concept called "deletion neighborhoods". It is a term coined in an academic paper written by Thomas Bocek, Ela Hunt, and Burkhard Stiller from the University of Zurich, titled "Fast Similarity Search in Large Dictionaries"[1]. The work described there was expanded in a paper written…”

SymSpell: 1M times faster spelling correction原评论 ↗