String Distances and Uniformities

Abstract. The Levenstein or edit distance was developed as a metric for calculating distances between character strings. We are looking at weighting the different edit operations (insertion, deletion, substitution) to obtain different types of classifications of sets of strings. As a more general and less constrained approach we introduce topological notions and in particular uniformities.

• Type: Conference
• Year: 2009
• Where: ICANNGA
• Authors: David W. Pearson, Jean-Christophe Janodet
• Keywords: Algorithms, Character Strings, Constrained Approach, Edit Distance, ICANNGA 2009