Method and system for approximate string matching

Details Method and system for approximate string matching Method and system for approximate string matching

2005-06-16

2010-10-05

Ali, Mohammad (Department: 2158)

Data processing: database and file management or data structures

Database and file access

Record, file, and data search and comparisons

C707S797000

Reexamination Certificate

active

07809744

ABSTRACT:
Approximate string matching of a target string to a trie data structure. The trie data structure has a root node and generations of child nodes each node representing at least one character in an alphabet to provide a lexicon of words and word fragments. The trie data structure is traversed starting from the root node by comparing each node of a branch of the trie data structure to characters in the target string and adding characters traversed in a branch of the trie data structure to a gathered string to provide suggestions of approximate matches. If a node is reached that is flagged as a node for a word or a word fragment and, if the target string is longer than the gathered string, the traversal loops back to the root node, and continues to traverse from the root node. This enables the trie data structure to use word fragments for compound words and to split non-delimited words where appropriate. A determination may be made, at each node, as to whether there is a correction rule for one or more characters in the remainder of the target string from the current node, and if so, the correction rule is applied to the target string to obtain a modified target string.

REFERENCES:
patent: 4672571 (1987-06-01), Bass et al.
patent: 4701851 (1987-10-01), Bass et al.
patent: 4777617 (1988-10-01), Frisch et al.
patent: 6018736 (2000-01-01), Gilai et al.
patent: 6026398 (2000-02-01), Brown et al.
patent: 6424983 (2002-07-01), Schabes et al.
patent: 6616704 (2003-09-01), Birman et al.
patent: 6662180 (2003-12-01), Aref et al.
patent: 7010522 (2006-03-01), Jagadish et al.
patent: 7287026 (2007-10-01), Oommen
patent: 2003/0195836 (2003-10-01), Hayes et al.
patent: WO92/14293 (2002-07-01), None
IEEE Transactions on Knowledge and Data Engineering Aug. 1996 (vol. 8, No. 4) pp. 540-547 H. Shang, T.H. Merrettal, Tries for Approximate String Matching.
Proceedings of the International Symposium on Cooperative Database Systems for Advanced Applications, Kyoto, 1996. World Scientific, 1996. T. H. Merrett, Heping Shang, Xiaoyan Zhao: Database Structures, Based on Tries, for Text, Spatial, and General Data. pp. 507-515.
R.C. Angell, G.E. Freund, and P. Willett. Automatic spelling correction using a trigram similarity measure. Information Processing and Management, 19:255-261, 1983.
IBM Research Disclosure Aug. 2002 Glushnev, N.I. Troussov, A.L. Volkov, P.V. Method and Apparatus for Performing Decomposition of an Input String Into the Concatenation of Non-Overlapping Non-Gapped Words or Word Formation Elements From Large Electronic Dictionary.

Affiliated with

Also associated with

Rating

Method and system for approximate string matching does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and system for approximate string matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for approximate string matching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4170702