This document discusses algorithms for coreference resolution, which is the task of linking mentions of entities in a text to their corresponding real-world entities. It presents Hobbs' algorithm, which proposes potential antecedents for anaphora by traversing the parse tree, and Lappin and Leass' algorithm, which applies salience factors to mentions before applying syntactic filters and moving to the previous sentence if no antecedent is found. The document also discusses different types of anaphora like pronouns and proper nouns, as well as agreement constraints and anaphor binding.