Image analysis – Pattern recognition – Context analysis or word recognition
Reexamination Certificate
2005-04-28
2009-06-16
Wu, Jingge (Department: 2624)
Image analysis
Pattern recognition
Context analysis or word recognition
C341S051000
Reexamination Certificate
active
07548652
ABSTRACT:
A comparison routine for comparing two data strings includes pre-processing, copying letters and digits into local buffers, comparing the contents of the local buffers using a left-to-right, walk-forward scanning algorithm, including selecting a first item from each buffer and comparing them and, if the two first items are the same, advancing to the next two items from each buffer, continuing with the comparison of subsequent buffer items until all pairs of items have been compared as long as no mismatch of items is found, and when a mismatch is encountered, the algorithm looks ahead in the data strings, searching for an identifiable pattern. A pair of independent search pointers are initially set to a first character in each data buffer and adjusted if a matching character pattern is found. A processing loop sequentially tests for a number of character patterns. If a matching character pattern is found, the match is scored, incrementing the score by one point for each matching character pattern that is found. If none of the character patterns is found, or the end of either string is reached, the processing loop is exited and the scoring data is collected.
REFERENCES:
patent: 4471459 (1984-09-01), Dickinson et al.
patent: 4674066 (1987-06-01), Kucera
patent: 4876541 (1989-10-01), Storer
patent: 5819291 (1998-10-01), Haimowitz et al.
patent: 6675171 (2004-01-01), Tikkanen et al.
patent: 2003/0033501 (2003-02-01), Cooke et al.
Cormode, Graham and Muthukrishnan, S., “The String Edit Distance Matching Problem with Moves”, http://dimacs.rutgers.edu/˜graham/pubs/editmoves.pdf, no date, pp. 10.
Yang, Qi Xiao, Yuan, Sung Sam, Chun, Lu, Zhao, Li, Peng, Sun, “Faster Algorithm of String Comparison”, http://arvix.org/abs/cs.DS/0112022, Dec. 25, 2001, p. 1.
Hyyrö, Heikki, “A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances”, Department of Computer and Information Sciences, Prague Stringology conference (PSC'02), Sep. 23-24, 2002, pp. 1-11.
Kukich, Karen, “Techniques for Automatically Correcting Words in Text”, ACM Computing Surveys, vol. 24, No. 4, Dec. 1992, pp. 377-439.
Hauben, Michael and Hauben, Ronda, “On the Early History and Impact of Unix Tools to Build the Tools for a New Millenium”, Netizens: On the History and Impact of Usenet and the Internet, Chapter 9, http://www/people.fas.harvard.edu/˜lib113/reference/unix/unix9.txt, Jun. 17, 1996, pp. 30.
Akhavannik Hadi
Lembke Kent A.
Marsh & Fischmann & Breyfogle LLP
Meza Peter
Sun Microsystems Inc.
LandOfFree
Rapid comparison of similar data strings does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Rapid comparison of similar data strings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rapid comparison of similar data strings will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4141728