Matching engine for querying relevant documents

Details Matching engine for querying relevant documents Matching engine for querying relevant documents

2006-02-24

2010-06-29

Wassum, Luke S (Department: 2167)

Data processing: database and file management or data structures

Database and file access

Record, file, and data search and comparisons

C707S917000

Reexamination Certificate

active

07747642

ABSTRACT:
A system generates an output of documents having with a particular relevance range. The system receives an initial document comprising text, a list of documents for matching, each document comprising text, and a minimum substring match length. The system normalizes the text of the documents of the list of documents. The system searches common sub-strings between the text of the initial document and the text of each document of the list of documents. The system calculates a match percentage based on the search common sub-strings and outputs documents having a match percentage corresponding to a predetermined value. Also disclosed is a process for generating an output of documents within a particular relevance range.

REFERENCES:
patent: 5325091 (1994-06-01), Kaplan et al.
patent: 6493709 (2002-12-01), Aiken
patent: 6584470 (2003-06-01), Veale
patent: 7031972 (2006-04-01), Ren et al.
patent: 2003/0158725 (2003-08-01), Woods
patent: 2003/0172066 (2003-09-01), Cooper et al.
patent: 2006/0149820 (2006-07-01), Rajan et al.
Chang, W.I. and E.L. Lawler “Approximate String Matching in Sublinear Expected Time”, Proceedings of the 31stAnnual Symposium on Foundations of Computer Science, Oct. 22-24, 1990, pp. 116-124.
Monostori, K., A. Zaslavsky and H. Schmidt “Parallel and Distributed Document Overlap Detection on the Web”, In Applied Parallel Computing: New Paradigms for HPC in Industry and Academia, Lecture Notes in Computer Science, vol. 1947, 2001, pp. 206-214.
Aho, A.V., J.E. Hopcroft and J.D. Ullman “Data Structures and Algorithms”, Reading:Addison-Wesley Publishing Company, Mar. 1985, pp. 368-371. QA76.9.D35A38. ISBN 0-201-00023-7.
Manber, U. and G. Myers “Suffix Arrays: A New Method for On-Line Searches”, Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 319-327.
Chang, W.I. and E.L. Lawler “Sublinear Approximate String Matching and Biological Applications”, Algorithmica, vol. 12, 1994, pp. 327-344.
Ukkonen, E. “On-Line Construction of Suffix Trees”, Algorithmica, vol. 14, 1995, pp. 249-260.
Monostori, K., A. Zaslavsky and H. Schmidt “Parallel Overlap and Similarity Detection in Semi-Structured Document Collections”, Proceedings of the 6th Annual Australasian Conference on Parallel and Real-Time Systems (PART '99), 1999.
Shivakumar, A. and H. Garcia-Molina “Building a Scalable and Accurate Copy Detection Mechanism”, Proceedings of the 1st ACM International Conference on Digital Libraries (DL '96), 1996, pp. 160-168.
Monostori, K., A. Zaslavsky and H. Schmidt “MatchDetectReveal: Finding Overlapping and Similar Digital Documents”, in M. Khosrow-Pour (ed.), Challenges of Information Technology Management in the 21st Century, May 21-24, 2000.
Takabayashi, S. “A Brief Introduction to Suffix Array”, downloaded from sary.sourceforge.net/docs/suffix-array.html, Nov. 14, 2000.
University of Auckland “Hash Tables”, downloaded from www.cs.auckland.ac.nz/software/AlgAnim
iemann/s—has.htm, Aug. 18, 2004.
Anagnostopoulos, A. et al., “Sampling Search-Engine Results,” Proceedings of the 14thInternational Conference on World Wide Web. WWW 2005. May 10-14, 2005, pp. 245-256, Chiba, Japan.
Chen, J. et al., “Knowledge Discovery and Data Mining Based on Power Plant Real-Time Database: A Survey,” Proceedings of International Conference on Power Engineering, Oct. 8-12, 2001, pp. 1-5, Xi'an, China.
Chen, L. et al., “Template Detection for Large Scale Search Engines,” SAC '06. Apr. 23-27, 2006, 5 pages, Dijon, France.
Hamilton, N., “The Mechanics of a Deep Net Metasearch Engine,” Proceedings of the 12thInternational World Wide Web Conference, 2003, 2 pages.
Jessop, M. et al., “Pattern Matching Against Distributed Datasets,” 6 pages.
Lai, W. C. et al., “An Anatomy of a Large-Scale Image Search Engine,” IEEE MSE, Dec. 2002, 4 pages, Irvine.
Lavrenko, V. et al., “Relevance Models for Topic Detection and Tracking,” 6 pages.
Pallickara, S. et al., “Incorporating an XML Matching Engine in Distributed Brokering Systems,” Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, (PDPTA '03), 2003, pp. 1-7.
PCT International Search Report and Written Opinion, PCT/US06/17846, Oct. 18, 2006, 11 Pages.

Affiliated with

Also associated with

Rating

Matching engine for querying relevant documents does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Matching engine for querying relevant documents, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Matching engine for querying relevant documents will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4208801