mlsanityData to 7 Oct 2026

CareerBERT: Matching Resumes to ESCO Jobs in a Shared Embedding Space for Generic Job Recommendations

arXiv 2503.02056 ↗First posted 3 Mar 2025cs.LG cs.CLcited by 5

Not on the map. Why?

Abstract (arXiv)

The rapidly evolving labor market, driven by technological advancements and economic shifts, presents significant challenges for traditional job matching and consultation services. In response, we introduce an advanced support tool for career counselors and job seekers based on CareerBERT, a novel approach that leverages the power of unstructured textual data sources, such as resumes, to provide more accurate and comprehensive job recommendations. In contrast to previous approaches that primarily focus on job recommendations based on a fixed set of concrete job advertisements, our approach involves the creation of a corpus that combines data from the European Skills, Competences, and Occupations (ESCO) taxonomy and EURopean Employment Services (EURES) job advertisements, ensuring an up-to-date and well-defined representation of general job titles in the labor market. Our two-step evaluation approach, consisting of an application-grounded evaluation using EURES job advertisements and a human-grounded evaluation using real-world resumes and Human Resources (HR) expert feedback, provides a comprehensive assessment of CareerBERT's performance. Our experimental results demonstrate that CareerBERT outperforms both traditional and state-of-the-art embedding approaches while showing robust effectiveness in human expert evaluations. These results confirm the effectiveness of CareerBERT in supporting career consultants by generating relevant job recommendations based on resumes, ultimately enhancing the efficiency of job consultations and expanding the perspectives of job seekers. This research contributes to the field of NLP and job recommendation systems, offering valuable insights for both researchers and practitioners in the domain of career consulting and job matching.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 20 of its 52 references that are in the map. First posted on arXiv 3 Mar 2025.

Builds on

20 of 52 references.

References · 20

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  3. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
  4. 2020Don't Stop Pretraining: Adapt Language Models to Domains and Taskscited by 1,548
  5. 2017Towards A Rigorous Science of Interpretable Machine Learningcited by 1,400
  6. 2019How multilingual is Multilingual BERT?cited by 642
  7. 2020German's Next Language Modelcited by 144
  8. 2023Generative AIcited by 119
  9. 2021TSDAE: Using Transformer-based Sequential Denoising Auto-Encoder for Unsupervised Sentence Embedding Learningcited by 116
  10. 2021ClimateBert: A Pretrained Language Model for Climate-Related Textcited by 89
  11. 2021JobBERT: Understanding Job Titles through Skillscited by 29
  12. 2023ESCOXLM-R: Multilingual Taxonomy-driven Pre-training for the Job Market Domaincited by 14
8 more
  1. 2023Enhancing Job Recommendation through LLM-based Generative Adversarial Networkscited by 14
  2. 2021conSultantBERT: Fine-tuned Siamese Sentence-BERT for Matching Jobs and Job Seekerscited by 13
  3. 2021Embedding-based Recommender System for Job to Candidate Matching on Scalecited by 11
  4. 2023SkillGPT: a RESTful API service for skill extraction and standardization using a Large Language Modelcited by 11
  5. 2023MEDBERT.de: A Comprehensive German BERT Model for the Medical Domaincited by 10
  6. 2019End-to-End Resume Parsing and Finding Candidates for a Job Description using BERTcited by 7
  7. 2022Lbl2Vec: An Embedding-Based Approach for Unsupervised Document Retrieval on Predefined Topicscited by 7
  8. 2022A Survey of Text Representation Methods and Their Genealogycited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 2.

5 papers.