String distances and uniformities

Authors:
David W. Pearson;Jean-Christophe Janodet
Affiliations:
University of Saint-Etienne, St-Etienne;University of Saint-Etienne, St-Etienne
Venue:
ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms
Year:
2009

Citing 8
Cited 0

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
The String-to-String Correction Problem

Journal of the ACM (JACM)
A guided tour to approximate string matching

ACM Computing Surveys (CSUR)
Searching in metric spaces

ACM Computing Surveys (CSUR)
Language Simplification through Error-Correcting and Grammatical Inference Techniques

Machine Learning
Smoothing Probabilistic Automata: An Error-Correcting Approach

ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Algorithms on Strings

Algorithms on Strings
Learning Balls of Strings from Edit Corrections

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.00

Visualization

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.