Effectiveness of an implementation method for retrieving similar strings by trie structures

Authors:
Masao Fuketa;Toshiyuki Tamai;Kazuhiro Morita;Jun-ichi Aoe
Affiliations:
Department of Information Science and Intelligent Systems, University of Tokushima, Tokushima, 2-1 Minami Josanjima Tokushima-shi, 770-8506, Japan;Department of Information Science and Intelligent Systems, University of Tokushima, Tokushima, 2-1 Minami Josanjima Tokushima-shi, 770-8506, Japan;Department of Information Science and Intelligent Systems, University of Tokushima, Tokushima, 2-1 Minami Josanjima Tokushima-shi, 770-8506, Japan;Department of Information Science and Intelligent Systems, University of Tokushima, Tokushima, 2-1 Minami Josanjima Tokushima-shi, 770-8506, Japan
Venue:
International Journal of Computer Applications in Technology
Year:
2013

Citing 10
Cited 0

An Efficient Digital Search Algorithm by Using a Double-Array Structure

IEEE Transactions on Software Engineering
Introduction to algorithms

Introduction to algorithms
Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction

Computational Linguistics
A guided tour to approximate string matching

ACM Computing Surveys (CSUR)
Computer Algorithms: Key Search Strategies

Computer Algorithms: Key Search Strategies
Computation of Normalized Edit Distance and Applications

IEEE Transactions on Pattern Analysis and Machine Intelligence
Space-efficient static trees and graphs

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Structural optimization of a full-text n-gram index using relational normalization

The VLDB Journal — The International Journal on Very Large Data Bases
A fast search method of similar strings from dictionaries

International Journal of Computer Applications in Technology
Filtering obfuscated email spam by means of phonetic string matching

ECIR'06 Proceedings of the 28th European conference on Advances in Information Retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

Demands for retrieving similar strings have been increasing. There are many methods for retrieving similar strings, and most methods must build dedicated dictionaries. In ubiquitous environments, because the storage capacity is often limited, the dictionary size must be compact. Therefore, this paper proposes a data structure and a fast retrieval algorithm for similar strings by existing tries. Moreover, the retrieval speed for some implementation methods of a trie is compared. From experimental results, the retrieval speed of the proposed method is 2.6-3.5 times faster than that of the conventional method. The retrieval speed of list structures as an implementation method is the fastest.