<!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>Lightweight Methods for Early Risk Detection</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Diego Maupomé</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Thomas Soulas</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fanny Rancourt</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ghyslain Cantin-Savoie</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Grégoire Winterstein</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sébastien Mosser</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marie - Jean Meurs</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>McMaster University</institution>
          ,
          <addr-line>ON</addr-line>
          ,
          <country country="CA">Canada</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Université du Québec à Montréal</institution>
          ,
          <addr-line>QC</addr-line>
          ,
          <country country="CA">Canada</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper describes the participation of the RELAI team in the eRisk 2023 shared tasks. The first task is a new problem introduced this year and consists of ranking sentences from a collection of user writings according to their relevance to a depression symptom. The second task is a recurring task, which highlights the problems of preliminary detection of gambling addiction. The eRisk shared tasks seek to explore the application of Natural Language Processing (NLP) methods to estimate risk to mental health from online content. Its 2023 edition [1] included a task centered around finding excerpts related to signs and symptoms of depression, as well as a task aimed at the early detection of signs of pathological gambling. The present paper describes our participation to these tasks. Task 1, Search for symptoms of depression, was a retrieval task, aimed at finding and ranking sentences relevant to each of the signs and symptoms described in the Beck Depression Inventory, 2nd edition (BDI-II) [2]. The approach presented operates on the textual similarity between the sentences at hand and the questionnaire. Task 2, Early Detection of Signs of Pathological Gambling, is aimed at producing a singular assessment of the risk of pathological gambling given a subject's history of writings. This task proceeds iteratively, parsing a new writing per subject and expecting an update on the assessment for that individual. These assessments comprise a binary decision as well as a continuous score. Our participation was based on lightweight approaches deployed in past editions, such as stylometry and topic extraction, slightly modified to fit the context of eRisk 2023.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Mental Health</kwd>
        <kwd>Natural Language Processing</kwd>
        <kwd>Topic Modeling</kwd>
        <kwd>Stylometry</kwd>
        <kwd>BM25</kwd>
        <kwd>Transformers</kwd>
        <kwd>Domain adaptation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Task 1: Search for symptoms of depression</title>
      <sec id="sec-2-1">
        <title>2.1. Task and Data</title>
        <p>The data consist of a set of independent sentences gathered from Reddit1. No training set was
provided. The testing dataset consists of 3,807,115 sentences from 3107 diferent Reddit users,
averaging 1225.34 sentences per user. Each sentence contains an average of 13.63 words. This
dataset is based on past eRisk data. The task is to select the sentences most relevant to a given
item in the BDI and rank them accordingly. While the pool of sentences was shared across
items, a separate ranking of up to 1000 sentences was to be provided per each of the 21 BDI
items. In addition, each sentence in the ranking had to be attributed a numeric relevance score.
This score had no preset scale; it should only be increasing with respect to relevance: sentences
higher up in the ranking would have a higher score.</p>
        <p>The question of what it means to be relevant remained largely underspecified in the description
of the task, though annotation guidelines characterized relevant sentences as those conveying
some information about the mental status of the author with respect to the topic discussed in
the BDI item. Given the nature of the task, the relation of relevance can only be understood
as one between a single discourse segment, usually a sentence, and a given item in the BDI,
formalized as a question. Crucially, context plays no role in the relation at hand.</p>
        <p>
          Yet, in spite of their diferences, theoretical accounts of discursive relevance all highlight
the highly contextual nature of relevance, especially when it is understood as the relationship
between the elements in a question/answer pair (see a.o. Relevance Theory [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], accounts based
on the notion of Question under Discussion [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], Segmented Discourse Representation Theory
[
          <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
          ], or Bayesian models of communication [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], all of them taking their roots in Grice’s original
program [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] and its notion of conversational implicature as the contextual enrichment of the
content of an utterance). These theories emphasize that the meaning of a discourse is more than
the sum of the meaning of its parts, and that context matters not just for the interpretation of the
content of an utterance (e.g. by resolving indexical expressions or ambiguities), but also of the
use of the utterance at a specific point in conversation, which in turns afects the interpretation
of the content of the utterance. For example, in argumentative discourse, though a given
proposition might not warrant, or even suggest, a particular conclusion, when taken in the
larger context of an argument the same content might turn out to be very relevant to the
conclusion because of its interaction with other discursive elements. This means that the setup
of the task increases the risk of false negatives, i.e. of attributing a low relevance to sentence
to a BDI item simply because we lack the necessary context to understand the speaker’s point
when using their sentence, and how it fits in their overall discourse. This is not to say that the
task is inherently flawed: as already pointed out, early detection necessarily relies on limited
data, and we approached the task in this spirit.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Approaches and Training</title>
        <p>The approaches put forth for this task were centered around the relevance score, aiming to
