The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition. I want to compare a newly developed string matching algorithm with standart algorithms such as Jaro, Jaro-Winkler, Levenshtein, Monge-Elkan, Smith Waterman etc.
I need experimental datasets for algoritm evaluation purposes...