<!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>UDII-UPM at TalentCLEF 2025: Task A-Multilingual Job Title Matching</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Javier Rodríguez-Vidal</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ascensión López-Vargas</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pablo Manuel Vigara Gallego</string-name>
          <email>pm.vigara@upm.es</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Francisco Javier Del Álamo</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ángel García-Beltrán</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Departamento de Automática, Ingeniería Eléctrica y Electrónica e Informática Industrial, Escuela Técnica Superior de Ingenieros Industriales, Universidad Politécnica de Madrid</institution>
          ,
          <addr-line>28006 Madrid</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper describes the participation of the Unidad Docente de Informática Industrial at the Universidad Politécnica de Madrid (UDII-UPM) in TalentCLEF 2025, a competitive evaluation campaign focused on Human Resources. We addressed Task A: Multilingual Job Title Matching, which aims to develop systems capable of identifying and ranking job titles that are most similar to a given query title. Our approach is based on the fusion of semantic representations generated by two diferent multilingual embedding models. First, we compute pairwise similarities between query and candidate job titles. Then, we apply a weighted combination of the resulting similarity scores to produce a final ranked list of job titles for each query. The proposed method is simple, language-adaptable and does not require fine-tuning. Oficial results confirm that our system is competitive although there is still room for improvement in the ranking quality and model alignment across languages.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Human Capital Management</kwd>
        <kwd>Human Resources</kwd>
        <kwd>Embeddings</kwd>
        <kwd>Ranking</kwd>
        <kwd>Information Retrieval</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Experimental Framework</title>
      <p>In this section, we give an overview of the Job Title Matching dataset, the methods used, how the run
delivered was set up, and the evaluation metric used in the lab.</p>
      <sec id="sec-2-1">
        <title>2.1. Multilingual Job Title Matching corpus</title>
        <p>
          The corpus [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] consisted of training, validation and test job title data divided in three main languages:
English, Spanish and German; validation and test also contains information in Chinese. The training
data contains 4 columns: i) the ISCO id representing the group to which the job identifier belongs; ii)
the ESCO id indicating the origin of the pair’s job titles; iii) the first job title in the pair and iv) a second
job title related to the previous one. The statistics of this part of the dataset are shown in Table 1.
        </p>
        <p>The validation data are divided into four languages, the three in the training data and Chinese. This
set contains: i) a file that contains the job title used as a query and the associated id ( queries); ii) the
job title in the corpus and its id (corpus_elements) and iii) the relationships between the query and the
corpus elements (qrels). The statistics of the validation part of the dataset are shown in Table 2.</p>
        <p>The test data has four languages, as the validation set, and the provided files: i) contains the job title
used as a query and the associated id (queries) and ii) contains the job title in the corpus and its id (
corpus_elements). The statistics of the test part of the dataset are shown in Table 3.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Methods</title>
        <p>
          This study uses two learning algorithms as a starting point for future work. In particular, the following
algorithms have been used:
• Masked and Permuted Language Modeling (MPNET) [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] based on the BERT architecture
[
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] and uses Siamese and Triplet network structures to extract sentence embeddings that can
be compared using cosine similarity. The Siamese network is used to determine whether two
sentences are similar, while the Triplet network uses three sentences: an anchor, a positive
(similar), and a negative (dissimilar). The model compares the distance between the anchor and
the positive sentence and between the anchor and the negative one. It learns to bring similar
sentences closer together and push dissimilar ones farther apart.
• DistilUSE [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]: is a multilingual sentence embedding model based on the DistilBERT [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]
architecture, a lighter and faster version of BERT. It supports over 50 languages and is trained
to produce semantically meaningful sentence embeddings that can be compared using cosine
similarity. While it does not rely on Siamese or Triplet networks during training, it performs well
in semantic similarity tasks and multilingual sentence matching, especially when computational
eficiency is important.
        </p>
        <p>These models were used via HuggingFace2</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Setting up the run</title>
        <p>Our proposal consists of the weighted combination of the similarities produced by the models mentioned
