Changes between Version 25 and Version 26 of private/NlpInPracticeCourse/AnaphoraResolution

Timestamp:

Dec 1, 2022, 5:57:55 PM (17 months ago)

Author:

xmedved1

Comment:

--

private/NlpInPracticeCourse/AnaphoraResolution

@@ -19 +19 @@
 
  1. Anaphora Resolution, Studies in Language and Linguistics by Mitkov, R., 2014, Taylor & Francis
- 1. Wikicrem: A large unsupervised corpus for coreference resolution, Kocijan, V., Camburu, O.-M., Cretu, A.-M., Yordanov, Y., Blunsom, P., and Lukasiewicz, T. (2019).
- 1. A comprehensive review on feature set used for anaphora resolution, Lata, K., Singh, P., and Dutta, K. (2020).
- 1. The referential reader: A recurrent entity network for anaphora resolution, Liu, F., Zettlemoyer, L., and Eisenstein, J. (2019).
- 1. Petra: A sparsely supervised memory model for people tracking, Toshniwal, S., Ettinger, A., Gimpel, K., and Livescu, K. (2020).
-
+ 1. A neural entity coreference resolution review. Stylianou, N. and Vlahavas, I. (2021)
+ 1. A comprehensive review on feature set used for anaphora resolution. Lata, K., Singh, P., and Dutta, K. (2020).
+ 1. Efficient and interpretable neural models for entity tracking. Toshniwal, S. (2022)
 
 == Practical Session ==
@@ -37 +35 @@
     in the terminal to install NLTK package. Faculty machines should have `nltk` already installed.
  1. understand Hobbs' definition of anaphora resolution and replace `XXX` function calls with correct ones
- 1. find 20 nontrivial sentences wit anaphora: 10 that Hobbs algorithm can recognize and 10 sentences it dos not. You 
+ 1. find 20 nontrivial sentences with anaphora: 10 that Hobbs algorithm can recognize and 10 sentences it dos not. You 
  can use [https://nlp.fi.muni.cz/projekty/qa/parser/ the Stanford parser] 
  to test new sentences - copy the tree to one line and remove the ROOT tag.