This shows you the differences between two versions of the page.
Next revision | Previous revision Next revision Both sides next revision | ||
job-2016-ligm-alpage-phd [2016/04/04 10:49] marie.candito created |
job-2016-ligm-alpage-phd [2016/05/26 21:52] matthieu.constant |
||
---|---|---|---|
Line 1: | Line 1: | ||
- | blabla | + | The University of Paris-Est Marne-la-Vallée offers a PhD position in computational linguistics. |
+ | |||
+ | ===== Integrating Multiword Expressions at the heart of statistical syntactic and semantic analysis ===== | ||
+ | |||
+ | |||
+ | * **Application deadline (or until fulfilled): | ||
+ | * **Field:** natural language processing/ | ||
+ | * **Location: | ||
+ | * **Supervisor**: | ||
+ | * **Co-supervisor**: | ||
+ | * **Duration: | ||
+ | * **Remuneration: | ||
+ | * **Funding: | ||
+ | * **Keywords**: | ||
+ | |||
+ | ----------------- | ||
+ | ==== Context ==== | ||
+ | |||
+ | The proposed PhD thesis falls into the field of natural language processing at the crossroads of computer science and linguistics. In particular, it will focus on processing of multiword expressions, | ||
+ | This PhD proposal holds in the framework of the ANR-funded PARSEME-FR project that aims at widely integrating such expressions into syntactic and semantic parsers. | ||
+ | |||
+ | ----------------- | ||
+ | ==== Profile ==== | ||
+ | |||
+ | * Master in computer science or computational linguistics | ||
+ | * Good knowledge of French and English, another language would be a plus | ||
+ | * Interests in linguistics and familiarity with language technology | ||
+ | * Capacity to work independently and as part of a team | ||
+ | |||
+ | |||
+ | --------------------- | ||
+ | ==== Application ==== | ||
+ | |||
+ | Candidates should send the following documents in PDF format, in French or in English, to Mathieu Constant (FirstName.LastName@u-pem.fr) and Marie Candito (FirstName.LastName@linguist.univ-paris-diderot.fr) | ||
+ | * CV | ||
+ | * Cover letter | ||
+ | * Transcript of MSc and BSc grades (translated if not in French or English) | ||
+ | * Reference letters would be a plus | ||
+ | |||
+ | ------------------------------ | ||
+ | ==== Hosting Institutions ==== | ||
+ | |||
+ | === Main affiliation === | ||
+ | |||
+ | * **Laboratory**: | ||
+ | * **University**: | ||
+ | |||
+ | === Secondary affiliation === | ||
+ | |||
+ | * **Laboratory**: | ||
+ | * **Institutions**: | ||
+ | |||
+ | ------------------------------- | ||
+ | ==== Scientific description ==== | ||
+ | |||
+ | This PhD thesis aims at revisiting statistical syntactic and semantic analysis in the light of multiword expressions. More precisely, it falls within the framework of linear-time dependency parsing. | ||
+ | |||
+ | Taking multiword expressions into account is a challenge for automatic text analysis, mainly due to their non-compositionality, | ||
+ | Given this new representation, | ||
+ | Priority will be given to a system that jointly performs both MWE identification and syntactic parsing, in such a way both tasks can mutually inform each other. Multiword expressions generally representing semantic units, a natural extension of this joint system is to develop a system that automatically constructs | ||
+ | |||
+ | The developed parsers should combine two features: speed and accuracy. To reach high accuracy, joint prediction can enable the system to benefit from richer linguistic information at analysis time. Further, the use of deep learning techniques and large-scale MWE resources can be investigated. Yet this sophistication comes at the cost of increased complexity and ambiguity. A possible solution is to add constraints reducing search space. Finally, we wish the proposed solutions to have (quasi-)linear speed complexity, in order to reasonably consider parsing big textual data. | ||
+ | |||
+ | This thesis will be in collaboration with Joakim Nivre (Univ. Uppsala, Sweden), in the framework of the European COST Action PARSEME. | ||
+ | |||
+ | ------------------------- | ||
+ | ==== Bibliography ==== | ||
+ | |||
+ | |||
+ | * [[ http:// | ||
+ | * [[ http:// | ||
+ | * [[ https:// |