{"work":{"id":"9b92b7f5-416c-4ef4-ad82-5d8dc04626cd","openalex_id":"https://openalex.org/W2937036051","doi":"10.48550/arxiv.1904.08375","arxiv_id":"1904.08375","raw_key":null,"title":"Document Expansion by Query Prediction","authors":null,"authors_text":"Rodrigo Nogueira, Wei Yang, Jimmy Lin, and Kyunghyun Cho","year":2019,"venue":"cs.IR","abstract":"One technique to improve the retrieval effectiveness of a search engine is to expand documents with terms that are related or representative of the documents' content.From the perspective of a question answering system, this might comprise questions the document can potentially answer. Following this observation, we propose a simple method that predicts which queries will be issued for a given document and then expands it with those predictions with a vanilla sequence-to-sequence model, trained using datasets consisting of pairs of query and relevant documents. By combining our method with a highly-effective re-ranking component, we achieve the state of the art in two retrieval tasks. In a latency-critical regime, retrieval results alone (without re-ranking) approach the effectiveness of more computationally expensive neural re-rankers but are much faster.","external_url":"https://arxiv.org/abs/1904.08375","cited_by_count":210,"metadata_source":"pith","metadata_fetched_at":"2026-08-05T02:28:24.338817+00:00","pith_arxiv_id":"1904.08375","created_at":"2026-05-10T16:00:34.350914+00:00","updated_at":"2026-08-05T02:28:24.338817+00:00","title_quality_ok":true,"display_title":"Document expansion by query prediction.arXiv preprint arXiv:1904.08375","render_title":"Document expansion by query prediction.arXiv preprint arXiv:1904.08375"},"hub":{"state":{"work_id":"9b92b7f5-416c-4ef4-ad82-5d8dc04626cd","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":20,"external_cited_by_count":210,"distinct_field_count":3,"first_pith_cited_at":"2019-07-10T10:56:08+00:00","last_pith_cited_at":"2026-06-29T15:33:04+00:00","author_build_status":"not_needed","summary_status":"needed","contexts_status":"needed","graph_status":"needed","ask_index_status":"not_needed","reader_status":"not_needed","recognition_status":"not_needed","updated_at":"2026-08-23T22:59:37.095876+00:00","tier_text":"hub"},"tier":"hub","role_counts":[{"context_role":"background","n":2}],"polarity_counts":[{"context_polarity":"background","n":2}],"runs":{},"summary":{},"graph":{},"authors":[]}}