Dynamic time warping algorithms for isolated and connected word recognition
The NATO Advanced Study Institute on new systems and architectures for automatic speech recognition and synthesis on New systems and architectures for automatic speech recognition and synthesis
Modelling (sub)string-length based constraints through a grammatical inference method
Proc. of the NATO Advanced Study Institute on Pattern recognition theory and applications
The String-to-String Correction Problem
Journal of the ACM (JACM)
Dynamic Programming
Computation of Normalized Edit Distance and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
A new approach to sequence comparison: normalized sequence alignment
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Median strings for k-nearest neighbour classification
Pattern Recognition Letters
Reducing the Computational Cost of Computing Approximated Median Strings
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Learning Significant Alignments: An Alternative to Normalized Local Alignment
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Automatic acquisition of two-level morphological rules
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
A Normalized Levenshtein Distance Metric
IEEE Transactions on Pattern Analysis and Machine Intelligence
Variability Tolerant Audio Motif Discovery
MMM '09 Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling
A Screening Method for Z-Value Assessment Based on the Normalized Edit Distance
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Fuzzy automata with ε-moves compute fuzzy measures between strings
Fuzzy Sets and Systems
The UPV-PRHLT combination system for WMT 2010
WMT '10 Proceedings of the Joint Fifth Workshop on Statistical Machine Translation and MetricsMATR
Biometric animal databases from field photographs: identification of individual zebra in the wild
Proceedings of the 1st ACM International Conference on Multimedia Retrieval
Comparing string representations and distances in a natural images classification task
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Generalized median string computation by means of string embedding in vector spaces
Pattern Recognition Letters
Information Processing and Management: an International Journal
On the dynamic time warping of cyclic sequences for shape retrieval
Image and Vision Computing
| Hi-index | 0.15 |
The Normalized Edit Distance (NED) between two strings X and Y is defined as the minimum quotient between the sum of weights of the edit operations required to transform X into Y and the length of the editing path corresponding to these operations. An algorithm for computing the NED has recently been introduced by Marzal and Vidal that exhibits O(mn2) computing complexity, where m and n are the lengths of X and Y. We propose here an algorithm that is observed to require in practice the same O(mn) computing resources as the conventional unnormalized Edit Distance algorithm does. The performance of this algorithm is illustrated through computational experiments with synthetic data, as well as with real data consisting of OCR chain-coded strings.