Language Technology and Computer Science Modules in Prague
The following overview summarizes main courses covering LT and CS modules (may be subject of marginal changes – please check in Student Information System).
List of Obligatory Courses (local master program I-3, Mathematical Linguistics)
Each student has to pass all obligatory courses at the Charles University (or their equivalents at a partner university - subject to approval):
- Statistical Methods in Natural Language Processing I (NPFL067)
- Introduction to General Linguistics (NPFL063)
- NLP Technology (NPFL092)
- Software Project (NPRG027, NPRG023)
- Introduction to Complexity and Computability Theory (NTIN090)
- Data Structures I (NTIN066)
- Diploma Thesis I,II,III (NSZZ023, NSZZ024,NSZZ025)
List of Core Optional Courses (local master program I-3, Mathematical Linguistics)
Each student has to gain at least 40 ECTS from the following list of "core optional courses" at the Charles University (or their equivalents at a partner university - subject to approval):
- Statistical Methods in Natural Language Processing II (NPFL068)
- Linguistic Theory and Grammar Formalisms (NPFL083)
- Language Data Resources (NPFL070)
- Prague Dependency Treebank (NPFL075)
- Introduction to Machine Learning (in Computational Linguistics) (NPFL054)
- NLP Applications (NPFL093)
- Czech for Foreigners
- Statistical Machine Translation (NPFL087)
- Morphological and Syntactic Analysis (NPFL094)
- Introduction to Formal Linguistics (NPFL006)
- Modern Methods in CL (NPFL095)
- Fundamentals of Speech Recognition (NPFL038)
- Information Structure of Sentence and Discourse Structure (NPFL082)
- Computational morphology (NPFL096)
The Coverage of LT Modules in Prague
The following table summarizes main courses covering LT modules (may be subject of marginal changes – please check in Student Information System).
The Coverage of CS Modules in Prague
The following table summarizes main courses covering CS modules.
| Module | Code | Name | ECTS | Type | Semester |
|---|---|---|---|---|---|
| Data Structures, Data Organization and Processing (CS-M1) | NTIN066 | Data Structures I (oblig.) | 3 | Ex | winter |
| NPFL092 | NLP Technology | 4 | MC | winter | |
| NDBI010 | Information Retrieval Systems | 3 | Ex | summer | |
| Logic, Computability and Complexity (CS-M2) | NTIN090 | Introduction to Complexity and Computability Theory (oblig.) | 5 | C+Ex | winter |
| NPFL081 | Practical Fundamentals of Probability and Statistics for Computer Linguistics (oblig.) | 3 | C | winter | |
| Formal Languages and Algorithms (CS-M3) | NOPT042 | Constraint Programming | 3 | Ex | winter |
| NAIL071 | Planning and Scheduling | 3 | Ex | summer | |
| NPFL054 | Introduction to Machine Learning (in CL) (3/6) | 3 | C+Ex | winter | |
| Advanced (CS-M4) | NPFL054 | Introduction to Machine Learning (in CL) (3/6) | 3 | (see above) | |
| NPFL095 | Modern Methods in CL | 3 | C | winter/summer | |
| NAIL072 | Pattern Recognition | 3 | Ex | summer | |
| NAIL069 | Artificial Intelligence I | 3 | Ex | winter | |
| NSWI108 | Web Semantization | 4 | C+Ex | winter | |
| NDBI023 | Knowledge Mining | 9 | C+Ex | summer | |
| NTIN087 | String Algorithms | 3 | Ex | winter | |
| NAIL002 | Knowledge Mining | 9 | C+Ex | winter | |
Note that there is a great number of other CS courses taught in Czech. Depending on student's interest, English lessons may be arranged. Please, contact us.
Additions
| Module | Code | Name | ECTS | Type | Semester |
|---|---|---|---|---|---|
| Additions | NPRG027/023 | Software Project (oblig.) | 15 | C | winter/summer |
| Czech for Foreigners | 6 | Ex | winter |
Note that courses marked as obligatory either must be attended at Charles University or their equivalents at the other university may be recognized (be a subject of previous approval).
Grading scheme
seminar
- C = credited (i.e. requirements of a course are fulfilled) (Czech abbrev. Z)
- MC = requirements with assessment (Czech abbrev. KZ);
- 1 = excellent, 2 = very good, 3 = good, 4 = fail
lecture
- Ex = exam (Czech abbrev. Zk);
- 1 = excellent, 2 = very good, 3 = good, 4 = fail