A scaleable technique for best-match retrieval of sequential information using metrics-guided search
Author:
- 1 February 1994
- journal article
- research article
- Published by SAGE Publications in Journal of Information Science
- Vol. 20 (1) , 16-28
Abstract
A new technique is described for retrieving infor mation by finding the best match or matches between a textual 'query' and a textual database. The technique uses principles of beam search with a measure of probability to guide the search and prune the search tree. Unlike many methods for comparing strings, the method gives a set of alternative matches, graded by the 'quality' of the matching achieved.Keywords
This publication has 24 references indexed in Scilit:
- PRISMA/DB: a parallel, main memory relational DBMSIEEE Transactions on Knowledge and Data Engineering, 1992
- Network design for the implementation of text searching using a multicomputerInformation Processing & Management, 1991
- Exploiting parallelism in pattern matchingACM Transactions on Information Systems, 1991
- Prototyping Bubba, a highly parallel database systemIEEE Transactions on Knowledge and Data Engineering, 1990
- Efficiency of text scanning in bibliographic databases using microprocessor-based, multiprocessor networksJournal of Information Science, 1988
- Pattern matching methods in protein sequence comparison and structure predictionProtein Engineering, Design and Selection, 1988
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974