<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A Product-Aware Query Auto-Completion Framework for E-Commerce Search via Retrieval-Augmented Generation Method</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Fangzheng Sun</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tianqi Zheng</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Aakash Kolekar</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Rohit Patki</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hossein Khazaei</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Xuan Guo</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ziheng Cai</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>David Liu</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ruirui Li</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yupin Huang</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dante Everaert</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hanqing Lu</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Garima Patel</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Monica Cheng</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Amazon Search</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Palo Alto</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>Query Auto-Completion (QAC) is a fundamental component of user search experience on e-commerce websites. It assists in finding user-intended products, by automatically presenting search queries as users typing in the search bar. Traditional QAC systems build upon query popularity to suggest a list of potential completions, but they fall short for unforeseen search prefixes. A generative Large Language Model (LLM) can complete even unforeseen prefixes, but relevance to the product catalog of the generated suggestions is not guaranteed. To our best knowledge, there is no existing study using LLMs to generate product-aware search query completion suggestions. This paper proposes a generative approach named "Product-RAG", to incorporate product metadata and adapt Retrieval Augmented Generation (RAG) in the development of QAC systems. Product-RAG contains two components: (1) a retrieval model that identifies top-K most relevant products from the product catalog given a user-input prefix, and (2) a generative model that ofers suggestions based on both the given prefix and the retrieved product metadata. We evaluate this approach for its ability to match user-input prefixes to user-intended products, using the metrics of ROUGE scores, Mean Reciprocal Rank (MRR) and Hit Ratio (HR) in downstream product search. We observe that the proposed Product-RAG approach outperforms state-of-the-art generative models in auto-completing e-commerce search queries.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Query Auto-Complete</kwd>
        <kwd>Retrieval-Augmented Generation</kwd>
        <kwd>E-Commerce</kwd>
        <kwd>Product-aware</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Query auto-completion (QAC) [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4 ref5">1, 2, 3, 4, 5</xref>
        ] refers to an
information retrieval system for search engines, for which,
given partial context typed by the user (i.e. prefix), it ofers
one or multiple query suggestions to the user. In modern
e-commerce, where user experience is pivotal, QAC stands
as an important feature shaping the way consumers interact
with search engines and plays a crucial role in smoothing
all the downstream shopping experiences [
        <xref ref-type="bibr" rid="ref6 ref7 ref8 ref9">6, 7, 8, 9</xref>
        ]. By
leveraging personalized signals, product-related knowledge,
and advanced recommendation algorithms, QAC not only
accelerates the search experience but also ensures that users
receive tailored suggestions based on their unique
preferences.
      </p>
      <p>
        One major challenge of QAC tasks in e-commerce is to
understand user shopping intent from an incomplete search
query, and provide them relevant auto-complete
suggestions. A typical production QAC works as follows: Given
a prefix entered by a user, the QAC system obtains a
collection of queries satisfying the prefix from query log, and
adopts a selection process, often based on forecasted
popularity, to select candidate queries to send to the query ranker
[
        <xref ref-type="bibr" rid="ref10 ref11 ref12">10, 11, 12</xref>
        ]. This framework lacks the understanding of user
shopping intent. To give more importance to users’ intents
and provide more personalized and relevant QAC
suggestions, a number of works explore the context-aware and
personalized QAC systems [
        <xref ref-type="bibr" rid="ref13 ref14 ref15 ref16 ref17">13, 14, 15, 16, 17</xref>
        ].
      </p>
      <p>
        Another challenge for QAC in e-commerce is to attain
product awareness by recognizing and predicting users’
intent related to specific products, brands, or categories and
providing auto-complete suggestions that align with the
user’s potential shopping targets. When query log falls
short for unseen or rarely seen prefixes, product
knowledge is particularly helpful to predict users’ shopping intent
and generate corresponding suggestions (e.g., in the case
of Figure 1). Nevertheless, in spite of eforts attempting
to understand user’s shopping intent with product
catalog or product attributes [
        <xref ref-type="bibr" rid="ref18 ref19">18, 19</xref>
        ], we could not find any
work bridging the gap between partially complete search
queries and product knowledge for e-commerce QAC
systems. Herein we propose a generative approach to leverage
the product knowledge in e-commerce QAC systems based
on Retrieval-Augmented Generation (RAG) Framework [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ],
namely Product-RAG, which is capable of improving the
QAC systems by providing accurate auto-completion
sug
      </p>
      <p>Generator
prefix</p>
      <p>proudcut2ct3
prpodroudct1
prompt
g
n
i
x
e
d
n
i
e
n
i
l
f
f
o</p>
      <p>prefixes
