JobMatchAI - An Intelligent Job Matching Platform Using Knowledge Graphs, Semantic Search and Explainable AI (2026.acl-demo)
Copied to clipboard
| Challenge: | Recruiters and job seekers rely on search systems to navigate labor markets . many systems fail to handle skill synonyms and nonlinear careers . |
| Approach: | They propose a production-ready system that integrates Transformer embeddings, skill knowledge graphs, and interpretable reranking. |
| Outcome: | The proposed system optimizes utility across skill fit, experience, location, salary, and company preferences. |
Similar Papers
CareerPathKG: Knowledge Graph Integrated Framework for Career Intelligence (2026.eacl-industry)
Copied to clipboard
| Challenge: | a new framework for career orientation is needed to address the challenges of the labor market . a recent study found that traditional ML and large language models are brittle when faced with heterogeneous job descriptions . |
| Approach: | They propose a career-path knowledge graph-based recruitment framework to capture occupations, skill requirements and career transitions using standardized taxonomies enriched with job-posting data. |
| Outcome: | The proposed framework captures occupations, skill requirements, and career transitions using standardized taxonomies enriched with job-posting data. |
Identify, Align, and Integrate: Matching Knowledge Graphs to Commonsense Reasoning Tasks (2021.eacl-main)
Copied to clipboard
| Challenge: | Empirically, we investigate KG matches for the SocialIQA, Physical IQA, and MCScript2.0 datasets with 3 diverse KGs: ATOMIC (SIQA), ConceptNet (Speer et al., 2017), and an automatically constructed instructional KG based on WikiHow (Ostermann e., 2019b). |
| Approach: | They propose a method to assess how well a candidate KG can fill in knowledge gaps for a given task by using commonsense probes. |
| Outcome: | Empirically, we show that the proposed KG-to-task match is a good match for socialIQA, physical IQA, and MCScript2.0 datasets with 3 diverse KGs: ATOMIC, ConceptNet, and an instructional KG based on WikiHow. |
SEEK: Segmented Embedding of Knowledge Graphs (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for knowledge graph embedding can not make a proper trade-off between the model complexity and the model expressiveness, which makes them far from satisfactory. |
| Approach: | They propose a lightweight modeling framework that can achieve highly competitive relational expressiveness without increasing the model complexity. |
| Outcome: | The proposed framework can achieve highly competitive relational expressiveness without increasing model complexity. |
FASTMATCH: Accelerating the Inference of BERT-based Text Matching (2020.coling-main)
Copied to clipboard
| Challenge: | Recent pre-trained language models have shown state-of-the-art accuracies in text matching. |
| Approach: | They propose a BERT-based text matching model where representations and interactions are decoupled . they propose generating final matching scores using a lightweight attention network . |
| Outcome: | Experiments show that the proposed model can achieve up to 100X speed-up to BERT and RoBERTa while keeping more up to 98.7% of the performance. |
REMATCH: Robust and Efficient Matching of Local Knowledge Graphs to Improve Structural and Semantic Similarity (2024.findings-naacl)
Copied to clipboard
| Challenge: | Existing AMR metrics are inefficient and struggle to capture semantic similarity . Existing metrics are not efficient and lack a systematic evaluation benchmark . |
| Approach: | They propose a new AMR similarity metric, rematch, which matches graphs structurally and semantically to each other. |
| Outcome: | The proposed metric is five times faster than the next most efficient metric. |
Learning Job Title Representation from Job Description Aggregation Network (2024.findings-acl)
Copied to clipboard
Napat Laosaengpha, Thanit Tativannarat, Chawan Piansaddhayanon, Attapol Rutherford, Ekapol Chuangsuwanich
| Challenge: | Existing methods for learning job title representation neglect the rich content within the job description. |
| Approach: | They propose a framework for learning job titles through their respective job description and utilize a Job Description Aggregator component to handle the lengthy description and bidirectional contrastive loss. |
| Outcome: | The proposed framework outperforms the skill-based approach on in-domain and out-of-domain settings and achieving a superior performance. |
ConFit v2: Improving Resume-Job Matching using Hypothetical Resume Embedding and Runner-Up Hard-Negative Mining (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to model resume-job fit are sparse since job seekers apply to only a few jobs. |
| Approach: | They propose two techniques to enhance the encoder’s contrastive training process by augmenting job data with hypothetical reference resume generated by a large language model and creating high-quality hard negatives from unlabeled resume/job pairs using a novel hard-negative mining strategy. |
| Outcome: | The proposed method outperforms ConFit and prior methods on two real-world datasets and achieves an average improvement of 13.8% in recall and 17.5% in nDCG across job-ranking and resume-ranker tasks. |
Enhancing Talent Search Ranking with Role-Aware Expert Mixtures and LLM-based Fine-Grained Job Descriptions (2025.emnlp-industry)
Copied to clipboard
| Challenge: | Existing talent search approaches fail to capture nuanced job-specific preferences and mitigate noise from subjective human judgments. |
| Approach: | They propose a framework that extracts fine-grained recruitment signals from job descriptions and historical hiring data and employs a role-aware multi-gate MoE network to capture behavioral differences across recruiter roles. |
| Outcome: | The proposed framework improves talent search effectiveness and delivers substantial business value. |
DeezyMatch: A Flexible Deep Learning Approach to Fuzzy String Matching (2020.emnlp-demos)
Copied to clipboard
| Challenge: | DeezyMatch is a free, open-source software library written in Python for fuzzy string matching and candidate ranking. |
| Approach: | They propose to use DeezyMatch to train new classifiers and fine-tune a pretrained model to generate rich vector representations from string inputs. |
| Outcome: | The proposed algorithm can be used to find the best matching candidates in large knowledge bases and query sets. |
MATCH: Task-Driven Code Evaluation through Contrastive Learning (2025.findings-emnlp)
Copied to clipboard
| Challenge: | GitHub Copilot generates 46% of the code on GitHub. |
| Approach: | They propose a reference-free metric that uses Contrastive Learning to generate meaningful embeddings for code and natural language task descriptions. |
| Outcome: | This paper compares the performance of a new similarity score with existing metrics. |