Recognition of Noisy Subsequences Using Constrained Edit Distances
IEEE Transactions on Pattern Analysis and Machine Intelligence
Techniques for automatically correcting words in text
ACM Computing Surveys (CSUR)
Pattern Recognition Letters
The String-to-String Correction Problem
Journal of the ACM (JACM)
Computer programs for detecting and correcting spelling errors
Communications of the ACM
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Computation of Normalized Edit Distance and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Computation of Normalized Edit Distances
IEEE Transactions on Pattern Analysis and Machine Intelligence
Comparison of AESA and LAESA search algorithms using string and tree-edit-distances
Pattern Recognition Letters
An Efficient Uniform-Cost Normalized Edit Distance Algorithm
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Signatures versus histograms: Definitions, distances and algorithms
Pattern Recognition
Dynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints
INFORMS Journal on Computing
The Noisy Substring Matching Problem
IEEE Transactions on Software Engineering
Behavior-based speciation for evolutionary robotics
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Tree-Based Microaggregation for the Anonymization of Search Logs
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Using gestures on mobile phones to create SMS comics
Proceedings of the fourth international conference on Tangible, embedded, and embodied interaction
Discovering several robot behaviors through speciation
Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
A metric normalization of tree edit distance
Frontiers of Computer Science in China
Studying software evolution using artefacts' shared information content
Science of Computer Programming
WMT '11 Proceedings of the Sixth Workshop on Statistical Machine Translation
For human eyes only: security and usability evaluation
Proceedings of the 2012 ACM workshop on Privacy in the electronic society
Group behavior metrics for p2p botnet detection
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Retrieval and clustering for supporting business process adjustment and analysis
Information Systems
| Hi-index | 0.14 |
Although a number of normalized edit distances presented so far may offer good performance in some applications, none of them can be regarded as a genuine metric between strings because they do not satisfy the triangle inequality. Given two strings X and Y over a finite alphabet, this paper defines a new normalized edit distance between X and Y as a simple function of their lengths (|X| and |Y|) and the Generalized Levenshtein Distance (GLD) between them. The new distance can be easily computed through GLD with a complexity of O(|X| \cdot |Y|) and it is a metric valued in [0, 1] under the condition that the weight function is a metric over the set of elementary edit operations with all costs of insertions/deletions having the same weight. Experiments using the AESA algorithm in handwritten digit recognition show that the new distance can generally provide similar results to some other normalized edit distances and may perform slightly better if the triangle inequality is violated in a particular data set.