Relevance ranking for proximity full-text search based on additional indexes with multi-component keys
The problem of proximity full-text search is considered. If a search query contains high-frequently occurring words, then multi-component key indexes deliver an improvement in the search speed compared with ordinary inverted indexes. It was shown that we can increase the search speed by up to 130 times in cases when queries consist of high-frequently occurring words. In this paper, we investigate how the multi-component key index architecture affects the quality of the search. We consider several well-known methods of relevance ranking, where these methods are of different authors. Using these methods, we perform the search in the ordinary inverted index and then in an index enhanced with multi-component key indexes. The results show that with multi-component key indexes we obtain search results that are very close, in terms of relevance ranking, to the search results that are obtained by means of ordinary inverted indexes.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Proximity Full-Text Search with a Response Time Guarantee by Means of Additional Indexes
Full-text search engines are important tools for information retrieval. Term proximity is an important factor in relevance score measurement. In a proximity full-text search, we assume that a relevant document contains q…
Information RetrievalRetrievalDeepRank: A New Deep Architecture for Relevance Ranking in Information Retrieval
This paper concerns a deep learning approach to relevance ranking in information retrieval (IR). Existing deep IR models such as DSSM and CDSSM directly apply neural networks to generate ranking scores, without explicit …
Deep LearningInformation RetrievalRetrievalLearning Visual Features from Snapshots for Web Search
When applying learning to rank algorithms to Web search, a large number of features are usually designed to capture the relevance signals. Most of these features are computed based on the extracted textual elements, link…
Learning-To-RankRetrievalA Short Note on Proximity-based Scoring of Documents with Multiple Fields
The BM25 ranking function is one of the most well known query relevance document scoring functions and many variations of it are proposed. The BM25F function is one of its adaptations designed for modeling documents with…
Less is Less: When Are Snippets Insufficient for Human vs Machine Relevance Estimation?
Traditional information retrieval (IR) ranking models process the full text of documents. Newer models based on Transformers, however, would incur a high computational cost when processing long texts, so typically use on…
Information RetrievalRetrieval