We propose two algorithms for finding documents in which all given keywords appear in neighboring places. One is based on the plane-sweep algorithm and the ...
In this paper, we propose two algorithms for finding documents in which all given keywords appear in neighboring places.
Text retrieval by using k-word proximity search - ResearchGate
www.researchgate.net › ... › Retrieval
In this paper, we propose two algorithms for finding documents in which all given keywords appear in neighboring places. One is based on plane-sweep algorithm ...
This work proposes two algorithms for finding documents in which all given keywords appear in neighboring places, one based on the plane-sweep algorithm and ...
It is therefore effective to rank documents according to proximity of keywords in the documents. This ranking is regarded as a kind of text data mining. In this ...
Kunihiko Sadakane, Hiroshi Imai: Text Retrieval by Using k-word Proximity Search. DANTE 1999: 183-188. a service of Schloss Dagstuhl - Leibniz Center for ...
Sep 9, 2001 · We consider that keywords which appear in the neighbor- hood in a document are related. Therefore we use not documents but positions of keywords ...
Text Retrieval by Using k-word Proximity Search.
Sep 6, 2020 · In a proximity full-text search, we want to find documents that contain these words near each other. This task requires much time when the ...
We showed in previous works that these indexes can be used to improve the aver- age query execution time by up to 130 times for queries that consist of words ...