DocumentCode :
2682522
Title :
A two-phase method of approximate string match
Author :
Wang, Yi ; Xu, Yang ; Xu, ZhenMing
Author_Institution :
Intelligent Control Dev. Center, Southwest Jiaotong Univ., Chengdu, China
Volume :
4
fYear :
2004
fDate :
10-13 Oct. 2004
Firstpage :
3371
Abstract :
Approximate string match (ASM) is the key technique in text correction and some kinds of information retrieval application. The major problem in ASM is the efficiency of the process to find the similar words in a large vocabulary. This paper proposed a two phase method to improve the entire efficiency of ASM. A given string can be located at a point in a multidimensional word space that is organized by the feature vector of words, and then its neighbors are to be compared with the given string more accurately to get the final candidate list. Experiments have been conducted and the results show that the proposed algorithm can effectively improve the entire efficiency of approximate string match.
Keywords :
information retrieval; string matching; vocabulary; word processing; approximate string match; information retrieval; multidimensional word space; text correction; vocabulary; DNA; Error correction; Fuzzy sets; Information processing; Information retrieval; Intelligent control; Optical character recognition software; Pattern matching; Spatial databases; Vocabulary;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems, Man and Cybernetics, 2004 IEEE International Conference on
ISSN :
1062-922X
Print_ISBN :
0-7803-8566-7
Type :
conf
DOI :
10.1109/ICSMC.2004.1400863
Filename :
1400863
Link To Document :
بازگشت