Changes between Version 23 and Version 24 of private/NlpInPracticeCourse/AnaphoraResolution
- Timestamp:
- Nov 25, 2022, 10:36:35 AM (17 months ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
private/NlpInPracticeCourse/AnaphoraResolution
v23 v24 27 27 == Practical Session == 28 28 29 Student has to understand Hobbs' definition of anaphora resolution and according to it implement the main function of Hobbs' algorithm in proposed python script that contains all necessary functions. According to real data (syntactic trees) student tests his program and evaluate it. At the and of the session student has to hand the results to prove completing the task. If the student finishes early theadditional task is to find sentence structures that are not covered by Hobbs' algorithm.29 Student has to understand Hobbs' definition of anaphora resolution and according to it implement the main function of Hobbs' algorithm in the proposed python script that contains all necessary functions. According to real data (syntactic trees) students test their adjusted program and evaluate it. At the end of the session students hand in the results to prove completing the task. If the student finishes early, an additional task is to find sentence structures that are not covered by Hobbs' algorithm. 30 30 31 31 The task: 32 1. download the script with data from [[attachment:hobbs.zip|here]] 33 1. NLTK package is required for `hobbs.py`. When running at your computer, paste {{{pip3 install nltk --user}}} to terminal to install NLTK package. Faculty machines should have nltk already installed. 32 1. download the script with data from [[raw-attachment:hobbs.zip|here]] 33 1. NLTK package is required for `hobbs.py`. When running at your computer, paste 34 {{{ 35 pip3 install nltk --user 36 }}} 37 in the terminal to install NLTK package. Faculty machines should have `nltk` already installed. 34 38 1. understand Hobbs' definition of anaphora resolution and replace `XXX` function calls with correct ones 35 39 1. find 20 nontrivial sentences wit anaphora: 10 that Hobbs algorithm can recognize and 10 sentences it dos not. You