Named Entity Disambiguation (NED) Algorithm

A Named Entity Disambiguation (NED) Algorithm is a resolution algorithm that can be implemented by an NED system to solve an NED task.

• AKA: Named Entity Resolution Method, Name Matching Algorithm.
• Context:
  • …
• Counter-Example(s):
  • …
• See: Relation Mention Recognition Algorithm.

---

---

References

2008

• (Vercoustre et al., 2008) ⇒ Anne-Marie Vercoustre, James A. Thom, and Jovan Pehcevski. (2008). “Entity ranking in Wikipedia.” In: Proceedings of the 2008 ACM symposium on Applied computing.

2007

• (Chen & Martin, 2007) ⇒ Ying Chen and James Martin. (2007). “Towards Robust Unsupervised Personal Name Disambiguation.” In: Proceedings of EMNLP-CNLL-2007.

2006

• (Bunescu & Paşca, 2006) ⇒ Razvan C. Bunescu and Marius Paşca. (2006). “Using Encyclopedic Knowledge for Named Entity Disambiguation.” In: Proceedings of EACL-2006. (presentation)

2005

• (Bekkerman & McCallum, 2005) ⇒ Ron Bekkerman and Andrew McCallum. (2005). “Disambiguating Web Appearance of People in a Social Network.” In: Proceedings of WWW-2005.
  • A Person Mention Resolution Algorithm.

2003

• (Mann and Yarowsky, 2003) ⇒ Gideon S. Mann, David Yarowsky. (2003). “Unsupervised personal name disambiguation." Proceedings of HLT-NAACL (2003).
  • An Unsupervised Person Mention Resolution Algorithm.

1992

• C. L. Borgman, and S. L. Siegfried. (1992). “Getty's synoname and its cousins: A survey of applications of personal name-matching algorithms. Journal of the American Society for Information Science.

---