Fast Algorithms for Top-k Approximate String Matching

• DOI: 10.1609/aaai.v24i1.7527
• Publication Date: 2022-09-13T05:18:59Z
• Authors: Zhenglu Yang; Jianjun Yu; Masaru Kitsuregawa
• Keywords: 0202 electrical engineering, electronic engineering, information engineering; 02 engineering and technology

Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of problem increased dramatically because prevalence Web. In this paper, we aim to explore efficient top-k similar matching problem. Several strategies are introduced, such as length aware adaptive q-gram selection. We present a general based framework propose two algorithms introduced. Our techniques experimentally evaluated three real sets show superior performance.