Block addressing indices for approximate text retrieval
- 1 January 1997
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
The issue of reducing the space overhead when indexing large text databases is becomingmore and more important, as the text collections grow in size. Another subject, which is gainingimportance as text databases grow and get more heterogeneous and error prone, is that of flexiblestring matching. One of the best tools to make the search more flexible is to allow a limitednumber of differences between the words found and those sought. This is called "approximatetext searching", which is ...Keywords
This publication has 2 references indexed in Scilit:
- Overview of the third text Retrieval conference (TREC-3)Published by National Institute of Standards and Technology (NIST) ,1995
- A very fast substring search algorithmCommunications of the ACM, 1990