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
Optimal Correspondence of String Subsequences
IEEE Transactions on Pattern Analysis and Machine Intelligence
The String-to-String Correction Problem
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
The Normalized String Editing Problem Revisited
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Lexicon-Driven Handwritten Word Recognition Using Optimal Linear Combinations of Order Statistics
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
A tree-edit-distance algorithm for comparing simple, closed shapes
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Space Curve Representation and Recognition Based on Wavelet Transform Zero-Crossings
Journal of Mathematical Imaging and Vision
A new approach to sequence comparison: normalized sequence alignment
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
A fast filtering scheme for large database cleansing
Proceedings of the eleventh international conference on Information and knowledge management
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Computation of Normalized Edit Distances
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Evidence Accumulation Clustering Based on the K-Means Algorithm
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Efficient Alignment and Correspondence Using Edit Distance
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Partitional vs Hierarchical Clustering Using a Minimum Grammar Complexity Approach
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
MICCAI '01 Proceedings of the 4th International Conference on Medical Image Computing and Computer-Assisted Intervention
A User Study in Similarity Measures for Graph Drawing
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Statistical Identification of Uniformly Mutated Segments within Repeats
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Automatic Hierarchical Classification of Silhouettes of 3D Objects
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
A New Cluster Isolation Criterion Based on Dissimilarity Increments
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Approximate String Matching Using Deformed Fuzzy Automata: A Learning Experience
Fuzzy Optimization and Decision Making
Efficient Relational Matching with Local Edit Distance
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
Relaxing stylus typing precision by geometric pattern matching
Proceedings of the 10th international conference on Intelligent user interfaces
On map-matching vehicle tracking data
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Automatic identification of digital video based on shot-level sequence matching
Proceedings of the 13th annual ACM international conference on Multimedia
Influence of Zoning on Whole Word Recognition
ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
A Normalized Levenshtein Distance Metric
IEEE Transactions on Pattern Analysis and Machine Intelligence
Towards automated record linkage
AusDM '06 Proceedings of the fifth Australasian conference on Data mining and analystics - Volume 61
Detecting repeats for video structuring
Multimedia Tools and Applications
Image categorization: Graph edit distance+edge direction histogram
Pattern Recognition
An Improved Connectionist Translator between Natural Languages
IBERAMIA '08 Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence
An Efficient Method for Near-Duplicate Video Detection
PCM '08 Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Scientometric analysis of the CHI proceedings
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
On the similarity metric and the distance metric
Theoretical Computer Science
An Ensemble Based Translator for Natural Languages
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
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
Transfer non-metric measures into metric for similarity search
MM '09 Proceedings of the 17th ACM international conference on Multimedia
Evaluation of string distance algorithms for dialectology
LD '06 Proceedings of the Workshop on Linguistic Distances
Fuzzy automata with ε-moves compute fuzzy measures between strings
Fuzzy Sets and Systems
Some experiments on clustering a set of strings
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Finding similar failures using callstack similarity
SysML'08 Proceedings of the Third conference on Tackling computer systems problems with machine learning techniques
A knowledge-rich approach to measuring the similarity between Bulgarian and Russian words
MRTECEEL '09 Proceedings of the Workshop on Multilingual Resources, Technologies and Evaluation for Central and Eastern European Languages
Indexing inexact proximity search with distance regression in pivot space
Proceedings of the Third International Conference on SImilarity Search and APplications
Detecting nearly duplicated records in location datasets
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
A mining technique using n-grams and motion transcripts for body sensor network data repository
WH '10 Wireless Health 2010
A novel contour descriptor for 2D shape matching and its application to image retrieval
Image and Vision Computing
A metric normalization of tree edit distance
Frontiers of Computer Science in China
On nonmetric similarity search problems in complex domains
ACM Computing Surveys (CSUR)
Biometric animal databases from field photographs: identification of individual zebra in the wild
Proceedings of the 1st ACM International Conference on Multimedia Retrieval
Interactive schematic summaries for exploration of surveillance video
Proceedings of the 1st ACM International Conference on Multimedia Retrieval
Fast Handover in Hierarchical Mobile IPv6 Based on Motion Pattern Detection of Mobile Node
Wireless Personal Communications: An International Journal
Poster: can it be more practical?: improving mouse dynamics biometric performance
Proceedings of the 18th ACM conference on Computer and communications security
Using strings for on-line handwriting shape matching: a new weighted edit distance
ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing
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
Some new results on non-rigid correspondence and classification of curves
EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Generalized median string computation by means of string embedding in vector spaces
Pattern Recognition Letters
An integrated distance for atoms
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
N-gram similarity and distance
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Scoring matrices that induce metrics on sequences
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
On the dynamic time warping of cyclic sequences for shape retrieval
Image and Vision Computing
Asymmetric signature schemes for efficient exact edit similarity query processing
ACM Transactions on Database Systems (TODS)
Effectiveness of an implementation method for retrieving similar strings by trie structures
International Journal of Computer Applications in Technology
A template matching approach of one-shot-learning gesture recognition
Pattern Recognition Letters
Retrieval and clustering for supporting business process adjustment and analysis
Information Systems
Journal of Visual Communication and Image Representation
| Hi-index | 0.15 |
Given two strings X and Y over a finite alphabet, the normalized edit distance between X and Y, d(X,Y) is defined as the minimum of W(P)/L(P), where P is an editing path between X and Y, W(P) is the sum of the weights of the elementary edit operations of P, and L(P) is the number of these operations (length of P). It is shown that in general, d(X,Y) cannot be computed by first obtaining the conventional (unnormalized) edit distance between X and Y and then normalizing this value by the length of the corresponding editing path. In order to compute normalized edit distances, an algorithm that can be implemented to work in O(m*n/sup 2/) time and O(n/sup 2/) memory space is proposed, where m and n are the lengths of the strings under consideration. Experiments in hand-written digit recognition are presented, revealing that the normalized edit distance consistently provides better results than both unnormalized or post-normalized classical edit distances.