lucene中的模糊搜索复杂度

Fuzzy search complexity in lucene

我正在使用 lucene 4.10.4。

谁能解释一下模糊搜索的工作原理?与普通搜索相比,搜索时间增加了多少?

从 Lucene 4 开始,通过使用 Fast string correction with Levenshtein automata paper

更有效地实现了模糊搜索

To make a very long story short this paper shows how to recognize the set of all words V in an index where the Levenshtein distance between V and the query does not exceed a distance d, which is exactly what one wants with Fuzzy Search.

当然,它仍然会比直接查找更慢,您将对具体术语进行查找,但它不再是性能杀手。