The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Dynamic User-Defined Similarity Searching in Semi-Structured Text Retrieval
[article]
2007
arXiv
pre-print
Modern text retrieval systems often provide a similarity search utility, that allows the user to find efficiently a fixed number k of documents in the data set that are most similar to a given query (here a query is either a simple sequence of keywords or the identifier of a full document found in previous searches that is considered of interest). We consider the case of a textual database made of semi-structured documents. Each field, in turns, is modelled with a specific vector space. The
arXiv:0705.4606v1
fatcat:lidka3yvg5c23cpctih5piuf2u