SecondString System
Jump to navigation
Jump to search
The SecondString System is a open-source Java-based package of approximate string-matching techniques.
- See: String Distance Function.
References
2010
- http://secondstring.sourceforge.net/
- 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.
- 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.
- http://sourceforge.net/projects/secondstring/
- SecondString is a Java toolkit for developing and evaluating approximate string comparision operators. It includes abstract classes for various edit-distance based comparators, concrete implementations of several published approximate comparators, a suit
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).