Monge-Elkan Distance Function

A Monge-Elkan Distance Function is a string-edit distance function that is based on (Monge & Elkan, 1996).

• See: String Distance Function, Record Deduplication Task.

---

---

References

2009

• http://www.dcs.shef.ac.uk/~sam/stringmetrics.html#monge
  • QUOTE: This distance is often incorrectly referred to as an implementation of the Smith-Waterman distance approach. As in the original work of Monge and Elkan they called this Smith-Waterman, but actually, this uses an affine gap model, so it's not Smith-Waterman at all but rather the extended Gotoh distance. Specific details can be found regarding the Monge Elkan edit distance function in the following paper:

2003

• (Cohen et al., 2003) ⇒ William W. Cohen, Pradeep Ravikumar, and Stephen E. Fienberg. (2003). “A Comparison of String Distance Metrics for Name-Matching Tasks.” In: Workshop on Information Integration on the Web (IIWeb-03).

1996

• (Monge & Elkan, 1996) ⇒ Alvaro E. Monge, and Charles P. Elkan. (1996). “The Field Matching Problem: Algorithms and Applications.” In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD 1996).

---