in section 2.2. To achieve this, each model individually generates embeddings for the provided texts.
Then, a similarity matrix is computed between the query texts and the corpus elements, and these
similarities are fused according to the following equation:
_  =  × _ + (1 −  ) × _
(1)
where,  are the fusion weights, empirically determined for each language, described in Table 4;
similarity_mpnet is the similarity between queries and corpus texts using mpnet embeddings and
similarity_distiluse is the similarity between queries and corpus texts using distiluse embeddings.</p>
        <p>Finally, the output ranking of documents is generated by sorting them in descending order of
similarity.</p>
      </sec>
      <sec id="sec-2-4">
        <title>2.4. Evaluation Metric</title>
        <p>To evaluate our approach during the development phase, we used the oficial evaluation script provided
by the organizers.3 The final performance was assessed using the Mean Average Precision (MAP) metric
[6].</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Results &amp; Discussion</title>
      <p>2https://huggingface.co/
3https://github.com/TalentCLEF/talentclef25_evaluation_script</p>
      <p>Based on the results, our system consistently obtains better results than the baseline; however, these
results are far from the system that achieved the best results. This may happen because our system
does not perform a training step prior to the generation of the embeddings so the methods used here
are not adapted to the task. Also, as can be seen from the results, the language with which we have
encountered the most problems is German, which may be due to the fact that it is the language with
the most number of queries and corpus texts. If we observed the rest of the oficial results provided in
Table 5 the other systems also had problems with this language.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Future Work</title>
      <p>In this work udii-upm team provides information of its participation at TalentCLEF 2025, Task
AMultilingual Job Title Matching. The system presented in this task provides a good starting point for
future developments which includes: i) train the models with the training data provided in the corpus;
ii) explore in depth the problems presented in the German language in order to improve the results and
iii) to explore of monolingual models instead of multilingual ones.</p>
    </sec>
    <sec id="sec-5">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the authors used GPT-4o mini in order to: Grammar and spelling
check.
[6] H. Schütze, C. D. Manning, P. Raghavan, Introduction to information retrieval, volume 39, Cambridge
University Press Cambridge, 2008.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>L.</given-names>
            <surname>Gasco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Fabregat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>García-Sardiña</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Estrella</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Deniz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rodrigo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zbib</surname>
          </string-name>
          ,
          <article-title>Overview of the TalentCLEF 2025 Shared Task: Skill and Job Title Intelligence for Human Capital Management, in: International Conference of the Cross-Language Evaluation Forum for European Languages</article-title>
          , Springer,
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>L.</given-names>
            <surname>Gascó</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Hermenegildo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.-S.</given-names>
            <surname>Laura</surname>
          </string-name>
          , D. C. Daniel, P. Estrella,
          <string-name>
            <given-names>R.</given-names>
            <surname>Alvaro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Rabih</surname>
          </string-name>
          ,
          <article-title>Talentclef 2025 corpus: Skill and job title intelligence for human capital management, 2025</article-title>
          . URL: https: //doi.org/10.5281/zenodo.15292308. doi:
          <volume>10</volume>
          .5281/zenodo.15292308.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <article-title>Sentence-bert: Sentence embeddings using siamese bert-networks</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics</source>
          ,
          <year>2019</year>
          . URL: http://arxiv.org/abs/
          <year>1908</year>
          .10084.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <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>
          , in: J.
          <string-name>
            <surname>Burstein</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Doran</surname>
          </string-name>
          , T. Solorio (Eds.),
          <source>Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers),
          <source>Association for Computational Linguistics</source>
          , Minneapolis, Minnesota,
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          . URL: https://aclanthology.org/N19-1423/. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>N19</fpage>
          -1423.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>V.</given-names>
            <surname>Sanh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Debut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chaumond</surname>
          </string-name>
          , T. Wolf,
          <article-title>Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter</article-title>
          , ArXiv abs/
          <year>1910</year>
          .01108 (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>