1. D. Pierrakos, G. Paliouras, Personalizing Web Directories with the Aid of Web Usage Data. IEEE Trans. Knowl. Data Eng. 22(9), 1331–1344 (2010)
2. H. Hyyro, A bit-vector algorithm for computing Levenshtein and Damerau edit distances. Nord. J. Comput. 10(1), 29–39 (2002)
3. S. Burkhardt, J. Karkkainen, One gapped q-gram filters for Levenshtein distance, in CPM. Springer LNCS, vol. 2373 (2002) pp. 225–234
4. S. Rane, W. Sun, Privacy preserving string comparisons based on leveinstein distance, in Proceedings of IEEE International Workshop on Information Forensics and Security (2010), pp. 1–6
5. M. Bilenko, R. Mooney, W. Cohen, P. Ravikumar, S. Fienberg, Adaptive name matching in information integration. IEEE J. Intell. Syst. 18(5), 16–23 (2003)