Anaphora resolution

​IA161 Advanced NLP Course, Course Guarantee: Aleš Horák

Prepared by: Marek Medveď

TODO til 31.5.2015

1. choose particular papers for References below (that will serve as input for the lecture later on)
2. prepare the Practical Session

State of the Art

References

Approx 3 current papers (preferably from best NLP conferences/journals, eg. ​ACL Anthology) that will be used as a source for the one-hour lecture:

1. Anaphora Resolution, Studies in Language and Linguistics by Mitkov, R., 2014, Taylor & Francis, ISBN 9781317881810
2. Anaphora resolution: the state of the art, Ruslan Mitkov,1999, Citeseer
3. Strategies of anaphora resolution, Tanya Reinhart, 2006, North Holland, ​Source
4. Discriminative Approach to Predicate-argument Structure Analysis with Zero-anaphora Resolution, Kenji Imamura and Kuniko Saito and Tomoko Izumi, 2009, Association for Computational Linguistics, ACMID 1667611, ​ Source
5. The Influence of Minimum Edit Distance on Reference Resolution, Michael Strube and Stefan Rapp and Christoph Muller, EMNLP 2002, Association for Computational Linguistics, ACMID 1118733, ​Source
6. Combining Sample Selection and Error-driven Pruning for Machine Learning of Coreference Rules, Vincent Ng and Claire Cardie, EMNLP 2002, Association for Computational Linguistics, ACMID 1118701, ​Source

Practical Session

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 the additional task is to find sentence structures that are not covered by Hobbs' algorithm.