Supervised Entity Mention Coreference Resolution Algorithm

From GM-RKB
Jump to navigation Jump to search

An Supervised Entity Mention Coreference Resolution Algorithm is a Data-Driven Mention Coreference Resolution Algorithm that is also a Supervised Coreference Resolution Algorithm.



References

2008

  • (Clark and González-Brenes, 2008) ⇒ Jonathan H. Clark, and José P. González-Brenes. (2008). “Coreference: Current Trends and Future Directions." CMU course on Language and Statistics II Literature Review, Fall 2008.
    • Until recently, statistical approaches treated coreference resolution as a binary classification problem, in which the probability of two mentions from the text [math]\displaystyle{ i }[/math] and [math]\displaystyle{ j }[/math] having a coreferential outcome can be calculated from data by estimating the probability of Denis and Baldridge (2007). “Pc(COREF|<i,j>) (1)

2001