Citation

List of Papers Cited in this website

[Wagner1974]

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

https://dl.acm.org/doi/pdf/10.1145/321796.321811

[Ukkonen1985]

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

https://core.ac.uk/download/pdf/81135723.pdf

[Myers1999]

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

https://core.ac.uk/download/pdf/189740935.pdf

[Schimke2004]

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.

http://zeus.fh-brandenburg.de/~vielhaue/jabreflib/[ScVD2004].pdf

[Bocek2007]

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

https://fastss.csg.uzh.ch/ifi-2007.02.pdf

[Serva2008]

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

https://arxiv.org/pdf/0708.2971