Self-supervised query reformulation for code search

Y Mao, C Wan, Y Jiang, X Gu - Proceedings of the 31st ACM Joint …, 2023 - dl.acm.org
Automatic query reformulation is a widely utilized technology for enriching user
requirements and enhancing the outcomes of code search. It can be conceptualized as a …

Query Refinement into Information Retrieval Systems: An Overview

M Mosbah - Journal of Information and Organizational Sciences, 2023 - hrcak.srce.hr
Sažetak Query, expressing the user need and requirement, has an important role, in an
information retrieval system, for reaching a high accuracy search. In this paper, we present …

Boosting legal case retrieval by query content selection with large language models

Y Zhou, H Huang, Z Wu - Proceedings of the Annual International ACM …, 2023 - dl.acm.org
Legal case retrieval, which aims to retrieve relevant cases to a given query case, benefits
judgment justice and attracts increasing attention. Unlike generic retrieval queries, legal …

Towards better entity linking with multi-view enhanced distillation

Y Liu, Y Tian, J Lian, X Wang, Y Cao, F Fang… - arXiv preprint arXiv …, 2023 - arxiv.org
Dense retrieval is widely used for entity linking to retrieve entities from large-scale
knowledge bases. Mainstream techniques are based on a dual-encoder framework, which …

Robust Training for Conversational Question Answering Models with Reinforced Reformulation Generation

M Kaiser, R Saha Roy, G Weikum - … on Web Search and Data Mining, 2024 - dl.acm.org
Models for conversational question answering (ConvQA) over knowledge graphs (KGs) are
usually trained and tested on benchmarks of gold QA pairs. This implies that training is …

Automatic Query Generation Based on Adaptive Naked Mole-Rate Algorithm

M Kinikar, B Saleena - Multimedia Tools and Applications, 2024 - Springer
In the growing information retrieval (IR) world, selecting suitable keywords and generating
queries is important for effective retrieval. Modern database applications need a …

Pretraining De-Biased Language Model with Large-scale Click Logs for Document Ranking

X Li, X Chen, K Wei, B Hu, L Jiang, Z Huang… - arXiv preprint arXiv …, 2023 - arxiv.org
Pre-trained language models have achieved great success in various large-scale
information retrieval tasks. However, most of pretraining tasks are based on counterfeit …

Learning to Jointly Transform and Rank Difficult Queries

A Bigdeli, N Arabzadeh, E Bagheri - European Conference on Information …, 2024 - Springer
Recent empirical studies have shown that while neural rankers exhibit increasingly higher
retrieval effectiveness on tasks such as ad hoc retrieval, these improved performances are …

Automatic Synonym Extraction and Context-based Query Reformulation for Points-of-Interest Search

P Li - 2023 IEEE 39th International Conference on Data …, 2023 - ieeexplore.ieee.org
In modern search engines, synonyms are widely used for query reformulation to improve
search recall and relevance. The search query is reformulated based on the synonymous …

HIAE: Hyper-Relational Interaction Aware Embedding for Link Prediction

L Li, P Yuan, Y Wang, J Li - 2022 IEEE 34th International …, 2022 - ieeexplore.ieee.org
Hyper-relational knowledge graph contains the main triple and additional information
(qualifiers). The additional information can assist the main triple to predict missing entities …