prefix encoder</p>
      <sec id="sec-1-1">
        <title>MaxSim</title>
      </sec>
      <sec id="sec-1-2">
        <title>MaxSim</title>
        <p>product encoder</p>
        <p>products
Retriever
1. 100 Things To See In The</p>
        <p>Kimberley
2. 100 Things to See in the Night</p>
        <p>Sky, Expanded Edition: Your
Illustrated Guide to the
Planets, Satellites,</p>
        <p>Constellations, and More
3. 100 Things to See in the</p>
        <p>National Parks
QAC suggestions:
1. 100 things to see in the</p>
        <p>kimberley
2. 100 things to see in the</p>
        <p>night sky
3. 100 things to see in the
national parks
gestions based on product knowledge relevant to search
prefixes. The RAG framework exhibits outstanding eficacy
in domain-specific sequence generation tasks through
exploiting the domain knowledge as additional context when
generating the target sequences. Under the RAG scheme,
generative large language models (LLMs) are supervised by
retrieved relevant information from heterogeneous and
predetermined knowledge sources, and consequently, present
accurate and controlled text output. This is a compelling
benefit for e-commerce QAC systems where relevancy of
QAC suggestions is essential for user trust. Additionally,
the RAG framework brings QAC systems great versatility
against frequently-updated information sources. This
attribute allows the utilization of the vast universal product
knowledge base into e-commerce QAC systems without
undergoing the high costs of re-training the generative model
on the giant product catalog. The superiority of the
proposed Product-RAG model is empirically demonstrated by
human-annotated e-commerce QAC tasks. We illustrate
that the proposed method could outperform state-of-the-art
generative Large Language Models (LLMs) by generating
QAC suggestions that 1) are more similar with the ground
truths and in terms of ROUGE scores, and 2) lead to more
relevant product search results in terms of Mean Reciprocal
Rank (MRR) and Hit Ratio (HR).</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>Most QAC systems work on a sourcing-and-ranking basis
they first source candidates from a large pool to limit the
scope, and then rank on the sourced candidates. This paper
focuses on the sourcing part of the QAC system, ensuring
that the sourced candidates are product-aware, before
sending them to the query ranker.</p>
      <p>
        Established approaches for sourcing candidate query
completions often rely on most popular candidate
(MPC) approach, which could not incorporate important
semantic information of prefix and session context.
Newer approaches incorporate semantic information
using neural network representations learned with
query prefix, candidate query completions, along with
session context [
        <xref ref-type="bibr" rid="ref21 ref22">21, 22</xref>
        ]. Context-aware QAC considers
users’ past queries instead of solely relying on
popularity [
        <xref ref-type="bibr" rid="ref13 ref14 ref15 ref16 ref17">13, 14, 15, 16, 17</xref>
        ]. Meanwhile, recent advances in
natural language processing [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] have inspired enormous
work on semantically understanding users’ search context
and intent. They employ a high-dimensional space to
measure the semantic similarities between search queries
in contextual representations. These methods either ofer
users more contextually relevant suggestions from query
log [
        <xref ref-type="bibr" rid="ref24 ref25 ref26 ref27">24, 25, 26, 27</xref>
        ] or generate new keywords [
        <xref ref-type="bibr" rid="ref28 ref29 ref30">28, 29, 30</xref>
        ].
Candidate sourcing approaches usually fall into one
of the three categories: retriever-only approaches, pure
generative approaches, and retrieval-augmented generation.
Retriever-only approaches. This class of approaches
are based on retrieving the candidates from a pool of
candidates that is usually built from scraping historical
logs of the QAC system. The candidates are often selected
based on popularity-based approaches such as MPC and
neural matching [
        <xref ref-type="bibr" rid="ref31 ref32 ref33">31, 32, 33</xref>
        ]. In MPC-based approaches,
candidates with higher forecasted popularity are selected;
in lexical matching approaches, candidates with higher
similarities are selected; neural matching approaches for
candidate retrieval allow selecting queries in semantic
representations [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ]. Session context [
        <xref ref-type="bibr" rid="ref17 ref21">21, 17</xref>
        ] or personal
profile signals [
        <xref ref-type="bibr" rid="ref35 ref36">35, 36</xref>
        ] could be considered as auxiliary
inputs. However, since they are limited to the existing
candidates, ofering suggestions is not guaranteed. In
addition, the achieved product-awareness is biased toward
popular candidates in the past.
      </p>
      <p>
        Generative approaches. The generative approaches
use language models to generate the candidate based on
inputs like prefix, session context, and personalization
signals[
        <xref ref-type="bibr" rid="ref37 ref38 ref39">37, 38, 39</xref>
        ]. Generative approaches can provide
