List of Papers Cited in this website


Wagner, Robert A., and Michael J. Fischer. “The string-to- string correction problem.” Journal of the ACM 21.1 (1974): 168-173.


Ukkonen, Esko. “Algorithms for approximate string matching.” Information and control 64.1-3 (1985): 100-118.


Myers, Gene. “A fast bit-vector algorithm for approximate string matching based on dynamic programming.” Journal of ACM (JACM) 46.3 (1999): 395-415.


Schimke, Sascha, Claus Vielhauer, and Jana Dittmann. “Using adapted levenshtein distance for on-line signature authentication.” Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.. Vol. 2. IEEE, 2004.[ScVD2004].pdf


Bocek, Thomas, et al. Fast similarity search in large dictionaries. 2007.


Serva, M., & Petroni, F. (2008). Indo-European languages tree by Levenshtein distance. EPL (Europhysics Letters), 81(6), 68005.