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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.