candidates for prefixes fist appear. Two major challenges facing
pure generative approaches in e-commerce QAC system
development are: (1) They may sufer from hallucinations,
generating plausible queries but without a reference to
product information. (2) In a dynamic environment of
e-commerce where products changes continuously, they
lack the mechanism to automatically incorporate new
information post-training. This necessitates periodic
ifne-tuning to maintain the model’s relevance and accuracy,
which can be prohibitively costly and impractical.
Retrieval Augmented Generation (RAG). RAG
approaches [
        <xref ref-type="bibr" rid="ref20 ref40 ref41">20, 40, 41</xref>
        ], extend the capabilities of language
models by integrating external knowledge sources as
auxiliary inputs to enhance the performance of the overall
system. To our best knowledge, our work is the first study that
adapts RAG framework for QAC systems. Prior to this, RAG
has been applied to various tasks and application domains
such as question answering [
        <xref ref-type="bibr" rid="ref42">42</xref>
        ], text summarization [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
Since RAG uses product information as auxiliary inputs for
the language model during generation, and that the
product retrieval updates in response to underlying database
updates, the language model does not need to be fine-tuned
to capture new products.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Product-RAG</title>
      <p>
        Existing studies show that the RAG framework is efective
and eficient in extending the already powerful capabilities
of LLMs to specific domains without the need to retrain
the model with a heterogeneous database. The proposed
Product-RAG model is based upon the architecture of the
RAG-Sequence Model [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] to generate one suggestion for
each relevant product. The schematic architecture of the
Product-RAG model for generating product-aware query
auto-completion suggestions from relevant products is
depicted in Figure 2. Our framework leverages two
components:
1. A retrieval model  that retrieves the best-matching
product titles or catalog from product pool.
2. A generative LLM  that outputs auto-complete
suggestions for a given prefix and retrieved products
from the retriever.
      </p>
      <p>Task formulation. We denote a search prefix as  and
the target QAC suggestions as . The retriever  (Z|)
consumes a product knowledge base P and returns top-K
relevant products Z = {1, 2, ...,  },  ∈ P given the
prefix . For each  ∈ Z, the generative LLM  (|, )
generates a QAC suggestion for  with context from the
retrieved product, rendering the top-K suggestions Y =
{1, 2, ...,  }. The Product-RAG can be parameterized
as</p>
      <p>
        .
 − (Y|) =
∑︁  (|) (|, )
(1)
∈− ((·| ))
Multi-vector retrieval model. State-of-the-art methods
typically fine-tune deep pre-trained language models, such
as BERT [
        <xref ref-type="bibr" rid="ref43">43</xref>
        ], to generate dense vector representations for
both input queries and documents. The top-K documents
with the highest similarity scores are then retrieved.
Inspired by recent advances in multi-vector representations
[
        <xref ref-type="bibr" rid="ref34 ref44">34, 44</xref>
        ], we adopt a retrieval model in the proposed
approach, as depicted in Figure 2, where we fine-tune the
prefix and product encoders with e-commerce data.
      </p>
      <p>Precisely, given the representation of a prefix  and a
product , the relevance score of  to , denoted as , is
defined as the sum of maximum cosine similarity between
each vector E in prefix embedding and the vectors in a a
product bag E :</p>
      <p>, := ∑︁ max E · E ,  ∈ 
=1 ∈
(2)
Ofline product knowledge indexing. We pre-compute
all product embeddings and ofline index these vector
representations to support the eficient lookup of relevant
products. The index includes 1) centriods representing centers
partitioning product embeddings into bags, 2) residuals
storing embedding for a product and comparing to its nearest
centroid, and 3) index inversion representing an inverted
map from a centroid to products to support the fast
nearest neighbor search. They are encoded ofline and loaded
into the memory of QAC service. Given a prefix, the prefix
encoder vectorizes it and the retrieval model looks for the
top-K most relevant products through operating MaxSim
between the prefix embedding and already-loaded product
indexing in memory.</p>
      <p>
        Ofline indexing of pre-computed product embeddings
also brings convenience to refreshing the product
knowledge pool frequently with low cost and requires no efort
from re-training models to adapt to newly added products.
QAC Suggestion Generation. For the generative
component of the Product-RAG, we use a generative LLM where
the input is a prompt containing both prefix  and top-K
retrieved products  ∈ Z and the outputs are K
productaware QAC suggestions Y for the prefix. As we train the
retrieval model and the generative model separately, we can
use any state-of-the-art generative LLMs such as Mistral-7B
[
        <xref ref-type="bibr" rid="ref45">45</xref>
        ], PaLM [
        <xref ref-type="bibr" rid="ref46">46</xref>
        ], GPT-4 [
        <xref ref-type="bibr" rid="ref47">47</xref>
        ], as long as they can perform