produce one score per sentence per item. From there, sentences were selected and ranked
based on this score. Each subject-produced sentence was matched against the sentences
associated with each of the answer options of BDI items. Diferent of-the-shelf textual similarity
models examined the resulting sentence pairs, yielding a similarity score. Then, the overall
relevance score for a sentence with respect to an item was computed from its similarity scores
associated with individual answers. Diferent manners of aggregating these similarity scores
into a relevance score were considered, reflecting two diferent interpretations of relevance.
The first of these interpretations—corresponding more closely to the one that would be given
to annotators—is broader, characterizing relevance as touching on the same topics or subject
matter as the pertinent BDI item. This interpretation was modeled by three separate aggregation
operations: mean score, computing the relevance as the arithmetic mean of similarity scores,
and minimum or maximum score, computing the relevance score as the lowest (resp. highest)
similarity score. The second, more instrumentalist interpretation, conceived the relevance of a
sentence as helping to select a specific answer to the BDI item for its author. Thus, a relevant
sentence should display more clear afinity to one or a few answer options than the rest. This
was modeled by reinterpreting similarity scores as logits and computing the entropy of their
distribution. A relevant sentence would then have low entropy,2 because it bears more distinct
similarity to few answers.</p>
        <p>
          Sentence similarities were computed using Transformer-based sentence encoders [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. These
were further adapted to the domain of discourse by training on past eRisk data [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. However,
given the large volume of sentences and the complexity of these models, encoding the entire
set in order to compute similarities proved impracticable. To remediate this, sentences were
ifrst filtered by less computationally expensive BM25 models. Sentences bearing the highest
similarity to some BDI sentence were retained and processed by Transformer-based models.
Filtered out models were then assigned the lowest similarity found by the end model.
        </p>
        <p>
          The BM25 model selected is a variant of Okapi BM25 [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. As preprocessing, the sentences
were fed through a Porter Stemmer followed by a Wordnet lemmatizer. Following [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], we set
the minimal word length to 4. Stopwords were kept [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. The top 100 sentences per BDI answer
were retained for the Transformer encoder. Two related pretrained Transformer models were
selected: a general purpose sentence Transformer (mpnetbase) and a semantic search–oriented
variant (mpnetqa) [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. As a means of domain adaptation, these were further trained on the
SimCSE objective [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] with past eRisk data [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. An additional, baseline run makes use only of
the BM25 component. These approaches were evaluated by proxy using past eRisk data [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]
under the interpretation of relevance as helping to select a specific answer to a given item [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ],
where mean-based aggregation produced the best results.
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Results and Discussion</title>
        <p>Rankings were evaluated using manual relevance assessment of a pool of sentences, extracted
by a top-50 rule from participant submissions. Relevance judgments were combined using,
separately, a majority and a unanimity rule. This results in sets of 50 to 350 relevant sentences
per item for majority pooling and 20 to 260 for unanimity. Rankings were then evaluated against
2In practice, because the relevance score should be increasing, it was not computed as the entropy of the similarity
score distribution, but as its Kullback-Liebler divergence with respect to the maximum entropy distribution with
the same support (uniform).
these sets using standard metrics: Average Precision (AP), R-Precision (R-PREC), Precision at
10 (P@10) and NDCG at 1000 (NDCG@1000). Results are presented in Tables 1 for majority
pooling and 2 for unanimity.</p>
        <p>All our models exhibit poor performance. Across models, results deteriorate for unanimous
relevance judgment, were relevant sentences are scarcer. Transformer models outperformed the
baseline BM25 on all metrics but NDCG@1000. This may be due to the reconciliation of filtered
sentences. When considering a larger number of sentences (e.g. 1000) more sentences with
reconciled are likely to be present. Their equal similarities result in spurious relative order. More
interestingly, continuing pretraining using the SimCSE objective hurts performance for both
pretrained models. Further investigation is required to understand this deterioration.
Domainadapted models appear to produce lower, less varied relevance scores than their counterparts
(mpnetbase: max: 0.59, std: 0.07, mpnetbase_simcse: max: 0.48, std: 0.05 ; mpnetqa: max: 0.72,
std: 0.07, mpnetbase_simcse: max: 0.50, std: 0.06). Their discrepancies, however, go beyond
bias. Examining the agreement between these variants reveals that they share between 400
and 650 sentences across items for mpnetbase and between 400 and 600 for mpnetqa. However,
there is weak correlation in how they rank these common sentences, with mpnetbase and its
domain-adapted variant exhibiting a Spearman coeficient of 0.34 on average across items and
0.30 for mpnetqa. Ultimately, the most limiting factor of our approaches may be the BM25
ifltering step. The baseline BM25 approach obtains poor results on its own ranking of 1000
sentences, which shares only between 50 and 200 sentences per item with each of mpnetbase
and mpnetqa, suggesting it may be a poor proxy for them.</p>
        <p>Team
RELAI
RELAI
RELAI
RELAI</p>
        <p>RELAI
Formula-ML</p>
        <p>Run</p>
        <p>BM25
bm25|mpnetbase
bm25|mpnetbase_simcse</p>
        <p>bm25|mpnetqa
bm25|mpnetqa_simcse
SentenceTransformers_0.25</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Task 2: Early Detection of Signs of Pathological Gambling</title>
      <sec id="sec-3-1">
        <title>3.1. Task and Data</title>
        <p>The training dataset was composed of the test subjects from the 2022 and 2021 gambling task,
namely 2384 subjects, 164 of which writings were positive (6.9%) for 2021, and 2079 subjects,
81 of which writings were positive (3.9%) for 2022. As for the test dataset, it was composed of
2071 subjects of which only 103 writings were positive (5.0%). Overall, considering we cannot
guarantee that writings said positive or negative is really what has been determined [16], this is
extremely unbalanced.</p>
        <p>Team
RELAI
RELAI
RELAI
RELAI</p>
        <p>RELAI
Formula-ML
Formula-ML</p>
        <p>Run</p>
        <p>BM25
bm25|mpnetbase
bm25|mpnetbase_simcse</p>
        <p>bm25|mpnetqa
bm25|mpnetqa_simcse
SentenceTransformers_0.25
SentenceTransformers_0.1</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Approaches and Training</title>
        <p>The best approach from the previous iteration of the task was based on Nearest Neighbor
retrieval [17]. Thus, we decided to explore possibilities with lightweight approaches even
though, admittedly, Transformers approaches fared quite well [18]. The first one is a Stylometry
approach. Building upon the approaches we tested at eRisk 2021 [19], three of our approaches
use Topic Modeling [20] (ETM-50, ETM-50T2022, ETM-300T2022). Our last approach is a
random one.</p>
        <p>Stylometry considers stylometric features as a representation of the writing histories of
subjects. These features include character and word n-gram frequencies, word and sentence lengths
and character class frequencies. From this representation, a multilayer perceptron is trained
to produce a decision. The best features were selected using halving random hyperparameter
search [21], increasing the length of writing histories at each iteration.</p>
        <p>
          ETM-50T, ETM-50T2022, ETM-300T2022 are ensemble approaches using ETM to vectorize.
Using the same approach as [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], ETM is trained for 50 (ETM-50T, ETM-50T2022) and 300
(ETM300T2022) topics on eRisk 2021 data. These representations are fed to two separate decision
models, which must be in (positive) agreement for a positive decision to be made for the textual
production of a given subject. The first one is a multilayer perceptron with 300 neurons per
hidden layer trained on eRisk 2021 (ETM-50T) or on eRisk 2021 and 2022 data (ETM-50T2022,
ETM-300T2022). Since the dataset is unbalanced, the threshold used for the perceptron is
determined based on empirical observations made while testing on the eRisk 2021 dataset,
respectively .34, .34 and .5. The second one is based on the approach we tried at eRisk 2021
[19]: finding the minimal similarity distance to be considered at risk of pathological gambling
by computing the Hellinger distance between a self-evaluation questionnaires3 composed of
20 questions, and 199 testimonials4. The greatest such distance is chosen as a threshold for
classifying textual production as positive. That is, using testimonials as pseudo-examples of
3http://gamontreal.ca/
4https://gamblershelp.com.au/
writing histories from positive textual production, any history at test time found to be closer to
the questionnaire than the farthest testimonial can be assigned a positive label.
Random is a baseline run based on the overall distributions of labels from previous iterations
of the task. The severity of problem gambling symptoms is assumed to lie on some finite,
continuous range. The scores for a given set of subjects is naively set to follow a uniform
distribution such that the share of positive subjects lies beyond a given threshold. Then, the
proportion of positive subjects in the 2021 and 2022 datasets can be used to infer the gamma
distribution from which they emerge (with large error given the small sample size). Sampling
this distribution produces a uniform distribution which was used to attribute scores to subjects
at each round.
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Results and Discussion</title>
        <p>
          Details about the metrics used on tables 3 and 4 can be found in [
          <xref ref-type="bibr" rid="ref14">16, 14, 22</xref>
          ]. While extremely
under performing comparing to others approaches, two of our runs yield better F score than our
Random one. Training our multi layer perceptron on 2022 data does not seem to help in yielding
better results. This is supposedly due to the sheer number of negative subjects comparing to
positive one. A better approach might have been to only add the positive subjects of 2022 to
our training dataset.
        </p>
        <p>System
Stylometry</p>
        <p>ETM-50T
ETM-50T2022
ETM-300T2022</p>
        <p>Random
BioNLP-IISERB</p>
        <p>ELiRF-UPV
UMUTeam</p>
        <p>Two of our approaches got a F1-score of 0 in Table 3, which suggests that these approaches
could not predict one instance of pathological gambling. Considering that the results obtained
with ETM-50 and ETM-50T2022 are not encouraging either, ETM-300T2022 results are probably
due to an overly high threshold (0.5 while other ETM approaches are at .34) rather than the
addition of a dataset. Seemingly, results for stylometry suggest that stylometric features are
not enough to determine whether the textual production is positive or negative. The P@10 at 1
writing Table 4 being higher for stylometry than the other approach is probably because its
scores were slightly diferent but the prediction was the same. Unsurprisingly, the random run
perfomed poorly and ETM-50T approaches yield a slightly better F1 score. Though, considering
the recall is extremely high contrary to the precision it just means that these approaches are
overly biased toward the positive.</p>
        <p>System
Stylometry</p>
        <p>ETM-50T
ETM-50T2022
ETM-300T2022</p>
        <p>Random
ELiRF-UPV</p>
        <p>SINAI</p>
        <p>System
Stylometry</p>
        <p>ETM-50T
ETM-50T2022
ETM-300T2022</p>
        <p>Random
ELiRF-UPV</p>
        <p>SINAI</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>The 2023 edition of the eRisk workshop introduced a new task (Task 1: Search for symptoms of
depression) whose objective is to consider a number of standalone sentences and rank them
according to their relevance to each of the signs and symptoms described in the BDI. While
it is sensible to try to detect sentences germane to the aspects of depression cataloged by the
BDI, such a framework is highly local and may fail to capture the global patterns found in the
writings of an individual. The approach proposed made use of the textual similarity between
the sentences to rank and those found in the BDI items. Given the quantity of documents, this
approach made use of two similarity models, with a lightweight BM25 model selecting the
sentences to be examined by the more complex Transformer model. Future improvements could
incorporate additional filtering steps with less complex models [ 23] and more sophisticated
reconciliation of attrition. Task 2, Early Detection of Signs of Pathological Gambling, was in its
third iteration. Our models appeared to sufer from poor calibration, yielding overtly similar
scores, making decision policies dificult to establish.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>This research was enabled in part by support provided by Calcul Québec and the Digital Research
Alliance of Canada. We acknowledge the support of the Natural Sciences and Engineering
Research Council of Canada (NSERC) [MJ Meurs, NSERC Grant number 06487-2017].
CLEF 2020 - Conference and Labs of the Evaluation Forum, volume 2696, CEUR, 2020.
[16] D. E. Losada, F. A. Crestani, A test collection for research on depression and language use,
in: Conference and Labs of the Evaluation Forum, 2016.
[17] H. Fabregat, A. Duque, L. Araujo, J. Martínez-Romo, Uned-nlp at erisk 2022: Analyzing
gambling disorders in social media using approximate nearest neighbors, in: Conference
and Labs of the Evaluation Forum, 2022.
[18] A. M. Mármol-Romero, S. M. Jiménez-Zafra, F. M. Plaza-del-Arco, M. D. Molina-González,
M.-T. Martín-Valdivia, A. Montejo-Ráez, SINAI at eRisk@CLEF 2022: Approaching Early
Detection of Gambling and Eating Disorders with Natural Language Processing (2022).
[19] M. D. Armstrong, D. Maupomé, M.-J. Meurs, Topic modeling in embedding spaces for
depression assessment, in: Proceedings of the Canadian Conference on Artificial Intelligence,
2021. doi:10.21428/594757db.9e67a9f0.
[20] A. B. Dieng, F. J. R. Ruiz, D. M. Blei, Topic Modeling in Embedding Spaces, Transactions
of the Association for Computational Linguistics 8 (2020) 439–453. doi:10.1162/tacl_
a_00325.
[21] K. Jamieson, A. Talwalkar, Non-stochastic best arm identification and hyperparameter
optimization, in: Artificial intelligence and statistics, PMLR, 2016, pp. 240–248.
[22] D. E. Losada, F. Crestani, J. Parapar, Overview of eRisk 2019: Early risk prediction on
the internet, in: Experimental IR Meets Multilinguality, Multimodality, and Interaction,
Springer International Publishing, Cham, 2019, pp. 340–357.
[23] D. Maupomé, M.-J. Meurs, Contextualizer: Connecting the dots of context with
secondorder attention, Information 13 (2022) 290.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Parapar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Martín-Rodilla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. E.</given-names>
            <surname>Losada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Crestani</surname>
          </string-name>
          , Overview of eRisk 2023:
          <article-title>Early risk prediction on the Internet, in: Experimental IR Meets Multilinguality, Multimodality, and Interaction</article-title>
          .
          <source>14th International Conference of the CLEF Association, CLEF 2023</source>
          , Springer International Publishing, Thessaloniki, Greece,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A. T.</given-names>
            <surname>Beck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. A.</given-names>
            <surname>Steer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. K.</given-names>
            <surname>Brown</surname>
          </string-name>
          ,
          <article-title>Beck Depression Inventory (BDI-II)</article-title>
          ,
          <source>Psychological assessment 10</source>
          (
          <year>1996</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Sperber</surname>
          </string-name>
          , D. Wilson, Relevance: Communication and Cognition, 2nd ed.,
          <source>Blackwell</source>
          , Oxford,
          <year>1986</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>C.</given-names>
            <surname>Roberts</surname>
          </string-name>
          , Information Structure in Discourse:
          <article-title>Towards an Integrated Formal Theory of Pragmatics</article-title>
          , in: OSU Working Papers in Linguistics, volume
          <volume>49</volume>
          : Papers in Semantics,
          <source>Jae Haek Yoon and Andreas Kathol</source>
          ,
          <year>1996</year>
          , pp.
          <fpage>91</fpage>
          -
          <lpage>136</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>N.</given-names>
            <surname>Asher</surname>
          </string-name>
          , Reference to abstract objects in discourse, Kluwer, Dordrecht,
          <year>1993</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>N.</given-names>
            <surname>Asher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lascarides</surname>
          </string-name>
          , Logics of Conversation, Cambridge University Press, Cambridge,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Merin</surname>
          </string-name>
          , Information, Relevance and
          <string-name>
            <given-names>Social</given-names>
            <surname>Decision-Making</surname>
          </string-name>
          , in: L.
          <string-name>
            <surname>Moss</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Ginzburg</surname>
          </string-name>
          , M. de Rijke (Eds.), Logic, Language, and computation, volume
          <volume>2</volume>
          ,
          <string-name>
            <given-names>CSLI</given-names>
            <surname>Publications</surname>
          </string-name>
          , Stanford,
          <year>1999</year>
          , pp.
          <fpage>179</fpage>
          -
          <lpage>221</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>H. P.</given-names>
            <surname>Grice</surname>
          </string-name>
          ,
          <article-title>Studies in the Way of Words</article-title>
          , Harvard University Press, Cambridge,
          <year>1989</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>K.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Qin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lu</surname>
          </string-name>
          , T.-Y. Liu,
          <article-title>Mpnet: Masked and permuted pre-training for language understanding</article-title>
          ,
          <source>in: Proceedings of the 34th International Conference on Neural Information Processing Systems</source>
          , NIPS'20, Curran Associates Inc.,
          <string-name>
            <surname>Red</surname>
            <given-names>Hook</given-names>
          </string-name>
          ,
          <string-name>
            <surname>NY</surname>
          </string-name>
          , USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Parapar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Martín-Rodilla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. E.</given-names>
            <surname>Losada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Crestani</surname>
          </string-name>
          , eRisk
          <year>2022</year>
          :
          <article-title>Pathological gambling, depression, and eating disorder challenges</article-title>
          ,
          <source>in: Advances in Information Retrieval</source>
          , Springer International Publishing, Cham,
          <year>2022</year>
          , pp.
          <fpage>436</fpage>
          -
          <lpage>442</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Trotman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Puurula</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Burgess</surname>
          </string-name>
          ,
          <article-title>Improvements to bm25 and language models examined</article-title>
          ,
          <source>in: Proceedings of the 19th Australasian Document Computing Symposium</source>
          , ADCS '14,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2014</year>
          , p.
          <fpage>58</fpage>
          -
          <lpage>65</lpage>
          . doi:
          <volume>10</volume>
          .1145/ 2682862.2682863.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>M. D. Armstrong</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Maupomé</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.-J. Meurs</surname>
          </string-name>
          ,
          <article-title>Topic models for assessment of mental health issues</article-title>
          ,
          <source>in: Proceedings of the Canadian Conference on Artificial Intelligence</source>
          ,
          <year>2021</year>
          . doi:
          <volume>10</volume>
          .21428/594757db.
          <fpage>27574943</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>T.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Yao</surname>
          </string-name>
          , D. Chen,
          <article-title>SimCSE: Simple contrastive learning of sentence embeddings</article-title>
          ,
          <source>in: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing</source>
          , Association for Computational Linguistics, Online and
          <string-name>
            <given-names>Punta</given-names>
            <surname>Cana</surname>
          </string-name>
          , Dominican Republic,
          <year>2021</year>
          , pp.
          <fpage>6894</fpage>
          -
          <lpage>6910</lpage>
          . URL: https://aclanthology.org/
          <year>2021</year>
          .emnlp-main.
          <volume>552</volume>
          . doi:
          <volume>10</volume>
          .18653/ v1/
          <year>2021</year>
          .emnlp-main.
          <volume>552</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>D. E.</given-names>
            <surname>Losada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Crestani</surname>
          </string-name>
          , J. Parapar, eRisk
          <year>2020</year>
          :
          <article-title>Self-harm and depression challenges</article-title>
          ,
          <source>in: Advances in Information Retrieval</source>
          , Springer International Publishing, Cham,
          <year>2020</year>
          , pp.
          <fpage>557</fpage>
          -
          <lpage>563</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>D.</given-names>
            <surname>Maupomé</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. D.</given-names>
            <surname>Armstrong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Alezot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Balassiano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Queudot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mosser</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.-J. Meurs</surname>
          </string-name>
          ,
          <article-title>Early mental health risk assessment through writing styles, topics and neural models</article-title>
          , in:
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>