好的部分优先--一种新的词汇和字符串数据库近似搜索算法
Good parts first - a new algorithm for approximate search in lexica and string databases
摘要：
提出了一种新的有效的电子词典近似搜索方法。给定一个输入字符串（模式）和一个相似性阈值，该算法检索词典中与该模式足够相似的所有条目。搜索是以子搜索的形式组织的，这些子搜索总是从精确的部分匹配开始，其中输入模式的子串与词典单词的子串对齐。之后，这种部分匹配逐步扩展到更大的子串。为了将模式的其它部分与词典条目的对应部分对齐，在每个后续步骤中容许更多的错误。为了支持这种可以在模式的任何部分开始的对齐顺序，词典被表示为能够立即访问词典单词的任何子串并允许在两个方向上扩展这样的子串的结构。近似搜索过程的实验评估显示显着的效率提高相比，现有的技术。由于该技术可以用于大的误差范围，它提供了有趣的可能性，近似搜索的特殊集合的“长”字符串，如短语，句子，或书籍，
英文摘要：
We present a new efficient method for approximate search in electronic lexica. Given an input string (the pattern) and a similarity threshold, the algorithm retrieves all entries of the lexicon that are sufficiently similar to the pattern. Search is organized in subsearches that always start with an exact partial match where a substring of the input pattern is aligned with a substring of a lexicon word. Afterwards this partial match is extended stepwise to larger substrings. For aligning further parts of the pattern with corresponding parts of lexicon entries, more errors are tolerated at each subsequent step. For supporting this alignment order, which may start at any part of the pattern, the lexicon is represented as a structure that enables immediate access to any substring of a lexicon word and permits the extension of such substrings in both directions. Experimental evaluations of the approximate search procedure are given that show significant efficiency improvements compared to existing techniques. Since the technique can be used for large error bounds it offers interesting possibilities for approximate search in special collections of "long" strings, such as phrases, sentences, or book ti
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