text summarization and QAC or equivalent tasks. In our
proposed Product-RAG we empirically choose Mistral-7B
based on ofline evaluations on the performance and latency
of diferent generative LLMs in QAC tasks. Moreover, we
are able to fine-tune Mistral-7B with e-commerce search
and product data.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Experiments</title>
      <p>
        We now evaluate Product-RAG on e-commerce QAC
tasks, testing its ability to generate QAC suggestions for
a given prefix in the e-commerce domain. We define a
baseline LLM by fine-tuning the Mistral-7B model on
the e-commerce QAC database without the help of the
RAG framework. In the Product-RAG framework, we
employ the multi-vector retrieval model (denoted as
MultiVec), fine-tuned as outlined in the previous section,
as the primary retrieval component. To demonstrate the
efectiveness of our proposed retrieval method, we establish
a baseline retrieval model, BM25 [
        <xref ref-type="bibr" rid="ref48">48</xref>
        ], within the RAG
framework for comparison. The generative component for
both the Product-RAG-MultiVec and Product-RAG-BM25
frameworks is a fine-tuned Mistral-7B.
      </p>
      <p>Experimental dataset. We perform an experiment on
1,500 search queries corresponding to book products with
the help of human expert annotation: given a search prefix,
a human expert manually annotates an auto-completion
77.2
75.3
82.2
keyword as the ground truth QAC suggestion and, through
the product search page, find an available book product,
which we use as the ground truth targeting product. Thus,
each evaluation data point is composed by a triple &lt;prefix,
QAC suggestion, product&gt;. For each data point, we use
proposed models to generate top-3 suggestions based on
the prefix. For the Product-RAG models, we employ 7
million book products as product knowledge.</p>
      <p>Evaluation metrics. We evaluate the generated
suggestions in both query and product levels. We compute
1. the similarity between generated suggestions with
annotated ground truth QAC suggestions in terms
of ROUGE-1/2/L F1 scores. We use the maximum
score out of the 3 suggestions for each data point.
2. for each target product, the Mean Reciprocal Rank in
the top 10 results (MRR@10) and the Hit Ratio (target
product is included) in the top 10 results (HR@10) on
the product search page triggered by the generated
suggestions. We use the maximum MRR@10 and
HR@10 out of the 3 suggestions generated as well.
Evaluation results. We report the ROUGE-1, ROUGE-2,
ROUGE-L F-1 scores, MRR@10, and HR@10 for the 3
experimented models in Table. 1. We observe that the
proposed Product-RAG-MultiVec outperforms both baseline
generative Mistral-7B and the counterpart based on the
BM25 retrieval model, in terms of all ROUGE scores and
the 2 product-level metrics. These findings demonstrate
the supremacy of the Product-RAG-MultiVec model in
generating high-quality QAC suggestions for e-commerce
systems.</p>
      <p>Discussions. In the experiment above, we notice a
negative impact in these metrics led by the BM25 retriever
compared with baseline Mistral-7B. Inspecting the top-3
retrieved products from BM25 and those from MultiVec model,
we notice a non-trivial gap between the performance of two
retrievers: in our experiment, MultiVec model is able to
successfully retrieve the targeting product or its equivalents
in 74.7% cases (e.g., Harry Potter and the Chamber of Secrets:
Gryfindor Edition Red or its equivalent Harry Potter and the
Chamber of Secrets), whereas BM25 retriever only succeeds
in 37.1% cases. The accuracy of two retrievers explains
the performance gap between the two Product-RAG
models. This leads to a conclusion that when the retriever
provides highly-relevant products, the proposed Product-RAG
framework is capable of improving upon the state-of-the-art
generative approaches in e-commerce QAC tasks. And we
believe that improving the precision of the retriever model is
one future direction of refining the proposed Product-RAG
framework.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions</title>
      <p>In this work, we introduce Product-RAG, an RAG framework
