<!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>
      <journal-title-group>
        <journal-title>Vaswani dataset; Cranfield dataset; TREC Genomics</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>ORCAS-I query intent predictor as component of TIRA</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Daria Alexander</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wojciech Kusa</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Arjen P. de Vries</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Radboud University</institution>
          ,
          <addr-line>Houtlaan 4, 6525 XZ Nijmegen</addr-line>
          ,
          <country country="NL">Netherlands</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>TU Wien</institution>
          ,
          <addr-line>1040 Vienna, Favoritenstraße 9-11</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2004</year>
      </pub-date>
      <volume>2005</volume>
      <fpage>2004</fpage>
      <lpage>2006</lpage>
      <abstract>
        <p>We present a query intent predictor that is based on Snorkel weak supervision approach. After using it on ORCAS dataset and conducting a series of experiments with a variety of machine learning models we found that the results produced by Snorkel were not outperformed by these competing approaches and can be considered state-of-the-art. The advantage of a rule-based approach like Snorkel's is its eficient deployment in an actual system, where intent classification would be executed for every query issued. When used as a component of TIRA/TIREX platform, our query intent predictor was shown to be applicable to other IR benchmark datasets. Also, we found out that the awareness of the intent overall can improve ranking results for informational intent and its subcategory factual intent.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;snorkel</kwd>
        <kwd>weak supervision</kwd>
        <kwd>intent labelling</kwd>
        <kwd>web search</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Methods overview</title>
      <sec id="sec-2-1">
        <title>2.1. Taxonomy</title>
        <p>
          To classify the queries in ORCAS dataset according to user intent we created a taxonomy based on
Broder’s [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] taxonomy that divides intent into three levels: informational, navigational and transactional.
Moreover, we added two subcategories in the informational class, factual and instrumental. We provide
the definitions of the categories.
        </p>
        <p>
          • Navigational intent: the immediate intent is to reach a particular website [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ];
