An integer linear programming approach for approximate string comparison

European Journal of Operational Research

Volumn 198, Issue 3, 2009, Pages 706-714

  Ritt, Marcus ^a   Costa, Alysson M ^b   Mergen, Sergio ^a   Orengo, Viviane M ^a  

^a FEDERAL UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Approximate string matching; Block edits; Block moves; Distance metric; Hop constraints; Integer programming

Indexed keywords

APPROXIMATE STRING MATCHING; BLOCK EDITS; BLOCK MOVES; DISTANCE METRIC; HOP CONSTRAINTS;

DYNAMIC PROGRAMMING; LINEARIZATION; PARTICLE SIZE ANALYSIS;

INTEGER PROGRAMMING;

EID: 64049089981     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.10.013     Document Type: Article

References (12)

1. Bilenko M., Mooney R., Cohen W.W., Ravikumar P., and Fienberg S. Adaptive name matching in information integration. IEEE Intelligent Systems 18 5 (2003) 16-23
2. Buss, S.R., Yianilos, P.N., 1995. A bipartite matching approach to approximate string comparison and search, Technical Report 95-193, NEC Research Institute.
3. Chapman, S., 2006. Simmetrics. .
4. Christen, P., Churches, T., Hegland, M., 2004. FEBRL - a parallel open source data linkage system. In: Proceedings of PAKDD (LNAI 3056). Springer, pp. 638-647.
5. Costa, A.M., Cordeau, J.F., Laporte, G., forthcoming. Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints. Networks.
6. Gouveia L. Using hop-indexed models for constrained spanning and Steiner tree models. In: Sansò B., and Soriano P. (Eds). Telecommunications Network Planning (1999), Kluwer, Boston 21-32
7. Heuser, C., Krieser, F.N.A., Orengo, V.M., 2007. Simeval - a tool for evaluating the quality of similarity functions. In: Grundy, J., Laender, A.H.F., Maciaszek, L., Roddick, J.F. (Eds), Twenty-Sixth International Conference on Conceptual Modeling - ER 2007 - Tutorials, Posters, Panels and Industrial Contributions, Australian Computer Society, Auckland, New Zealand.
8. Levenshtein V. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady 10 8 (1966) 707-710
9. Lopresti D., and Tomkins A. Block edit models for approximate string matching. Theoretical Computer Science 181 (1997) 159-179
10. Mergen S., and Heuser C. Carla: Uma técnica para comparação de cadeias de caractéres. I Escola Regional de Banco de Dados (2005), SBC, Porto Alegre pp. 55-70
11. Navarro G. A guided tour to approximate string matching. ACM Computing Surveys 33 1 (2001) 31-88
12. Tichy W.F. The string-to-string correction problem with block moves. ACM Transactions on Computer Systems 2 4 (1984) 309-321