| 21 | | Concrete description of work assignment for students for the second one-hour part of the lecture. The work will consist of tasks connected with practical implementations of algorithms connected with the current topic (probably not the state-of-the-art algorithms mentioned in the first part) and with real data. Students can test the algorithms, evaluate them and possibly try some short adaptations for various subtasks. |
| 22 | | |
| 23 | | Students can also be required to generate some results of their work and hand them in to prove completing the tasks. |
| 24 | | |
| 25 | | Resources: |
| 26 | | - A set of documents and plagiates !TODO |
| 27 | | - A frame script in Python for plagiarism detection !TODO |
| 28 | | - A description of several basic methods for plagiarism detection evaluated by HaCohen-Kerner et al. !TODO |
| 29 | | |
| 30 | | The task: |
| 31 | | - !TODO instructions |
| 32 | | - The student will choose a method for plagiarism detection and implement it as a function in the frame script. |
| 33 | | - Evaluation: precision, recall, F1 (the calculaton will be a part of the frame script). |
| 34 | | |
| | 21 | [nlp.fi.muni.cz/~xsuchom2/anlp-05-LanguageResourcesFromWeb.pdf] |
