This is the project page for SecondString, an open-source Java-based package of approximate string-matching techniques. This code was developed by researchers at Carnegie Mellon University from the Center for Automated Learning and Discovery, the Department of Statistics, and the Center for Computer and Communications Security.
SecondString is intended primarily for researchers in information integration and other scientists. It does or will include a range of string-matching methods from a variety of communities, including statistics, artificial intelligence, information retrieval, and databases. It also includes tools for systematically evaluating performance on test data. It is not designed for use on very large data sets.
R. Zafarani, and H. Liu. Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, page 41--49. New York, NY, USA, ACM, (2013)
Y. Zhang, J. Tang, Z. Yang, J. Pei, and P. Yu. Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, page 1485--1494. New York, NY, USA, ACM, (2015)
N. Aswani, K. Bontcheva, and H. Cunningham. Proceedings of the 5th International Conference on The Semantic Web, page 329--342. Berlin/Heidelberg, Springer, (2006)
E. Raad, R. Chbeir, and A. Dipanda. Proceedings of the 2010 13th International Conference on Network-Based Information Systems, page 297--304. Washington, DC, USA, IEEE Computer Society, (2010)