Generalized Mongue-Elkan method for approximate text string comparison

Sergio Jimenez; Claudia Becerra; Alexander Gelbukh; Fabio Gonzalez

doi:10.1007/978-3-642-00382-0_45

Generalized Mongue-Elkan method for approximate text string comparison

Sergio Jimenez, Claudia Becerra, Alexander Gelbukh, Fabio Gonzalez

Centro de Investigación en Computación (CIC)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

26 Scopus citations

Abstract

The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token level (i.e. word level) similarity measure. We propose a generalization of this method based on the notion of the generalized arithmetic mean instead of the simple average used in the expression to calculate the Monge-Elkan method. The experiments carried out with 12 well-known name-matching data sets show that the proposed approach outperforms the original Monge-Elkan method when character-based measures are used to compare tokens.

Original language	English
Title of host publication	Computational Linguistics and Intelligent Text Processing - 10th International Conference, CICLing 2009, Proceedings
Pages	559-570
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-00382-0_45
State	Published - 2009
Event	10th International Conference on Computational Linguistics and Intelligent Text Processing, CICLing 2009 - Mexico City, Mexico Duration: 1 Mar 2009 → 7 Mar 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5449 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	10th International Conference on Computational Linguistics and Intelligent Text Processing, CICLing 2009
Country/Territory	Mexico
City	Mexico City
Period	1/03/09 → 7/03/09

Access to Document

10.1007/978-3-642-00382-0_45

Cite this

Jimenez, S., Becerra, C., Gelbukh, A., & Gonzalez, F. (2009). Generalized Mongue-Elkan method for approximate text string comparison. In Computational Linguistics and Intelligent Text Processing - 10th International Conference, CICLing 2009, Proceedings (pp. 559-570). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5449 LNCS). https://doi.org/10.1007/978-3-642-00382-0_45

Jimenez, Sergio ; Becerra, Claudia ; Gelbukh, Alexander et al. / Generalized Mongue-Elkan method for approximate text string comparison. Computational Linguistics and Intelligent Text Processing - 10th International Conference, CICLing 2009, Proceedings. 2009. pp. 559-570 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{cc0b31ade7ce4c92b8832e886febe899,

title = "Generalized Mongue-Elkan method for approximate text string comparison",

abstract = "The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token level (i.e. word level) similarity measure. We propose a generalization of this method based on the notion of the generalized arithmetic mean instead of the simple average used in the expression to calculate the Monge-Elkan method. The experiments carried out with 12 well-known name-matching data sets show that the proposed approach outperforms the original Monge-Elkan method when character-based measures are used to compare tokens.",

author = "Sergio Jimenez and Claudia Becerra and Alexander Gelbukh and Fabio Gonzalez",

year = "2009",

doi = "10.1007/978-3-642-00382-0_45",

language = "Ingl{\'e}s",

isbn = "3642003818",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "559--570",

booktitle = "Computational Linguistics and Intelligent Text Processing - 10th International Conference, CICLing 2009, Proceedings",

note = "10th International Conference on Computational Linguistics and Intelligent Text Processing, CICLing 2009 ; Conference date: 01-03-2009 Through 07-03-2009",

}

Jimenez, S, Becerra, C, Gelbukh, A & Gonzalez, F 2009, Generalized Mongue-Elkan method for approximate text string comparison. in Computational Linguistics and Intelligent Text Processing - 10th International Conference, CICLing 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5449 LNCS, pp. 559-570, 10th International Conference on Computational Linguistics and Intelligent Text Processing, CICLing 2009, Mexico City, Mexico, 1/03/09. https://doi.org/10.1007/978-3-642-00382-0_45

Generalized Mongue-Elkan method for approximate text string comparison. / Jimenez, Sergio; Becerra, Claudia; Gelbukh, Alexander et al.
Computational Linguistics and Intelligent Text Processing - 10th International Conference, CICLing 2009, Proceedings. 2009. p. 559-570 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5449 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Generalized Mongue-Elkan method for approximate text string comparison

AU - Jimenez, Sergio

AU - Becerra, Claudia

AU - Gelbukh, Alexander

AU - Gonzalez, Fabio

PY - 2009

Y1 - 2009

N2 - The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token level (i.e. word level) similarity measure. We propose a generalization of this method based on the notion of the generalized arithmetic mean instead of the simple average used in the expression to calculate the Monge-Elkan method. The experiments carried out with 12 well-known name-matching data sets show that the proposed approach outperforms the original Monge-Elkan method when character-based measures are used to compare tokens.

AB - The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token level (i.e. word level) similarity measure. We propose a generalization of this method based on the notion of the generalized arithmetic mean instead of the simple average used in the expression to calculate the Monge-Elkan method. The experiments carried out with 12 well-known name-matching data sets show that the proposed approach outperforms the original Monge-Elkan method when character-based measures are used to compare tokens.

UR - http://www.scopus.com/inward/record.url?scp=67650550255&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-00382-0_45

DO - 10.1007/978-3-642-00382-0_45

M3 - Contribución a la conferencia

SN - 3642003818

SN - 9783642003813

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 559

EP - 570

BT - Computational Linguistics and Intelligent Text Processing - 10th International Conference, CICLing 2009, Proceedings

T2 - 10th International Conference on Computational Linguistics and Intelligent Text Processing, CICLing 2009

Y2 - 1 March 2009 through 7 March 2009

ER -

Jimenez S, Becerra C, Gelbukh A, Gonzalez F. Generalized Mongue-Elkan method for approximate text string comparison. In Computational Linguistics and Intelligent Text Processing - 10th International Conference, CICLing 2009, Proceedings. 2009. p. 559-570. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-00382-0_45

Generalized Mongue-Elkan method for approximate text string comparison

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this