{"id":2209,"date":"2022-03-16T09:33:05","date_gmt":"2022-03-16T08:33:05","guid":{"rendered":"https:\/\/u-paris.fr\/linguistique\/?page_id=2209"},"modified":"2025-12-03T11:23:26","modified_gmt":"2025-12-03T10:23:26","slug":"pre-requisites-for-the-computational-linguistics-program","status":"publish","type":"page","link":"https:\/\/u-paris.fr\/linguistique\/en\/pre-requisites-for-the-computational-linguistics-program\/","title":{"rendered":"Pre-requisites for the Computational Linguistics program"},"content":{"rendered":"<p>[et_pb_section fb_built=\u00a0\u00bb1&Prime; _builder_version=\u00a0\u00bb3.22&Prime;][et_pb_row _builder_version=\u00a0\u00bb3.22&Prime; background_size=\u00a0\u00bbinitial\u00a0\u00bb background_position=\u00a0\u00bbtop_left\u00a0\u00bb background_repeat=\u00a0\u00bbrepeat\u00a0\u00bb][et_pb_column type=\u00a0\u00bb4_4&Prime; _builder_version=\u00a0\u00bb3.0.47&Prime;][et_pb_post_title meta=\u00a0\u00bboff\u00a0\u00bb featured_image=\u00a0\u00bboff\u00a0\u00bb admin_label=\u00a0\u00bbTitre de la page\u00a0\u00bb _builder_version=\u00a0\u00bb3.22.1&Prime;][\/et_pb_post_title][\/et_pb_column][\/et_pb_row][et_pb_row _builder_version=\u00a0\u00bb3.22&Prime; background_size=\u00a0\u00bbinitial\u00a0\u00bb background_position=\u00a0\u00bbtop_left\u00a0\u00bb background_repeat=\u00a0\u00bbrepeat\u00a0\u00bb][et_pb_column type=\u00a0\u00bb3_4&Prime; _builder_version=\u00a0\u00bb3.0.47&Prime;][et_pb_text module_id=\u00a0\u00bbcontenu\u00a0\u00bb _builder_version=\u00a0\u00bb3.22.1&Prime; z_index_tablet=\u00a0\u00bb500&Prime;]<\/p>\n<div class=\"page\" title=\"Page 1\">\n<div class=\"layoutArea\">\n<div class=\"column\">\n<p>Due to its multi-disciplinary character, candidates for this Master&rsquo;s degree can have different profiles: we welcome either students with a main training in linguistics but with knowledge and interest in computer science and mathematics, or students trained in computer science but interested in linguistics and the formal organisation of languages.<\/p>\n<p>Note though access to M1 and even more for M2 comes with <strong>pre-requisites<\/strong> and \u00ab\u00a0<strong>advantages<\/strong>\u00a0\u00bb summarized below. Prerequisites are skills validated through academic training at the corresponding level. \u201cAdvantages\u201d are skills that are helpful for success in the programme, even if they are not formally required.<\/p>\n<p>Most students join the Master\u2019s programme in the first year (M1), with around 25 places available each year. Direct admissions into the second year (M2) are rare: generally, only one place is offered, and it is not always filled.<\/p>\n<p>All courses in the Master\u2019s programme are taught in <strong>English<\/strong>. You do not need to provide a language certificate, but you must be sufficiently comfortable to attend classes, take exams, write lab reports, and give presentations in English.<\/p>\n<p>Contact the head of M1 year (see below) if you wish to discuss your application.<\/p>\n<\/div>\n<\/div>\n<\/div>\n<p>[\/et_pb_text][\/et_pb_column][et_pb_column type=\u00a0\u00bb1_4&Prime; _builder_version=\u00a0\u00bb3.0.47&Prime;][\/et_pb_column][\/et_pb_row][et_pb_row _builder_version=\u00a0\u00bb3.22&Prime; background_size=\u00a0\u00bbinitial\u00a0\u00bb background_position=\u00a0\u00bbtop_left\u00a0\u00bb background_repeat=\u00a0\u00bbrepeat\u00a0\u00bb][et_pb_column type=\u00a0\u00bb3_4&Prime; _builder_version=\u00a0\u00bb3.0.47&Prime;][et_pb_toggle title=\u00a0\u00bbPre-requisites to enter the Computational Linguistics&rsquo; master (M1 \/ M2)\u00a0\u00bb admin_label=\u00a0\u00bbToggle\u00a0\u00bb _builder_version=\u00a0\u00bb3.22.1&Prime; z_index_tablet=\u00a0\u00bb500&Prime;]<\/p>\n<p>In general, the prerequisites to enter the first year (M1 CL) correspond to the formal courses taught in the <a href=\"https:\/\/u-paris.fr\/linguistique\/licence-sdl\/\">L3 LTEI<\/a> program (linguistics courses plus python programming, algorithmics, linear algebra and probability theory). If you speak French, following this programme is a good way to acquire these prerequisites. For M2, the prerequisites correspond to the courses taught in M1.<\/p>\n<p><b>Please note<\/b>: the application to L3 is independent from the application to M1. It is entirely possible to apply to both programmes; you simply need to submit two separate applications.<\/p>\n<ul>\n<li><strong>M1 CL<\/strong>:\n<ul>\n<li><strong>Computer Science<\/strong>:\n<ul>\n<li>Prerequisites: Python programming, object-oriented programming, algorithms. Students are expected to have a good command of Python (in particular: understanding variables, control statements, data structures, file handling, object-oriented programming, recursive programming, and trees).<\/li>\n<li><strong>To (self-)evaluate your ability to follow the courses<\/strong>, you will find an example of questions <a href=\"https:\/\/www.linguist.univ-paris-diderot.fr\/~mcandito\/divers\/M1CL_self_evaluation_python.pdf\">HERE<\/a> (including the links to the required data). Students in the CL track are expected to be able to solve all these questions from the very beginning of the academic year.<\/li>\n<\/ul>\n<\/li>\n<li>Linguistics:\n<ul>\n<li>\u00a0Prerequisites: none<\/li>\n<li>Advantages: general linguistics, phonetics, phonology, morphology, semantics<\/li>\n<\/ul>\n<\/li>\n<li>Mathematics:\n<ul>\n<li>Prerequisites<b>:<\/b> basic notions of probability and statistics, linear algebra<\/li>\n<li>Advantages<b>:<\/b> formal language theory (finite automata and regular expressions)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<\/li>\n<li>M2 CL:\n<ul>\n<li>Prerequisites<b>:<\/b>\n<ul>\n<li>Computer Science<b>:<\/b> advanced programming (including knowledge of pandas, scikit-learn, PyTorch, HuggingFace \ud83e\udd17), algorithms<\/li>\n<li>Linguistics<b>:<\/b> notions of general linguistics, fundamental knowledge of phonetics, phonology, grammar, formal syntax, formal semantics<\/li>\n<li>Statistical learning: basic principles of supervised classification and regression, neural networks, backpropagation, static and contextual word embeddings, transformer architecture, pretrained language models of the encoder type (such as BERT) and decoder type (such as GPT), design of an LLM (neural scaling laws, instruction fine-tuning, etc.)<\/li>\n<\/ul>\n<\/li>\n<li>Advantages\n<ul>\n<li>Knowledge of the NLP field<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>[\/et_pb_toggle][et_pb_toggle title=\u00a0\u00bbA few references in NLP \/ mathematics \/ computer science\u00a0\u00bb _builder_version=\u00a0\u00bb3.22.1&Prime; z_index_tablet=\u00a0\u00bb500&Prime;]<\/p>\n<p>Here are some additional tips to help students prepare for the Master&rsquo;s program so that it runs as smoothly as possible:<\/p>\n<ul>\n<li>Programming:\n<ul>\n<li>most lab sessions in M2 use python. Being able to easily handle corpora, data structures in python is required.<\/li>\n<li>To (self-)assess your ability to follow the courses, you will find sample questions <a href=\"https:\/\/www.linguist.univ-paris-diderot.fr\/~mcandito\/divers\/M1CL_self_evaluation_python.pdf\"><strong>HERE<\/strong><\/a> (including links to the necessary data). Students in the CL program are expected to be able to solve all of these problems from the beginning of the year.<\/li>\n<\/ul>\n<\/li>\n<li>Maths:\n<ul>\n<li><a href=\"https:\/\/www.khanacademy.org\/math\/statistics-probability\/probability-library\/basic-theoretical-probability\/a\/probability-the-basics\">basic probability theory<\/a>, <a href=\"https:\/\/www.khanacademy.org\/math\/linear-algebra\">basic linear algebra<\/a><\/li>\n<\/ul>\n<\/li>\n<li>NLP and computational linguistics\n<ul>\n<li>The <a href=\"https:\/\/web.stanford.edu\/~jurafsky\/slp3\/\">Jurafsky and Martin&rsquo;s notebook<\/a> provides introduction to major tasks in NLP, and the current methods to achieve these tasks<\/li>\n<li>the <a href=\"http:\/\/www.nltk.org\/book\/\">Natural Language Processing with Python<\/a> book and package is a good way to exemplify NLP methods<\/li>\n<li><strong>machine\/deep learning for NLP<\/strong>:\u00a0 Y. Goldberg \u00ab\u00a0Neural Network Methods in Natural Language Processing\u00a0\u00bb, Morgan &amp; Claypool, 2017<\/li>\n<li>these notions will be covered in the master&rsquo;s program, but it might be good to anticipate.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<ul>\n<li style=\"list-style-type: none\">\u00a0<\/li>\n<\/ul>\n<p>[\/et_pb_toggle][et_pb_toggle title=\u00a0\u00bbContacts\u00a0\u00bb admin_label=\u00a0\u00bbToggle\u00a0\u00bb _builder_version=\u00a0\u00bb3.22.1&Prime; z_index_tablet=\u00a0\u00bb500&Prime;]<\/p>\n<ul>\n<li>for questions concerning the M1 year, contact <a href=\"https:\/\/u-paris.fr\/linguistique\/teams\/guillaume-wisniewski\/\">Guillaume Wisniewski<\/a><\/li>\n<li>for questions concerning the M2 year, contact <a href=\"https:\/\/www.linguist.univ-paris-diderot.fr\/~mcandito\/\">Marie Candito<\/a><\/li>\n<\/ul>\n<p>[\/et_pb_toggle][\/et_pb_column][et_pb_column type=\u00a0\u00bb1_4&Prime; _builder_version=\u00a0\u00bb3.0.47&Prime;][\/et_pb_column][\/et_pb_row][\/et_pb_section][et_pb_section fb_built=\u00a0\u00bb1&Prime; _builder_version=\u00a0\u00bb3.22&Prime; custom_padding=\u00a0\u00bb0px||0px|\u00a0\u00bb][et_pb_row _builder_version=\u00a0\u00bb3.22&Prime;][et_pb_column type=\u00a0\u00bb4_4&Prime; _builder_version=\u00a0\u00bb3.0.47&Prime;][et_pb_text admin_label=\u00a0\u00bb\u00c0 lire aussi\u00a0\u00bb _builder_version=\u00a0\u00bb3.21&Prime;]<\/p>\n<h2><span class=\"st\">\u00c0<\/span> lire aussi<\/h2>\n<p>[\/et_pb_text][et_pb_blog posts_number=\u00a0\u00bb4&Prime; include_categories=\u00a0\u00bb13&Prime; show_author=\u00a0\u00bboff\u00a0\u00bb show_date=\u00a0\u00bboff\u00a0\u00bb show_pagination=\u00a0\u00bboff\u00a0\u00bb module_id=\u00a0\u00bbpage_type_blog\u00a0\u00bb _builder_version=\u00a0\u00bb3.21&Prime; header_level=\u00a0\u00bbh4&Prime; border_width_bottom_fullwidth=\u00a0\u00bb1px\u00a0\u00bb border_color_bottom_fullwidth=\u00a0\u00bbrgba(51,51,51,0.18)\u00a0\u00bb custom_padding=\u00a0\u00bb||50px|\u00a0\u00bb][\/et_pb_blog][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Due to its multi-disciplinary character, candidates for this Master&rsquo;s degree can have different profiles: we welcome either students with a main training in linguistics but with knowledge and interest in computer science and mathematics, or students trained in computer science but interested in linguistics and the formal organisation of languages. Note though access to M1&hellip; <a class=\"continue\" href=\"https:\/\/u-paris.fr\/linguistique\/en\/pre-requisites-for-the-computational-linguistics-program\/\">Lire la suite<span> Pre-requisites for the Computational Linguistics program<\/span><\/a><\/p>\n","protected":false},"author":319,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_et_pb_use_builder":"on","_et_pb_old_content":"<p>[et_pb_section bb_built=\"1\" inner_width=\"auto\" inner_max_width=\"none\" next_background_color=\"#000000\"][et_pb_row][et_pb_column type=\"4_4\"][et_pb_post_title admin_label=\"Titre de la page\" _builder_version=\"3.22.1\" meta=\"off\" featured_image=\"off\" \/][\/et_pb_column][\/et_pb_row][et_pb_row][et_pb_column type=\"3_4\"][et_pb_text _builder_version=\"3.22.1\" module_id=\"contenu\" text_text_shadow_horizontal_length=\"text_text_shadow_style,%91object Object%93\" text_text_shadow_vertical_length=\"text_text_shadow_style,%91object Object%93\" text_text_shadow_blur_strength=\"text_text_shadow_style,%91object Object%93\" link_text_shadow_horizontal_length=\"link_text_shadow_style,%91object Object%93\" link_text_shadow_vertical_length=\"link_text_shadow_style,%91object Object%93\" link_text_shadow_blur_strength=\"link_text_shadow_style,%91object Object%93\" ul_text_shadow_horizontal_length=\"ul_text_shadow_style,%91object Object%93\" ul_text_shadow_vertical_length=\"ul_text_shadow_style,%91object Object%93\" ul_text_shadow_blur_strength=\"ul_text_shadow_style,%91object Object%93\" ol_text_shadow_horizontal_length=\"ol_text_shadow_style,%91object Object%93\" ol_text_shadow_vertical_length=\"ol_text_shadow_style,%91object Object%93\" ol_text_shadow_blur_strength=\"ol_text_shadow_style,%91object Object%93\" quote_text_shadow_horizontal_length=\"quote_text_shadow_style,%91object Object%93\" quote_text_shadow_vertical_length=\"quote_text_shadow_style,%91object Object%93\" quote_text_shadow_blur_strength=\"quote_text_shadow_style,%91object Object%93\" header_text_shadow_horizontal_length=\"header_text_shadow_style,%91object Object%93\" header_text_shadow_vertical_length=\"header_text_shadow_style,%91object Object%93\" header_text_shadow_blur_strength=\"header_text_shadow_style,%91object Object%93\" header_2_text_shadow_horizontal_length=\"header_2_text_shadow_style,%91object Object%93\" header_2_text_shadow_vertical_length=\"header_2_text_shadow_style,%91object Object%93\" header_2_text_shadow_blur_strength=\"header_2_text_shadow_style,%91object Object%93\" header_3_text_shadow_horizontal_length=\"header_3_text_shadow_style,%91object Object%93\" header_3_text_shadow_vertical_length=\"header_3_text_shadow_style,%91object Object%93\" header_3_text_shadow_blur_strength=\"header_3_text_shadow_style,%91object Object%93\" header_4_text_shadow_horizontal_length=\"header_4_text_shadow_style,%91object Object%93\" header_4_text_shadow_vertical_length=\"header_4_text_shadow_style,%91object Object%93\" header_4_text_shadow_blur_strength=\"header_4_text_shadow_style,%91object Object%93\" header_5_text_shadow_horizontal_length=\"header_5_text_shadow_style,%91object Object%93\" header_5_text_shadow_vertical_length=\"header_5_text_shadow_style,%91object Object%93\" header_5_text_shadow_blur_strength=\"header_5_text_shadow_style,%91object Object%93\" header_6_text_shadow_horizontal_length=\"header_6_text_shadow_style,%91object Object%93\" header_6_text_shadow_vertical_length=\"header_6_text_shadow_style,%91object Object%93\" header_6_text_shadow_blur_strength=\"header_6_text_shadow_style,%91object Object%93\" z_index_tablet=\"500\"]<\/p><div class=\"page\" title=\"Page 1\"><div class=\"layoutArea\"><div class=\"column\">The computational linguistics master program is open to students with varied backgrounds, but have prerquisites and \"assets\" summarized below. <br \/>Pre-requisites are knowledge validated by an academic course or can be evaluated during an interview with the candidate.<br \/>\"Assets\" are knowledge that is useful for succeeding in this program, but are not strictly required.<\/div><\/div><\/div><p>[\/et_pb_text][\/et_pb_column][et_pb_column type=\"1_4\"][\/et_pb_column][\/et_pb_row][et_pb_row][et_pb_column type=\"3_4\"][et_pb_toggle _builder_version=\"3.22.1\" title=\"Pre-requisites and assets per year\" text_shadow_horizontal_length=\"text_shadow_style,%91object Object%93\" text_shadow_vertical_length=\"text_shadow_style,%91object Object%93\" text_shadow_blur_strength=\"text_shadow_style,%91object Object%93\" title_text_shadow_horizontal_length=\"title_text_shadow_style,%91object Object%93\" title_text_shadow_vertical_length=\"title_text_shadow_style,%91object Object%93\" title_text_shadow_blur_strength=\"title_text_shadow_style,%91object Object%93\" body_text_shadow_horizontal_length=\"body_text_shadow_style,%91object Object%93\" body_text_shadow_vertical_length=\"body_text_shadow_style,%91object Object%93\" body_text_shadow_blur_strength=\"body_text_shadow_style,%91object Object%93\" z_index_tablet=\"500\"]<\/p><ul><li>first year of master (M1):<ul><li>computer science:<ul><li>pre-requisite: python and java programming, object-oriented programming, algorithmics<\/li><\/ul><\/li><li>Linguistics :<ul><li>pre-requisite: none (several levels of linguistics courses are proposed in M1)<\/li><li>atouts: general linguistics, phonetics, phonology, morphology, syntax, semantics<\/li><\/ul><\/li><li>Mathematics :<ul><li>pre-requisite: notions of probability theory and statistics, linear algebra<\/li><li>assets: formal language theory: automata and regular expressions<\/li><\/ul><\/li><\/ul><\/li><li>M2 LI :<ul><li>pre-requisite:<ul><li>Informatique: Programmation avanc\u00e9e (au moins deux langages, python recommand\u00e9), Algorithmique (graphes)<\/li><li>Linguistique: Phon\u00e9tique, phonologie, grammaire, syntaxe formelle, s\u00e9mantique formelle<\/li><li>Mathematics\/NLP: Formal languages (grammars, parsing), Machine learning for NLP<\/li><\/ul><\/li><li>Asset: knowledge of the NLP field and applications<\/li><\/ul><\/li><\/ul><p>[\/et_pb_toggle][et_pb_toggle _builder_version=\"3.22.1\" title=\"Informations sur l'entr\u00e9e en M1\" text_shadow_horizontal_length=\"text_shadow_style,%91object Object%93\" text_shadow_vertical_length=\"text_shadow_style,%91object Object%93\" text_shadow_blur_strength=\"text_shadow_style,%91object Object%93\" title_text_shadow_horizontal_length=\"title_text_shadow_style,%91object Object%93\" title_text_shadow_vertical_length=\"title_text_shadow_style,%91object Object%93\" title_text_shadow_blur_strength=\"title_text_shadow_style,%91object Object%93\" body_text_shadow_horizontal_length=\"body_text_shadow_style,%91object Object%93\" body_text_shadow_vertical_length=\"body_text_shadow_style,%91object Object%93\" body_text_shadow_blur_strength=\"body_text_shadow_style,%91object Object%93\" z_index_tablet=\"500\"]<\/p><p>Le niveau d'informatique est \u00e9valu\u00e9 lors d'un entretien avec l'enseignant responsable du M1 au moment du d\u00e9p\u00f4t de la candidature. Il est vivement conseill\u00e9 de le contacter pour pr\u00e9parer l'oral. Voir infra partie bibliographie, des liens et r\u00e9f\u00e9rences.<\/p><p>Concernant le niveau en linguistique: depuis 2019, le M1 Linguistique informatique est ouvert aux d\u00e9butants en linguistique, avec des parcours diff\u00e9renci\u00e9s selon que l'\u00e9tudiant a d\u00e9j\u00e0 des connaissances en linguistique ou pas.<\/p><p>Les \u00e9tudiants concern\u00e9s par l'oral d'entr\u00e9e sont convoqu\u00e9s individuellement.<br \/>En cas d'\u00e9chec \u00e0 l'oral d'entr\u00e9e, l'admission en L3 est garantie, mais ATTENTION: un dossier eCandidat de M1 ne peut pas \u00eatre bascul\u00e9 en L3. Pour un \u00e9tudiant candidatant en M1 en \u00e9tant un peu juste, il est conseill\u00e9 de pr\u00e9voir un dossier eCandidat pour la L3 en plus du dossier pour le M1.<\/p><p>[\/et_pb_toggle][et_pb_toggle _builder_version=\"3.22.1\" title=\"Informations pour l'entr\u00e9e en M2\" text_shadow_horizontal_length=\"text_shadow_style,%91object Object%93\" text_shadow_vertical_length=\"text_shadow_style,%91object Object%93\" text_shadow_blur_strength=\"text_shadow_style,%91object Object%93\" title_text_shadow_horizontal_length=\"title_text_shadow_style,%91object Object%93\" title_text_shadow_vertical_length=\"title_text_shadow_style,%91object Object%93\" title_text_shadow_blur_strength=\"title_text_shadow_style,%91object Object%93\" body_text_shadow_horizontal_length=\"body_text_shadow_style,%91object Object%93\" body_text_shadow_vertical_length=\"body_text_shadow_style,%91object Object%93\" body_text_shadow_blur_strength=\"body_text_shadow_style,%91object Object%93\" z_index_tablet=\"500\"]<\/p><ul><li>Connaissances requises en Informatique, langages formels, apprentissage automatique:<ul><li>autonomie en programmation python, programmation objet<\/li><li>bases math\u00e9matiques (cf. B. Partee et al., \"Mathematical methods in Linguistics\", 1993.<\/li><li>principes de base de la classification supervis\u00e9e, l'architecture d'un r\u00e9seau de neurones simple (de type perceptron multicouche) et l'algorithme de la descente de gradient (voir Y. Goldberg \"Neural Network Methods in Natural Language Processing\", Morgan & Claypool, 2017)<\/li><\/ul><\/li><li>Syntaxe formelle: les \u00e9tudiants d\u00e9sirant entrer en M2 sont suppos\u00e9s ma\u00eetriser au moins l'une des grandes approches formelles de la syntaxe (GB\/minimalisme, LFG, ou HPSG), et avoir une connaissance avanc\u00e9e des grands ph\u00e9nom\u00e8nes syntaxiques et de leur traitement.<\/li><\/ul><p>[\/et_pb_toggle][et_pb_toggle _builder_version=\"3.22.1\" title=\"Bibliographie en TAL \/ math\u00e9matiques \/ informatique\" text_shadow_horizontal_length=\"text_shadow_style,%91object Object%93\" text_shadow_vertical_length=\"text_shadow_style,%91object Object%93\" text_shadow_blur_strength=\"text_shadow_style,%91object Object%93\" title_text_shadow_horizontal_length=\"title_text_shadow_style,%91object Object%93\" title_text_shadow_vertical_length=\"title_text_shadow_style,%91object Object%93\" title_text_shadow_blur_strength=\"title_text_shadow_style,%91object Object%93\" body_text_shadow_horizontal_length=\"body_text_shadow_style,%91object Object%93\" body_text_shadow_vertical_length=\"body_text_shadow_style,%91object Object%93\" body_text_shadow_blur_strength=\"body_text_shadow_style,%91object Object%93\" z_index_tablet=\"500\"]<\/p><p>Voici en outre quelques pistes pour aider les \u00e9tudiants \u00e0 se pr\u00e9parer pour que le Master se passe dans les meilleures conditions possibles (ind\u00e9pendamment de l'oral d'entr\u00e9e).<\/p><ul><li>TAL et linguistique computationnelle:<ul><li>Le <a href=\"https:\/\/web.stanford.edu\/~jurafsky\/slp3\/\">livre de Jurafsky et Martin<\/a> donne un aper\u00e7u du TAL, mis \u00e0 jour r\u00e9guli\u00e8rement<\/li><li>Pour les \u00e9tudiants d\u00e9j\u00e0 un peu plus avanc\u00e9s en TAL et familiers avec le langage python, le livre <a href=\"http:\/\/www.nltk.org\/book\/\">Natural Language Processing with Python<\/a> est un bon moyen de mettre en oeuvre en pratique les m\u00e9thodes du TAL.<\/li><li>pour l'introduction \u00e0 l'apprentissage automatique pour le TAL et les m\u00e9thodes neuronales: Y. Goldberg \"Neural Network Methods in Natural Language Processing\", Morgan & Claypool, 2017<\/li><\/ul><\/li><li>Algorithmique: Le programme d'algorithmique consid\u00e9r\u00e9 comme d\u00e9j\u00e0 vu \u00e0 l'entr\u00e9e en M1 comprend les notions g\u00e9n\u00e9rales de complexit\u00e9 (grand O), les tris, les structures lin\u00e9aires (piles, files), les arbres, les h-tables.<br \/>Il peut \u00eatre pertinent de commencer avec des tutoriels en ligne, par exemple (parmi bien d'autres) Algorithmique pour l'apprenti programmeur. Le manuel de Cormen (\"Algorithmique\" 3e \u00e9dition fran\u00e7aise 2010, Dunod) est l'un des meilleurs ouvrages de r\u00e9f\u00e9rence.<\/li><li>Programmation:<ul><li>On attend \u00e0 l'entr\u00e9e en M1 une capacit\u00e9 \u00e0 produire, sans mod\u00e8le, des programmes de plusieurs centaines de lignes de code dans au moins un langage, si possible python. Il est indispensable d'avoir une pratique de la programmation, d'avoir accumul\u00e9 une certaine exp\u00e9rience. Le langage le plus utilis\u00e9 dans les TPs de master est python.<\/li><li>Une fa\u00e7on d'\u00e9valuer ses comp\u00e9tences en programmation est d'utiliser le <a href=\"https:\/\/projecteuler.net\/\">projet Euler<\/a>: de petits probl\u00e8mes math\u00e9matiques dont la r\u00e9solution ne peut se faire qu'en faisant un programme dans un langage de programmation quelconque. Savoir r\u00e9soudre les 15 premiers probl\u00e8mes est une bonne garantie que votre niveau est appropri\u00e9 pour le Master.<\/li><\/ul><\/li><li>Math\u00e9matiques<ul><li>Probabilit\u00e9s:<\/li><li>Automates: Voici un polycopi\u00e9 qui reprend une partie du cours de licence 3 intitul\u00e9 \"Bases Formelles du TAL\": Langages rationnels.<\/li><\/ul><\/li><\/ul><p>* Cormen, Th et collab. [2010] Algorithmique. Dunod.<br \/>* Partee, B. et alii [1993] Mathematical methods in Linguistics, Kluwer.<\/p><p>[\/et_pb_toggle][et_pb_toggle _builder_version=\"3.22.1\" title=\"Bibliographie indicative en linguistique\" text_shadow_horizontal_length=\"text_shadow_style,%91object Object%93\" text_shadow_vertical_length=\"text_shadow_style,%91object Object%93\" text_shadow_blur_strength=\"text_shadow_style,%91object Object%93\" title_text_shadow_horizontal_length=\"title_text_shadow_style,%91object Object%93\" title_text_shadow_vertical_length=\"title_text_shadow_style,%91object Object%93\" title_text_shadow_blur_strength=\"title_text_shadow_style,%91object Object%93\" body_text_shadow_horizontal_length=\"body_text_shadow_style,%91object Object%93\" body_text_shadow_vertical_length=\"body_text_shadow_style,%91object Object%93\" body_text_shadow_blur_strength=\"body_text_shadow_style,%91object Object%93\" z_index_tablet=\"500\"]<\/p><ul><li>Syntaxe<ul><li>Abeill\u00e9, A. [2007] Les grammaires d'unification, Herm\u00e8s (chap 1 et chap 2).<\/li><li>Bresnan, J. [2001] Lexical Functional Syntax, Basic Blackwell.<\/li><li>Delaveau, A. [2001] Syntaxe, la phrase et la subordination. Armand Colin.<\/li><li>Haegeman L. [1993]. Introduction to Government & Binding Theory. Blackwell, Oxford.<\/li><li>Kerleroux F. et Delaveau, A. [1985] Probl\u00e8mes et exercices de syntaxe fran\u00e7aise. Armand Colin.<\/li><li>Sag, I et Wasow, T., et Bender, E. [2003] Syntactic theory: a formal introduction, CSLI Publications.<\/li><li>Radford, A. [1988]. Transformational Grammar: A First Course. Cambridge University Press.<\/li><li>Radford, A. [1997] Syntax: a minimalist Introduction.<\/li><\/ul><\/li><li>Phon\u00e9tique<ul><li>Ladefoged, P., [1975] A Course in phonetics, Harcourt, Brace & Jovanovich.<\/li><li>Landercy A., & Renard R. [1977] El\u00e9ments de phon\u00e9tique, Didier-Bruxelles.<\/li><li>L\u00e9on, P. [2000] Phon\u00e9tisme et prononciation du fran\u00e7ais, Nathan, 2000.<\/li><\/ul><\/li><li>S\u00e9mantique<ul><li>John Lyons, El\u00e9ments de s\u00e9mantique (Larousse, 1978, ISBN 2030703443).<\/li><li>Saeed, John I. [1997] Semantics. Blackwell.<\/li><\/ul><\/li><\/ul><p>[\/et_pb_toggle][et_pb_toggle _builder_version=\"3.22.1\" title=\"Quelle orientation avant la L3 de linguistique informatique?\" text_shadow_horizontal_length=\"text_shadow_style,%91object Object%93\" text_shadow_vertical_length=\"text_shadow_style,%91object Object%93\" text_shadow_blur_strength=\"text_shadow_style,%91object Object%93\" title_text_shadow_horizontal_length=\"title_text_shadow_style,%91object Object%93\" title_text_shadow_vertical_length=\"title_text_shadow_style,%91object Object%93\" title_text_shadow_blur_strength=\"title_text_shadow_style,%91object Object%93\" body_text_shadow_horizontal_length=\"body_text_shadow_style,%91object Object%93\" body_text_shadow_vertical_length=\"body_text_shadow_style,%91object Object%93\" body_text_shadow_blur_strength=\"body_text_shadow_style,%91object Object%93\" z_index_tablet=\"500\"]<\/p><p>Les \u00e9tudiants (ou lyc\u00e9ens) int\u00e9ress\u00e9s par le master de Linguistique Informatique sont invit\u00e9s \u00e0 choisir une formation de type \u00ab Math\u00e9matiques et Informatique Appliqu\u00e9es aux Sciences Humaines et Sociales \u00bb pour les deux premi\u00e8res ann\u00e9es apr\u00e8s le bac, que ce soit dans les fili\u00e8res MIASHS offertes \u00e0 l'universit\u00e9, ou en kh\u00e2gne B\/L. La licence MIASHS dispens\u00e9e \u00e0 l'universit\u00e9 Paris Cit\u00e9 est particuli\u00e8rement adapt\u00e9e puisqu'elle offre un parcours \u00ab math\u00e9matiques, linguistique et informatique \u00bb, et fournit donc tous les pr\u00e9-requis n\u00e9cessaires \u00e0 l'entr\u00e9e en Master.<\/p><p>[\/et_pb_toggle][et_pb_toggle _builder_version=\"3.22.1\" title=\"Contacts\" text_shadow_horizontal_length=\"text_shadow_style,%91object Object%93\" text_shadow_vertical_length=\"text_shadow_style,%91object Object%93\" text_shadow_blur_strength=\"text_shadow_style,%91object Object%93\" title_text_shadow_horizontal_length=\"title_text_shadow_style,%91object Object%93\" title_text_shadow_vertical_length=\"title_text_shadow_style,%91object Object%93\" title_text_shadow_blur_strength=\"title_text_shadow_style,%91object Object%93\" body_text_shadow_horizontal_length=\"body_text_shadow_style,%91object Object%93\" body_text_shadow_vertical_length=\"body_text_shadow_style,%91object Object%93\" body_text_shadow_blur_strength=\"body_text_shadow_style,%91object Object%93\" z_index_tablet=\"500\"]<\/p><p>La commission se r\u00e9unit \u00e0 intervalles r\u00e9guliers au fur et \u00e0 mesure des candidatures. Pour toute question sur votre candidature, notamment sur les pr\u00e9-requis et la pr\u00e9paration, vous pouvez contacter la commission p\u00e9dagogique (linguistique.informatique@linguist.univ-paris-diderot.fr), ou directement le ou la responsable d'ann\u00e9e:<\/p><ul><li>L3 LI : <a href=\"https:\/\/u-paris.fr\/linguistique\/teams\/marie-candito\/\">Marie Candito<\/a><\/li><li>M1 LI : <a href=\"https:\/\/u-paris.fr\/linguistique\/teams\/guillaume-wisniewski\/\">Guillaume Wisniewski<\/a><\/li><li>M2 LI : <a href=\"https:\/\/u-paris.fr\/linguistique\/teams\/benoit-crabbe\/\">Beno\u00eet Crabb\u00e9<\/a><\/li><\/ul><p>[\/et_pb_toggle][\/et_pb_column][et_pb_column type=\"1_4\"][\/et_pb_column][\/et_pb_row][\/et_pb_section][et_pb_section bb_built=\"1\" specialty=\"off\" _builder_version=\"3.21\" custom_padding=\"0px||0px|\" prev_background_color=\"#000000\" inner_width=\"auto\" inner_max_width=\"none\"][et_pb_row _builder_version=\"3.19.11\" width=\"80%\" max_width=\"1080px\"][et_pb_column type=\"4_4\"][et_pb_text admin_label=\"\u00c0 lire aussi\" _builder_version=\"3.21\"]<\/p><h2><span class=\"st\">\u00c0<\/span> lire aussi<\/h2><p>[\/et_pb_text][et_pb_blog _builder_version=\"3.21\" posts_number=\"4\" include_categories=\"13\" show_author=\"off\" show_date=\"off\" show_pagination=\"off\" border_width_bottom_fullwidth=\"1px\" border_color_bottom_fullwidth=\"rgba(51,51,51,0.18)\" custom_padding=\"||50px|\" module_id=\"page_type_blog\" header_level=\"h4\" \/][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>","_et_gb_content_width":"","footnotes":""},"coauthors":[47],"class_list":["post-2209","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/u-paris.fr\/linguistique\/wp-json\/wp\/v2\/pages\/2209","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/u-paris.fr\/linguistique\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/u-paris.fr\/linguistique\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/u-paris.fr\/linguistique\/wp-json\/wp\/v2\/users\/319"}],"replies":[{"embeddable":true,"href":"https:\/\/u-paris.fr\/linguistique\/wp-json\/wp\/v2\/comments?post=2209"}],"version-history":[{"count":7,"href":"https:\/\/u-paris.fr\/linguistique\/wp-json\/wp\/v2\/pages\/2209\/revisions"}],"predecessor-version":[{"id":3729,"href":"https:\/\/u-paris.fr\/linguistique\/wp-json\/wp\/v2\/pages\/2209\/revisions\/3729"}],"wp:attachment":[{"href":"https:\/\/u-paris.fr\/linguistique\/wp-json\/wp\/v2\/media?parent=2209"}],"wp:term":[{"taxonomy":"author","embeddable":true,"href":"https:\/\/u-paris.fr\/linguistique\/wp-json\/wp\/v2\/coauthors?post=2209"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}