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 ...
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 ...
Bibliographic details on Text Retrieval by Using k-word Proximity Search.
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 ...
Oct 22, 2024 · In this paper, we propose two algorithms for finding documents in which all given keywords appear in neighboring places. One is based on plane- ...
A new algorithm for k-word ordered proximity search in a document is presented, which runs in O(nlogk) time per document where n is the number of words ...
Abstract. Proximity full-text search is commonly implemented in con- temporary full-text search systems. Let us assume that the search query.
More specifically, we enhanced highly-scalable. Boolean retrieval with k-word proximity ranking. Additionally, we introduce an access control in our search ...