Multi-Document Coreference Resolution Algorithm: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
m (Remove links to pages that are actually redirects to this page.)
m (Text replacement - ". " to ". ")
 
Line 23: Line 23:


=== 2003 ===
=== 2003 ===
* ([[2003_UnsupPersonalNameDisambig|Mann & Yarowsky, 2003]]) ⇒ Gideon S. Mann, and [[David Yarowsky]]. ([[2003]]). “[http://dx.doi.org/10.3115/1119176.1119181 Unsupervised Personal Name Disambiguation].” In: Proceedings of HLT-NAACL ([[2003]]).  
* ([[2003_UnsupPersonalNameDisambig|Mann & Yarowsky, 2003]]) ⇒ Gideon S. Mann, and [[David Yarowsky]]. ([[2003]]). “[http://dx.doi.org/10.3115/1119176.1119181 Unsupervised Personal Name Disambiguation].” In: Proceedings of HLT-NAACL ([[2003]]).


=== 1998 ===
=== 1998 ===

Latest revision as of 13:13, 2 August 2022

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



References

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

2003

1998