that advances e-commerce QAC systems by identifying
relevant products to search prefix and informing product-aware
suggestions. This framework generates suggestions close to
user search intention, and it highlights product relevance
at an early stage of the shopping journey, before
downstream product searches. Through empirical experiments
on auto-completing search queries, we compare the
proposed framework with baseline LLM and we test various
retrieval models. In particular, we find that the
ProductRAG-MultiVec remarkably outperforms its counterparts in
terms of query similarity and product relevance. This work
sheds light on bridging the semantic gap between partial
search queries and product knowledge in the scenario of
e-commerce QAC systems.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Jakobsson</surname>
          </string-name>
          ,
          <article-title>Autocompletion in full text transaction entry: a method for humanized input</article-title>
          ,
          <source>ACM SIGCHI Bulletin</source>
          <volume>17</volume>
          (
          <year>1986</year>
          )
          <fpage>327</fpage>
          -
          <lpage>332</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>H.</given-names>
            <surname>Bast</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Weber</surname>
          </string-name>
          ,
          <article-title>Type less, find more: fast autocompletion search with a succinct index</article-title>
          ,
          <source>in: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval</source>
          ,
          <year>2006</year>
          , pp.
          <fpage>364</fpage>
          -
          <lpage>371</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>H.</given-names>
            <surname>Bast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Majumdar</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Weber</surname>
          </string-name>
          ,
          <article-title>Eficient interactive query expansion with complete search</article-title>
          ,
          <source>in: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management</source>
          ,
          <year>2007</year>
          , pp.
          <fpage>857</fpage>
          -
          <lpage>860</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>F.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. De Rijke</surname>
          </string-name>
          , et al.,
          <article-title>A survey of query auto completion in information retrieval</article-title>
          ,
          <source>Foundations and Trends® in Information Retrieval</source>
          <volume>10</volume>
          (
          <year>2016</year>
          )
          <fpage>273</fpage>
          -
          <lpage>363</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>C.</given-names>
            <surname>Xiao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Qin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ishikawa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Tsuda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Sadakane</surname>
          </string-name>
          ,
          <article-title>Eficient error-tolerant query autocompletion</article-title>
          ,
          <source>Proceedings of the VLDB Endowment</source>
          <volume>6</volume>
          (
          <year>2013</year>
          )
          <fpage>373</fpage>
          -
          <lpage>384</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Hasan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Parikh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Sundaresan</surname>
          </string-name>
          ,
          <article-title>Query suggestion for e-commerce sites</article-title>
          ,
          <source>in: Proceedings of the fourth ACM international conference on Web Search and Data Mining</source>
          ,
          <year>2011</year>
          , pp.
          <fpage>765</fpage>
          -
          <lpage>774</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S. K.</given-names>
            <surname>Karmaker Santu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Sondhi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhai</surname>
          </string-name>
          ,
          <article-title>On application of learning to rank for e-commerce search</article-title>
          ,
          <source>in: Proceedings of the 40th international ACM SIGIR conference on research and development in information retrieval</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>475</fpage>
          -
          <lpage>484</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>L.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Hong</surname>
          </string-name>
          , H. Liu,
          <article-title>Turning clicks into purchases: Revenue optimization for product search in e-commerce</article-title>
          ,
          <source>in: The 41st International ACM SIGIR Conference on Research &amp; Development in Information Retrieval</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>365</fpage>
          -
          <lpage>374</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Block</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kidambi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. N.</given-names>
            <surname>Hill</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Joachims</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. S.</given-names>
            <surname>Dhillon</surname>
          </string-name>
          ,
          <article-title>Counterfactual learning to rank for utilitymaximizing query autocompletion</article-title>
          ,
          <source>in: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>791</fpage>
          -
          <lpage>802</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>G.</given-names>
            <surname>Di</surname>
          </string-name>
          <string-name>
            <surname>Santo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>McCreadie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Macdonald</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Ounis</surname>
          </string-name>
          ,
          <article-title>Comparing approaches for query autocompletion</article-title>
          ,
          <source>in: Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>775</fpage>
          -
          <lpage>778</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M.</given-names>
            <surname>Shokouhi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Radinsky</surname>
          </string-name>
          ,
          <article-title>Time-sensitive query autocompletion</article-title>
          ,
          <source>in: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval</source>
          ,
          <year>2012</year>
          , pp.
          <fpage>601</fpage>
          -
          <lpage>610</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Strizhevskaya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Baytin</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Galinskaya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Serdyukov</surname>
          </string-name>
          ,
          <article-title>Actualization of query suggestions using query logs</article-title>
          ,
          <source>in: Proceedings of the 21st International Conference on World Wide Web</source>
          ,
          <year>2012</year>
          , pp.
          <fpage>611</fpage>
          -
          <lpage>612</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Bar-Yossef</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kraus</surname>
          </string-name>
          ,
          <article-title>Context-sensitive query autocompletion</article-title>
          ,
          <source>in: Proceedings of the 20th international conference on World wide web</source>
          ,
          <year>2011</year>
          , pp.
          <fpage>107</fpage>
          -
          <lpage>116</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>F.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. De Rijke</surname>
          </string-name>
          ,
          <article-title>Time-sensitive personalized query auto-completion</article-title>
          ,
          <source>in: Proceedings of the 23rd ACM international conference on conference on information and knowledge management</source>
          ,
          <year>2014</year>
          , pp.
          <fpage>1599</fpage>
          -
          <lpage>1608</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>M.</given-names>
            <surname>Shokouhi</surname>
          </string-name>
          ,
          <article-title>Learning to personalize query autocompletion</article-title>
          ,
          <source>in: Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>103</fpage>
          -
          <lpage>112</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>S.</given-names>
            <surname>Whiting</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Jose</surname>
          </string-name>
          , Recent and robust query autocompletion,
          <source>in: Proceedings of the 23rd international conference on World wide web</source>
          ,
          <year>2014</year>
          , pp.
          <fpage>971</fpage>
          -
          <lpage>982</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>N.</given-names>
            <surname>Yadav</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. N.</given-names>
            <surname>Hill</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mazumdar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. S.</given-names>
            <surname>Dhillon</surname>
          </string-name>
          ,
          <article-title>Session-aware query auto-completion using extreme multi-label ranking</article-title>
          ,
          <source>in: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery &amp; Data Mining</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>3835</fpage>
          -
          <lpage>3844</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <article-title>A dynamic product-aware learning model for e-commerce query intent understanding</article-title>
          ,
          <source>in: Proceedings of the 28th ACM International Conference on Information and Knowledge Management</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>1843</fpage>
          -
          <lpage>1852</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>C.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Goutam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , C. Zhang,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <article-title>Implicit query parsing at amazon product search</article-title>
          ,
          <source>in: Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>3380</fpage>
          -
          <lpage>3384</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>P.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Perez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Piktus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Petroni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Karpukhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Küttler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          , W.-t. Yih,
          <string-name>
            <given-names>T.</given-names>
            <surname>Rocktäschel</surname>
          </string-name>
          , et al.,
          <article-title>Retrieval-augmented generation for knowledge-intensive nlp tasks</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>33</volume>
          (
          <year>2020</year>
          )
          <fpage>9459</fpage>
          -
          <lpage>9474</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>B.</given-names>
            <surname>Mitra</surname>
          </string-name>
          ,
          <article-title>Exploring session context using distributed representations of queries and reformulations</article-title>
          ,
          <source>in: Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , SIGIR '15,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2015</year>
          , p.
          <fpage>3</fpage>
          -
          <lpage>12</lpage>
          . URL: https://doi.org/10.1145/2766462.2767702. doi:
          <volume>10</volume>
          . 1145/2766462.2767702.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Long</surname>
          </string-name>
          ,
          <article-title>Eficient neural query auto completion</article-title>
          ,
          <source>in: Proceedings of the 29th ACM International Conference on Information &amp; Knowledge Management, CIKM '20</source>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2020</year>
          , p.
          <fpage>2797</fpage>
          -
          <lpage>2804</lpage>
          . URL: https://doi.org/10.1145/3340531. 3412701. doi:
          <volume>10</volume>
          .1145/3340531.3412701.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Parmar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Uszkoreit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          , Ł. Kaiser,
          <string-name>
            <surname>I. Polosukhin</surname>
          </string-name>
          ,
          <article-title>Attention is all you need</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>30</volume>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>B.</given-names>
            <surname>Mitra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Craswell</surname>
          </string-name>
          ,
          <article-title>Query auto-completion for rare prefixes</article-title>
          ,
          <source>in: Proceedings of the 24th ACM international on conference on information and knowledge management</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>1755</fpage>
          -
          <lpage>1758</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>F.</given-names>
            <surname>Cai</surname>
          </string-name>
          , M. de Rijke,
          <article-title>Learning from homologous queries and semantically related terms for query auto completion</article-title>
          ,
          <source>Information Processing &amp; Management</source>
          <volume>52</volume>
          (
          <year>2016</year>
          )
          <fpage>628</fpage>
          -
          <lpage>643</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>T.</given-names>
            <surname>Shao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Chen</surname>
          </string-name>
          , W. Chen,
          <article-title>Query auto-completion based on word2vec semantic similarity</article-title>
          ,
          <source>in: Journal of Physics: Conference Series</source>
          , volume
          <volume>1004</volume>
          ,
          <string-name>
            <given-names>IOP</given-names>
            <surname>Publishing</surname>
          </string-name>
          ,
          <year>2018</year>
          , p.
          <fpage>012018</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>K.</given-names>
            <surname>Arkoudas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yahya</surname>
          </string-name>
          ,
          <article-title>Semantically driven autocompletion</article-title>
          ,
          <source>in: Proceedings of the 28th ACM International Conference on Information and Knowledge Management</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>2693</fpage>
          -
          <lpage>2701</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Long</surname>
          </string-name>
          ,
          <article-title>Eficient neural query auto completion</article-title>
          ,
          <source>in: Proceedings of the 29th ACM International Conference on Information &amp; Knowledge Management</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>2797</fpage>
          -
          <lpage>2804</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>Y. M.</given-names>
            <surname>Kang</surname>
          </string-name>
          , W. Liu,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <article-title>Queryblazer: eficient query autocompletion framework</article-title>
          ,
          <source>in: Proceedings of the 14th ACM International Conference on Web Search and Data Mining</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>1020</fpage>
          -
          <lpage>1028</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>D.</given-names>
            <surname>Maxwell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bailey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hawking</surname>
          </string-name>
          ,
          <article-title>Large-scale generative query autocompletion</article-title>
          ,
          <source>in: Proceedings of the 22nd Australasian Document Computing Symposium</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>S.</given-names>
            <surname>Whiting</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Jose</surname>
          </string-name>
          , Recent and robust query autocompletion,
          <source>in: Proceedings of the 23rd International Conference on World Wide Web, WWW '14</source>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2014</year>
          , p.
          <fpage>971</fpage>
          -
          <lpage>982</lpage>
          . URL: https://doi.org/10.1145/2566486. 2568009. doi:
          <volume>10</volume>
          .1145/2566486.2568009.
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>F.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Liang</surname>
          </string-name>
          , M. de Rijke,
          <article-title>Time-sensitive personalized query auto-completion</article-title>
          ,
          <source>in: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management</source>
          , CIKM '14,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2014</year>
          , p.
          <fpage>1599</fpage>
          -
          <lpage>1608</lpage>
          . URL: https://doi.org/10.1145/ 2661829.2661921. doi:
          <volume>10</volume>
          .1145/2661829.2661921.
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>M.</given-names>
            <surname>Shokouhi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Radinsky</surname>
          </string-name>
          ,
          <article-title>Time-sensitive query autocompletion</article-title>
          ,
          <source>in: Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , SIGIR '12,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2012</year>
          , p.
          <fpage>601</fpage>
          -
          <lpage>610</lpage>
          . URL: https://doi.org/10.1145/2348283. 2348364. doi:
          <volume>10</volume>
          .1145/2348283.2348364.
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>O.</given-names>
            <surname>Khattab</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zaharia</surname>
          </string-name>
          ,
          <article-title>Colbert: Eficient and efective passage search via contextualized late interaction over bert</article-title>
          ,
          <source>in: Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>39</fpage>
          -
          <lpage>48</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>G.</given-names>
            <surname>Aslanyan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mandal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Senthil Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jaiswal</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Rangasamy Kannadasan, Personalized ranking in ecommerce search</article-title>
          ,
          <source>in: Companion Proceedings of the Web Conference</source>
          <year>2020</year>
          , WWW '20,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2020</year>
          , p.
          <fpage>96</fpage>
          -
          <lpage>97</lpage>
          . URL: https://doi.org/10.1145/3366424.3382715. doi:
          <volume>10</volume>
          .1145/3366424.3382715.
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>A.</given-names>
            <surname>Jaech</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ostendorf</surname>
          </string-name>
          ,
          <article-title>Personalized language model for query auto-completion</article-title>
          , in: I. Gurevych, Y. Miyao (Eds.),
          <source>Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume</source>
          <volume>2</volume>
          :
          <string-name>
            <surname>Short</surname>
            <given-names>Papers)</given-names>
          </string-name>
          ,
          <source>Association for Computational Linguistics</source>
          , Melbourne, Australia,
          <year>2018</year>
          , pp.
          <fpage>700</fpage>
          -
          <lpage>705</lpage>
          . URL: https://aclanthology.org/P18-2111. doi:
          <volume>10</volume>
          . 18653/v1/
          <fpage>P18</fpage>
          -2111.
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>D.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Deng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <article-title>Learning to generate personalized query autocompletions via a multi-view multi-task attentive approach</article-title>
          ,
          <source>in: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining, KDD '20</source>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2020</year>
          , p.
          <fpage>2998</fpage>
          -
          <lpage>3007</lpage>
          . URL: https://doi.org/10.1145/3394486.3403350. doi:
          <volume>10</volume>
          . 1145/3394486.3403350.
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>D.</given-names>
            <surname>Maxwell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bailey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hawking</surname>
          </string-name>
          ,
          <article-title>Large-scale generative query autocompletion</article-title>
          ,
          <source>in: Proceedings of the 22nd Australasian Document Computing Symposium</source>
          , ADCS '17,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2017</year>
          . URL: https://doi.org/10.1145/ 3166072.3166083. doi:
          <volume>10</volume>
          .1145/3166072.3166083.
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>A.</given-names>
            <surname>Sordoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Vahabi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lioma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. Grue</given-names>
            <surname>Simonsen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-Y.</given-names>
            <surname>Nie</surname>
          </string-name>
          ,
          <article-title>A hierarchical recurrent encoderdecoder for generative context-aware query suggestion</article-title>
          ,
          <source>in: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management</source>
          , CIKM '15,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2015</year>
          , p.
          <fpage>553</fpage>
          -
          <lpage>562</lpage>
          . URL: https://doi.org/10.1145/2806416.2806493. doi:
          <volume>10</volume>
          . 1145/2806416.2806493.
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [40]
          <string-name>
            <given-names>P.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Ping</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>McAfee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Subramanian</surname>
          </string-name>
          , E. Bakhturina,
          <string-name>
            <given-names>M.</given-names>
            <surname>Shoeybi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Catanzaro</surname>
          </string-name>
          ,
          <article-title>Retrieval meets long context large language models</article-title>
          ,
          <source>arXiv preprint arXiv:2310.03025</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [41]
          <string-name>
            <given-names>N.</given-names>
            <surname>Kandpal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Deng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Wallace</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Raffel</surname>
          </string-name>
          ,
          <article-title>Large language models struggle to learn long-tail knowledge</article-title>
          ,
          <source>in: Proceedings of the 40th International Conference on Machine Learning, ICML'23</source>
          , JMLR.org,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          [42]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Mao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          , J. Han,
          <string-name>
            <surname>W</surname>
          </string-name>
          . Chen,
          <article-title>Generation-augmented retrieval for opendomain question answering</article-title>
          , in: C.
          <string-name>
            <surname>Zong</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Xia</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Navigli</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing</source>
          (Volume
          <volume>1</volume>
          :
          <string-name>
            <surname>Long</surname>
            <given-names>Papers)</given-names>
          </string-name>
          ,
          <source>Association for Computational Linguistics</source>
          , Online,
          <year>2021</year>
          , pp.
          <fpage>4089</fpage>
          -
          <lpage>4100</lpage>
          . URL: https: //aclanthology.org/
          <year>2021</year>
          .
          <article-title>acl-long</article-title>
          .
          <volume>316</volume>
          . doi:
          <volume>10</volume>
          .18653/ v1/
          <year>2021</year>
          .
          <article-title>acl-long</article-title>
          .
          <volume>316</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          [43]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , Bert:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          , arXiv preprint arXiv:
          <year>1810</year>
          .
          <volume>04805</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          [44]
          <string-name>
            <given-names>K.</given-names>
            <surname>Santhanam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Khattab</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Saad-Falcon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Potts</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Zaharia, Colbertv2: Efective and eficient retrieval via lightweight late interaction</article-title>
          ,
          <source>arXiv preprint arXiv:2112.01488</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          [45]
          <string-name>
            <given-names>A. Q.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sablayrolles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mensch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bamford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. S.</given-names>
            <surname>Chaplot</surname>
          </string-name>
          , D. d. l. Casas,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bressand</surname>
          </string-name>
          , G. Lengyel,
          <string-name>
            <given-names>G.</given-names>
            <surname>Lample</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Saulnier</surname>
          </string-name>
          , et al.,
          <source>Mistral 7b, arXiv preprint arXiv:2310.06825</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          [46]
          <string-name>
            <given-names>A.</given-names>
            <surname>Chowdhery</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Narang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bosma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Mishra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Barham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. W.</given-names>
            <surname>Chung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Sutton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gehrmann</surname>
          </string-name>
          , et al.,
          <article-title>Palm: Scaling language modeling with pathways</article-title>
          ,
          <source>Journal of Machine Learning Research</source>
          <volume>24</volume>
          (
          <year>2023</year>
          )
          <fpage>1</fpage>
          -
          <lpage>113</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref47">
        <mixed-citation>
          [47]
          <string-name>
            <given-names>J.</given-names>
            <surname>Achiam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Adler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Ahmad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Akkaya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. L.</given-names>
            <surname>Aleman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Almeida</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Altenschmidt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Altman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Anadkat</surname>
          </string-name>
          , et al.,
          <source>Gpt-4 technical report, arXiv preprint arXiv:2303.08774</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref48">
        <mixed-citation>
          [48]
          <string-name>
            <given-names>S.</given-names>
            <surname>Robertson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zaragoza</surname>
          </string-name>
          , et al.,
          <article-title>The probabilistic relevance framework: Bm25 and beyond</article-title>
          ,
          <source>Foundations and Trends® in Information Retrieval</source>
          <volume>3</volume>
          (
          <year>2009</year>
          )
          <fpage>333</fpage>
          -
          <lpage>389</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>