SC spectra: A linear-time soft cardinality approximation for text comparison

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

Volumn 7095 LNAI, Issue PART 2, 2011, Pages 213-224

  Jiménez Vargas, Sergio ^a   Gelbukh, Alexander ^b  

^a UNIVERSIDAD NACIONAL DE COLOMBIA   (Colombia)

^b INSTITUTO POLITÉCNICO NACIONAL   (Mexico)

Author keywords

approximate text comparison; ngrams; q grams; soft cardinality; soft cardinality spectra

Indexed keywords

APPROXIMATE TEXT COMPARISON; CARDINALITIES; DIFFERENT SIZES; LINEAR TIME; N-GRAMS; NAME MATCHING; Q-GRAMS; RESEMBLANCE COEFFICIENTS; SIMILARITY FUNCTIONS; SIMILARITY MEASURE; SUB-STRINGS; TEXT STRING;

ARTIFICIAL INTELLIGENCE; SOFT COMPUTING;

INFORMATION RETRIEVAL;

EID: 82555180517     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25330-0_19     Document Type: Conference Paper

References (23)

1. Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison Wesley & ACM Press (1999)
2. Barceló, G., Cendejas, E., Bolshakov, I., Sidorov, G.: Ambigüedad en nombres hispanos. Revista Signos. Estudios de Lingüística 42(70), 153-169 (2009)
3. Barceló, G., Cendejas, E., Sidorov, G., Bolshakov, I.A.: Formal Grammar for Hispanic Named Entities Analysis. In: Gelbukh, A. (ed.) CICLing 2009. LNCS, vol. 5449, pp. 183-194. Springer, Heidelberg (2009)
4. Bilenko, M., Mooney, R., Cohen, W.W., Ravikumar, P., Fienberg, S.: Adaptive name matching in information integration. IEEE Intelligent Systems 18(5), 16-23 (2003), http://portal.acm.org/citation.cfm?id=1137237.1137369
5. Chaudhuri, S., Ganjam, K., Ganti, V., Motwani, R.: Robust and efficient fuzzy match for online data cleaning. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 313-324. ACM, San Diego (2003), http://portal.acm.org/citation.cfm?id=872757.872796
6. Christen, P.: A comparison of personal name matching: Techniques and practical issues. In: International Conference on Data MiningWorkshops, pp. 290-294. IEEE Computer Society, Los Alamitos (2006)
7. Cilibrasi, R., Vitanyi, P.: Clustering by compression. IEEE Transactions on Information Theory, 1523-1545 (2005)
8. Cohen, W.W., Ravikumar, P., Fienberg, S.E.: A comparison of string distance metrics for name-matching tasks. In: Proceedings of the IJCAI 2003 Workshop on Information Integration on the Web, pp. 73-78 (August 2003), http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.178
9. de la Higuera, C., Mico, L.: A contextual normalised edit distance. In: IEEE 24th International Conference on Data Engineering Workshop, Cancun, Mexico, pp. 354-361 (2008), http://portal.acm.org/citation.cfm?id=1547551.1547758
10. Jimenez, S., Becerra, C., Gelbukh, A., Gonzalez, F.: Generalized Mongue-Elkan Method For Approximate Text String Comparison. In: Gelbukh, A. (ed.) CICLing 2009. LNCS, vol. 5449, pp. 559-570. Springer, Heidelberg (2009), http://dx.doi.org/10.1007/978-3-642-00382-0-45
11. Jimenez, S., Gonzalez, F., Gelbukh, A.: Text Comparison Using Soft Cardinality. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 297-302. Springer, Heidelberg (2010), http://www.springerlink.com/content/ x1w783135m36k880/
12. Köpcke, H., Thor, A., Rahm, E.: Evaluation of entity resolution approaches on real-world match problems. In: Proceedings of the 36th International Conference on Very Large Data Bases, Singapore (2010)
13. Kukich, K.: Techniques for automatically correcting words in text. ACM Computing Surveys 24, 377-439 (1992)
14. Leslie, C., Eskin, E., Noble, W.S.: The spectrum kernel: A string kernel for SVM protein classification. In: Biocomputing 2002 - Proceedings of the Pacific Symposium, Kauai, Hawaii, USA, pp. 564-575 (2001), http://eproceedings. worldscinet.com/ 9789812799623/9789812799623-0053.html
15. Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10(8), 707-710 (1966)
16. Lin, D.: Information-Theoretic definition of similarity. In: Proceedings of the Fifteenth International Conference on Machine Learning, pp. 296-304 (1998), http://portal.acm.org/citation.cfm?id=645527.657297&coll=Portal &dl=GUIDE&CFID=92419400&CFTOKEN=72654004
17. Monge, A.E., Elkan, C.: The field matching problem: Algorithms and applications. In: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD), Portland, OR, pp. 267-270 (August 1996)
18. Moreau, E., Yvon, F., Cappé, O.: Robust similarity measures for named entities matching. In: Proceedings of the 22nd International Conference on Computational Linguistics, pp. 593-600 (2008), http://portal.acm.org/citation. cfm?id=1599081.1599156
19. Piskorski, J., Sydow, M.: Usability of string distance metrics for name matching tasks in polish. In: Proceedings of the 3rd Language & Technology Conference: Human Language Technologies as a Challenge for Computer Science and Linguistics (LTC 2007), Poznań, Poland, October 5-7 (2007), http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.9942 20.
20. Salton, G.: Introduction to modern information retrieval. McGraw-Hill (1983)
21. Sarker, B.R.: The resemblance coefficients in group technology: A survey and comparative study of relational metrics. Computers & Industrial Engineering 30(1), 103-116 (1996), http://dx.doi.org/10.1016/0360-83529500024-0
22. Tejada, S., Knoblock, C.A.: Learning domain independent string transformation weights for high accuracy object identification. In: Proceedings of International Conference on Knowledge Discovery and Data Mining, SIGKDD (2002)
23. Winkler, W.E.: The state of record linkage and current research problems. Statistical research divison U.S. Census Bureau (1999), http://citeseerx.ist. psu.edu/viewdoc/summary?doi=10.1.1.39.4336