Multi-Document Coreference Resolution Algorithm

A Multi-Document Coreference Resolution Algorithm is a Coreference Resolution Algorithm that can solve a Multi-Document Coreference Resolution Task.

• AKA: Cross-Document Entity Tracking Algorithm, Multi-Document Resolution Algorithm.
• See: Within-Document Coreferent Entity Mention.

---

---

References

2007

• (Agheluta & Moens, 2007) ⇒ Roxana Angheluta, and Marie-Francine Moens. (2007). “Cross-Document Entity Tracking.” In: Proceedings of the 29th European Conference on Information Retrieval (ECIR 2007).

2006

• (Kulkarni & Pedersen, 2006) ⇒ Anagha Kulkarni, and Ted Pedersen. (2006). “How Many Different "John Smiths", and Who Are They?.” In: Proceedings of AAAI 2006 (AAAI 2006).
• (Phan et al., 2006) ⇒ X.-H. Phan, L.-M. Nguyen, and S. Horiguchi. (2006). “Personal Name Resolution Crossover Documents by a Semantics-based Approach.” In: IEICE Trans. Inf. & Syst.
  • It is similar to (Mann & Yarowsky, 2003) by the use of a person's biographical information.
  • It proposes the use a machine learning algorithm to classify sentences according to particular information types.
  • It compares information in automatically constructed person profiles.
  • It takes into account the type of the information

2004

• (Fleischman & Hovy, 2004) ⇒ Michael B Fleischman, and Eduard Hovy. (2004). “Multi-Document Person Name Resolution.” In: Proceedings of ACL 2004 (ACL 2004).

2003

• (Mann & Yarowsky, 2003) ⇒ Gideon S. Mann, and David Yarowsky. (2003). “Unsupervised Personal Name Disambiguation.” In: Proceedings of HLT-NAACL (2003).

1998

• (Bagga & Baldwin, 1998) ⇒ Amit Bagga, and Breck Baldwin. (1998). “Entity-based Cross-Document Coreferencing Using the Vector Space Model.” In: Proceedings of the 17th International Conference on Computational Linguistics (COLING-ACL 1998).

---