A fast search method of similar strings from dictionaries. (29th July 2011)

• Record Type: Journal Article
• Authors: Fuketa, Masao; Atlam, El-Sayed; Fujisawa, Nobuo; Hanafusa, Hiroshi; Morita, Kazuhiro; Aoe, Jun-ichi
• Is Part Of: International journal of computer applications technology. Volume 40:Number 4(2011)
• Page Start: 265
• Page End: 272
• Publication Date: 2011-07-29
• Subjects: edit distance -- similar strings -- N-gram -- substrings -- dictionaries -- information retrieval; Technology -- Data processing -- Periodicals; 620.00285
• Languages: English
• ISSNs: 0952-8091

Abstract

The World Wide Web is growing ever more rapidly, and there are benefits from rich information. Moreover, demands for retrieving similar strings to an input string from dictionaries have been increasing. The edit distance is necessary to retrieve information from a large amount of data using the similarity between two strings. However, drawback of this method is time consumption because the input string must be compared with all strings in dictionaries. This study proposes a new technique for retrieving similar strings from dictionaries at high speed. The method presented can retrieve all similar strings 14 times faster than unigram methods although the edit distance is 3.