Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Engage Grants Program

Université Laval

$25,000.00

Learning a taxonomy of job market skills from textual resources

FY 2018-19

Summary
The objective of this project consists of designing tools, using natural language processing and machine learning algorithms, to build automatically a taxonomy using the various skills accumulated in the databases of our industrial partner. This refers to the problem of taxonomy learning (also called taxonomy extraction), which consists of determining the concepts that supersede some others based on a corpus of text providing examples of how concepts might be related together. We will propose models, based on deep learning networks, to incorporate pattern-based features as well as distributional features to determine if two skills are related together. To determine candidate hypernyms that should be considered for a more detailed analysis, morphological analysis as well as statistical analysis (ex. co-occurrence analysis) will be applied. We will construct, train and compare different recurrent models to determine the architectures that are more suited to detect skills that are interrelated together. Distributional representations (i.e. word embeddings) for most of the skills present in the corporate database will be built. We will also extend current approaches to represent out of vocabulary words and compound terms. *
Program
Engage Grants Program
Location
Quebec, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
532040-2018
Name nom
Lamontagne, Luc
Department département
Informatique et de génie logiciel
Organization id
51
Institution établissement
Université Laval
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2018
Competition year année de concours
2018
Award amount
25000
Program id
EGP
Program name en
Engage Grants Program
Program name fr
Programme de subventions d'engagement partenariat
Group en
Research partnerships programs
Group fr
Programmes de partenariat
Committee code
1552
Committee name en
Quebec Internal Decision Committee
Committee name fr
Comité de décision interne pour le Québec
Area of application code
802
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Information systems and technology
Area of application fr
Systèmes d'information et technologie de l'information
Research subject code
2800
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Artificial intelligence (computer vision, use2603)
Research subject fr
Intelligence artificielle (vision artificielle, utiliser 2603)
Partie
1
Nb partie
1
Application title
Learning a taxonomy of job market skills from textual resources
Keyword
NSERC
Application summary
The objective of this project consists of designing tools, using natural language processing and machine learning algorithms, to build automatically a taxonomy using the various skills accumulated in the databases of our industrial partner. This refers to the problem of taxonomy learning (also called taxonomy extraction), which consists of determining the concepts that supersede some others based on a corpus of text providing examples of how concepts might be related together. We will propose models, based on deep learning networks, to incorporate pattern-based features as well as distributional features to determine if two skills are related together. To determine candidate hypernyms that should be considered for a more detailed analysis, morphological analysis as well as statistical analysis (ex. co-occurrence analysis) will be applied. We will construct, train and compare different recurrent models to determine the architectures that are more suited to detect skills that are interrelated together. Distributional representations (i.e. word embeddings) for most of the skills present in the corporate database will be built. We will also extend current approaches to represent out of vocabulary words and compound terms. *