On Computing the Jaro Similarity Between Two Strings
International Symposium on Bioinformatics Research and Applications (ISBRA), LNCS, 2023
Recommended citation: J. Basak, A. T. Soliman, N. Deo, K. B. Haase, A. Mathur, K. Park, R. C. Steorts, D. H. Weinberg, S. Sahni, S. Rajasekaran. (2023). "On Computing the Jaro Similarity Between Two Strings." International Symposium on Bioinformatics Research and Applications (ISBRA), LNCS. https://doi.org/10.1007/978-981-99-7074-2_3
Shows that standard Jaro similarity algorithms take quadratic time in the worst case, and gives a linear-time algorithm that computes the same measure.
Authors: J. Basak, A. T. Soliman, N. Deo, K. B. Haase, A. Mathur, K. Park, R. C. Steorts, D. H. Weinberg, S. Sahni, S. Rajasekaran