Unsupervised Coreference Resolution Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "↵↵----↵↵== References ==↵" to " ---- ---- == References == ") |
|||
| Line 10: | Line 10: | ||
* <B>See:</B> [[Coreference Resolution algorithm]]). | * <B>See:</B> [[Coreference Resolution algorithm]]). | ||
---- | |||
---- | ---- | ||
Revision as of 14:40, 24 August 2023
An Unsupervised Coreference Resolution Algorithm is a Data-Driven Coreference Resolution Algorithm that applies an Unsupervised Learning algorithm).
- Context:
- It can be applied by an Unsupervised Coreference Resolution System (to solve an Unsupervised Coreference Resolution Task).
- Example(s):
- Counter-Example(s):
- See: Coreference Resolution algorithm).
References
2007a
- (Elmagarmid et al., 2007) ⇒ Ahmed K. Elmagarmid, Panagiotis G. Ipeirotis, and Vassilios S. Verykios (2007). “Duplicate Record Detection: A Survey." IEEE Transactions on Knowledge and Data Engineering 19 (1).
2007b
- (Haghighi & Klein, 2007) ⇒ Aria Haghighi, Dan Klein. (2007). “Unsupervised Coreference Resolution in a Nonparametric Bayesian Model.” In: Proceedings of ACL 2007.