|
|
|
||
Last update: doc. Mgr. Barbora Vidová Hladká, Ph.D. (12.05.2020)
|
|
||
Last update: RNDr. Daniel Zeman, Ph.D. (07.10.2017)
The credits are awarded for homeworks assigned during the semester. A typical homework consists of natural language processing whereas the solution comprises both the processed data and the tools created or configured by the student in order to process the data. Solutions are submitted by e-mail. Each homework task has its own number of points that can be awarded for the solution. Each task has a deadline. It is possible to submit the solution after the deadline but late submissions will not get the full points. In any case the solutions must be submitted before the end of the winter exam period, unless an exception has been negotiated with the lecturer.
If the full points were not awarded (also) for other reasons than late submission, the student can submit an improved solution where the lecturer's comments have been addressed. The new submission will be evaluated as if it was the first submission submitted after deadline.
The credit is graded and the final grade corresponds to the total number of points awarded for homeworks. There will be at least three homework assignments and the point system will enable getting the grade 1 (“outstanding”) for full points in two assignments.
The student can negotiate with the lecturer an alternative way of completion of the course, e.g. by doing a larger semestral project instead of several smaller assignments. |
|
||
Last update: doc. Mgr. Barbora Vidová Hladká, Ph.D. (29.01.2019)
|
|
||
Last update: RNDr. Daniel Zeman, Ph.D. (05.05.2022)
1. Sets of morphosyntactic tags, definition of problems, parts of speech. 2. Supervised and unsupervised morphemic segmentation, Chinese word segmentation. 3. Finite-state (two-level) morphology. 4. Context-free grammars and chart parser, usage for morphological analysis. 5. Unification grammars for morphological analysis. 6. Functional morphology. 7. Syntactic annotation, constituent trees, dependency trees, non-projectivity. 8. Universal Dependencies. 9. Dependency parsing: transition-based parsers, graph-based parsers. |