• Transactional intent: locate a website with the goal to obtain some other product, which may
require executing some Web service on that website [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ];
• Informational intent: locate content concerning a particular topic in order to address an
information need of the searcher [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ];
- Factual intent: locate specific facts or pieces of information [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ];
- Instrumental intent: the aim is to find out what to do or how to do something [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ];
- Abstain: everything inside the informational category that is not classified as factual or
instrumental.
        </p>
        <p>
          To create labelling rules for Snorkel we used the characteristics suggested by Jansen et al. [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. They
utilise established heuristics and keywords to construct rules for the prediction of the intent category for
informational, navigational and transactional intent. We re-evaluated those characteristics and added
some new ones. For example, we classified the queries that start with question words "what is", "what
are", "do" and "does" as factual, because those questions usually need specific pieces of information as
answers. For the same reason, we considered the queries that contain words "definition" and "meaning"
as belonging to factual intent. The queries that started with a verb were classified as instrumental: (e.g.
"bake a pork chop").
        </p>
        <p>Also, we used Levenshtein similarity ratio to determine if the query is navigational. We wanted to
understand whether the domain part of the URL and the query are similar. The Levenshtein similarity
ratio is computed according to the following formula:
|| + || − Lev(, )</p>
        <p>|| + ||</p>
        <p>Here, Lev(, ) is Levenshtein distance (the minimum number of edits required change a one-word
sequence into the other) and || and || are lengths of sequence a and sequence b respectively. A
threshold on Levenshtein ratio was empirically established at 0.55, which means that if the query and
the domain name were 55% or more similar they were classified as navigational.</p>
        <p>According to Jansen et al., the queries that do not meet criteria for navigational or transactional have
informational intent. Thus, we decided to make abstain subcategory part of the informational category.
However, we could not establish consistent automatic characteristics for this group of queries because
we could not find any reliable patterns in them.</p>
        <p>
          More details about the intent labelling characteristics for ORCAS-I query intent predictor are provided
in [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. ORCAS and ORCAS-I datasets</title>
        <p>The ORCAS dataset is part of the MS MARCO datasets (Microsoft) and is intended for non-commercial
research purposes. It contains 18.8 million clicked query-URL pairs and 10.4 million distinct queries. The
dataset has the following information: query ID, query, document ID and clicked URL. The documents
that the URLs lead to come from TREC Deep Learning Track.</p>
        <p>This dataset was aggregated based on a subsample of Bing’s 26-month logs to January 2020. The
creators of the dataset applied several filters to the log. Firstly, they only kept query-URL pairs where
the URL is present in the 3.2 million document TREC Deep Learning corpus. Secondly, they applied a
k-anonymity filter and only kept queries that are used by k diferent users. Finally, ofensive queries
such as hatred and pornography were removed.</p>
        <p>
          ORCAS-I dataset is the version of ORCAS dataset annotated with user intent that we released [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ].
For Snorkel labelling we used a two-million sample of the ORCAS dataset (ORCAS-2M). In order to
evaluate the performance of our weak supervision approach, we manually created a test set collection.
We randomly selected 1000 queries from the original ORCAS dataset that were not in the ORCAS-I-2M
dataset. The test set was annotated by two IR specialists using the open-source tool Doccano1. For
inter-annotator agreement on the test set, the Cohen Kappa statistic was 0.82. We call this manually
annotated dataset ORCAS-I-gold.
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Creating Snorkel labelling functions</title>
        <p>In machine learning terms, our intent taxonomy could be represented as a two-level, multi-class
classification problem. Snorkel has originally only been implemented to handle annotations for
singlelevel classification problems. As our taxonomy is hierarchical, we needed to define two layers of Snorkel
labelling functions.</p>
        <p>We defined the first level of labelling functions to distinguish between navigational and transactional
intents. All the queries that could not fit into one of these two categories were classified as informational
intent in our taxonomy. Based on our user intent classification characteristics, we created four labelling
functions for navigational queries and three functions for transactional queries.</p>
        <p>On the second level, we defined labelling functions to cover factual and instrumental intents. Similar
to the previous step, we designed nine factual and four instrumental labelling functions. All queries
that were not assigned a label from the two layers of Snorkel got an abstain category.</p>
        <p>We initially used Spacy’s en_core_web_lg language model to identify part of speech information
and to detect named entities. After initial analysis, this proved to generate too many false negatives,
especially for the detection of verbs. For example, the queries “change display to two monitors” and
“export itunes library” were misclassified as abstain, because the verbs “change” and “export” were
labelled as nouns. In the final version, we decided to use a list of the 850+ common verbs with which
we obtained comparable coverage with fewer false positives. Eventually, we only have used Spacy for a
labelling function where queries begin with the “-ing” form of the verb.</p>
      </sec>
      <sec id="sec-2-4">
        <title>2.4. Training Snorkel</title>
        <p>To obtain a final prediction score, we run independently two levels of Snorkel annotations. Based on
our classification that all non-transactional, non-navigational queries are informational, for the second
level prediction, we use all the queries which were assigned abstain from the first level. In order to
conduct label aggregation, we experiment with both the LabelModel and MajorityLabelVoter methods
implemented in Snorkel. LabelModel estimates rule weights using an unsupervised agreement-based
objective. MajorityLabelVoter creates labels by aggregating the predictions from multiple weak rules
via majority voting. We test their predictions on the test dataset using default hyperparameters. Results
are presented in Table 1.</p>
        <p>After analysis of results on the testset, MajorityLabelVoter achieved higher scores for all measures
except macro average recall. Therefore, we decided to use it to obtain the final labels for the
ORCAS-I2M dataset. MajorityLabelVoter has the additional benefit that it provides more explainable results, as
for every query, the user can be presented with the raw aggregation of the single labelling functions.</p>
      </sec>
      <sec id="sec-2-5">
        <title>2.5. Results</title>
        <sec id="sec-2-5-1">
          <title>2.5.1. Label distribution</title>
          <p>Table 2 shows the label distribution in ORCAS-I dataset compared to the 40 test collections present in
TIRA2. As for ORCAS dataset, the only underrepresented category compared to gold is the navigational
intent, which contains 1.6% less items than in the manual labelling approach. The label distribution
from Snorkel for ORCAS-2M and ORCAS-18M is comparable, so the 2M sample chosen from the full
ORCAS dataset is representative.</p>
          <p>As for the test collections present in TIRA, the categories that are comparable to ORCAS-I label
distribution are instrumental and transactional. TIRA datasets contain much less navigational queries.
Unlike ORCAS, the majority of those datasets do not have URLs, which can explain far fewer navigational
queries. As for factual queries, ORCAS-I intent predictor often relies on the form of the query (e.g. starts
with "what is", "who is"), which means that some datasets, like ClueWeb collections or BEIR Nutrition
Facts Corpus would have fewer queries that belong to this intent.</p>
          <p>Having a URL is crucial for the navigational intent, that is why better predictions are made in the
post-retrieval stage. Comparing the label distribution in TREC Web test collections (Table 3) with and
without URL shows us that no navigational intent is detected in the pre-retrieval stage. By contrast, it
is detected for all three collections in the post-retrieval stage. It shows that all the elements that could
help to disambiguate the intent of the query are important.</p>
          <p>Model
Snorkel
Logistic
regression
SVM
fastText
BERT
xtremedistil
query
query + URL
query
query + URL
query
query + URL
query
query + URL
query
query + URL
query
query + URL
.771
.779
.701
.714
.735
.782
.694
.768
.742
.789
.725
.781
.648
764
.611
.689
.689
.759
.643
.753
.705
.764
.691
.765
.667
.770
.643
.700
.703
.767
.660
.758
.717
.774
.696
.772</p>
        </sec>
        <sec id="sec-2-5-2">
          <title>2.5.2. Comparing Snorkel to benchmark models</title>
          <p>
            We benchmark five diferent models by training them on ORCAS-I-2M: Logistic regression, Support
Vector Machine, fastText, BERT and xtremedistil (more details about the hyperparameters can be found
in [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ]). To train those models we use two types of training data: just the query and query plus URL.
URL features help to improve classification efectiveness. Table 4 shows that when we eliminate URL
features from Snorkel (we mute or change the labelling functions that are using URLs) especially recall
is reduced. Same as for TREC Web test collections, this is particularly noticeable for the navigational
category, for which recall drops from 0.73 to 0.35.
          </p>
          <p>We hypothesise that as we take URL features into account for the Snorkel classifier, models that
train on queries and URLs will outperform the models that train on queries only. This hypothesis is
confirmed for all the models, especially for fastText and xtremdistil. Also, SVM, BERT and xtremdistil
show improvements on recall for query-only when compared to Snorkel. It indicates that the models
learn well from the labels assigned by the Snorkel query and URL functions, even if they are trained
only on queries.</p>
          <p>None of our benchmark models significantly outperforms our Snorkel baseline when trained on
queries and URLs. This could have been an expected behaviour when comparing two models, one being
the teacher and the other the student who learned only from this one teacher, without any external
knowledge. We also hypothesise that transformer-based models cannot express their full power because
the input sequences are, on average, very short and lack context.</p>
        </sec>
        <sec id="sec-2-5-3">
          <title>2.5.3. Ranking experiments</title>
          <p>For ranking experiments we decided to focus on the informational intent in the taxonomy, because
navigational and transactional intent are underrepresented in the datasets availiable in TIRA. Some
collections do not have navigational and transactional queries at all (TREC Genomics 2004 and 2005,
TREC 2018 Core track) some only have a few navigational and transactional queries (CLEF Longeval
2023). For the experiments we chose the TREC COVID collection and TREC Deep Learining track 2019
and 2020 passage collections because they provided suficcient samples of instrumental, factual and
abstain queries for the evaluation of the models’ performance.</p>
          <p>
            We tested the BM25 baseline against two ranking models. ColBERT [
            <xref ref-type="bibr" rid="ref12">12</xref>
            ] introduces a late interaction
architecture that independently encodes the query and the document using BERT and then employs
an interaction step that models their fine grained similarity. MonoT5 [
            <xref ref-type="bibr" rid="ref13">13</xref>
            ] is a sequence-to-sequence
model that uses a similar masked language modeling objective as BERT to pretrain its encoder–decoder
architecture.
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Conclusion</title>
      <p>After creating the ORCAS-I query intent predictor, we used it for TIRA test collections. In terms of
the label distribution, TIRA datasets have fewer navigational queries than ORCAS-I dataset, as many
of them do not have a URL field. Comparing the pre-retrieval with the post-retrieval intent for TREC
Web collections showed that having a query and URL for navigational category provides better results
than having only a query, which confirms our previous findings that Snorkel and benchmark models
trained on it perform better when having a URL. As for ranking experiments, attention-based rankers
performed better than the BM25 baseline for informational intent and its subcategory factual intent,
which means that those models still benefit from the semantics of the queries despite the lack of context.</p>
      <p>
        Although our query intent predictor is applicable to all the collections present in TIRA, it might not
be very useful for some of them. For the Touche collections that contain non-factoid queries, such as
argumentative questions (e.g. "should nuclear weapons be abolished?") it will not provide a classification
that will be fine-grained enough. A separate intent classification that labels non-factoid queries such as
the one suggested by [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] should be used for those collections. A further analysis to determine the test
collections that would benefit the most from ORCAS-I query intent predictor would show how to use it
in the best way in TIRA pipeline.
      </p>
    </sec>
    <sec id="sec-4">
      <title>Acknowledgments</title>
      <p>This work was supported by the EU Horizon 2020 ITN/ETN on Domain Specific Systems for Information
Extraction and Retrieval – DoSSIER (H2020-EU.1.3.1., ID: 860721) and by the OpenWebSearch.eu project
(GA 101070014).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A. J.</given-names>
            <surname>Ratner</surname>
          </string-name>
          ,
          <string-name>
            <surname>C. M. De Sa</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Selsam</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Ré</surname>
          </string-name>
          ,
          <article-title>Data programming: Creating large training sets, quickly</article-title>
          , in: D.
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Sugiyama</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          <string-name>
            <surname>Luxburg</surname>
            ,
            <given-names>I. Guyon</given-names>
          </string-name>
          , R. Garnett (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          , volume
          <volume>29</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2016</year>
          . URL: https: //proceedings.neurips.cc/paper/2016/file/6709e8d64a5f47269ed5cea9f625f7ab-Paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>N.</given-names>
            <surname>Craswell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Campos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mitra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Yilmaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Billerbeck</surname>
          </string-name>
          ,
          <article-title>Orcas: 18 million clicked querydocument pairs for analyzing search</article-title>
          , arXiv preprint arXiv:
          <year>2006</year>
          .
          <volume>05324</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Alexander</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Kusa</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. P.</surname>
          </string-name>
          de Vries,
          <article-title>ORCAS-I: Queries Annotated with Intent using Weak Supervision</article-title>
          ,
          <source>in: SIGIR '22: Proceedings of the 45rd International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <year>2022</year>
          . URL: https://arxiv.org/abs/2205.00926.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Farzana</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Granitzer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Hendriksen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hiemstra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zerhoudi</surname>
          </string-name>
          , 1st International Workshop on Open Web Search (WOWS),
          <source>in: Advances in Information Retrieval. 46th European Conference on IR Research (ECIR</source>
          <year>2024</year>
          ), Lecture Notes in Computer Science, Springer,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wiegmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kolyada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Grahm</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Elstner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Loebe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hagen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <article-title>Continuous Integration for Reproducible Shared Tasks with TIRA.io</article-title>
          , in: J.
          <string-name>
            <surname>Kamps</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Goeuriot</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Crestani</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Maistro</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Joho</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Davis</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Gurrin</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          <string-name>
            <surname>Kruschwitz</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Caputo (Eds.),
          <source>Advances in Information Retrieval. 45th European Conference on IR Research (ECIR</source>
          <year>2023</year>
          ), Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York,
          <year>2023</year>
          , pp.
          <fpage>236</fpage>
          -
          <lpage>241</lpage>
          . URL: https://link. springer.com/chapter/10.1007/978-3-
          <fpage>031</fpage>
          -28241-6_
          <fpage>20</fpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -28241-6_
          <fpage>20</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Reimer</surname>
          </string-name>
          , S. MacAvaney,
          <string-name>
            <given-names>N.</given-names>
            <surname>Deckers</surname>
          </string-name>
          , S. Reich, J.
          <string-name>
            <surname>Bevendorf</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Hagen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Potthast</surname>
          </string-name>
          ,
          <article-title>The Information Retrieval Experiment Platform</article-title>
          , in: H.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>W. E.</given-names>
          </string-name>
          <string-name>
            <surname>Duh</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>M. P.</given-names>
          </string-name>
          <string-name>
            <surname>Kato</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Mothe</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          Poblete (Eds.),
          <source>46th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR</source>
          <year>2023</year>
          ), ACM,
          <year>2023</year>
          , pp.
          <fpage>2826</fpage>
          -
          <lpage>2836</lpage>
          . URL: https://dl.acm.org/doi/10.1145/3539618.3591888. doi:
          <volume>10</volume>
          .1145/3539618.3591888.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Broder</surname>
          </string-name>
          ,
          <article-title>A taxonomy of web search</article-title>
          ,
          <source>SIGIR Forum 36</source>
          (
          <year>2002</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>B. J.</given-names>
            <surname>Jansen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. L.</given-names>
            <surname>Booth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Spink</surname>
          </string-name>
          ,
          <article-title>Determining the informational, navigational, and transactional intent of web queries</article-title>
          ,
          <source>Information Processing &amp; Management</source>
          <volume>44</volume>
          (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Kellar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Watters</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Author</surname>
          </string-name>
          ,
          <article-title>A field study characterizing web-based information seeking tasks</article-title>
          ,
          <source>JASIST</source>
          <volume>58</volume>
          (
          <year>2007</year>
          )
          <fpage>999</fpage>
          -
          <lpage>1018</lpage>
          . doi:
          <volume>10</volume>
          .1002/asi.20590.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <article-title>Task as a predictable indicator of information seeking behavior on the Web</article-title>
          ,
          <source>Ph.D. thesis</source>
          , Rutgers University,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>W.</given-names>
            <surname>Kusa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Alexander</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. P. de Vries</surname>
          </string-name>
          , Orcas-i,
          <year>2022</year>
          . doi:
          <volume>10</volume>
          .48436/pp7xz-n9a06.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <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="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>R.</given-names>
            <surname>Nogueira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Pradeep</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <article-title>Document ranking with a pretrained sequence-to-sequence model</article-title>
          , in: T. Cohn,
          <string-name>
            <given-names>Y.</given-names>
            <surname>He</surname>
          </string-name>
          , Y. Liu (Eds.),
          <source>Findings of the Association for Computational Linguistics: EMNLP</source>
          <year>2020</year>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Online,
          <year>2020</year>
          , pp.
          <fpage>708</fpage>
          -
          <lpage>718</lpage>
          . URL: https: //aclanthology.org/
          <year>2020</year>
          .findings-emnlp.
          <volume>63</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .findings-emnlp.
          <volume>63</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>V.</given-names>
            <surname>Bolotova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Blinov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Scholer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Croft</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sanderson</surname>
          </string-name>
          ,
          <article-title>A non-factoid question-answering taxonomy</article-title>
          ,
          <year>2022</year>
          , pp.
          <fpage>1196</fpage>
          -
          <lpage>1207</lpage>
          . doi:
          <volume>10</volume>
          .1145/3477495.3531926.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>