Recognition of Noisy Subsequences Using Constrained Edit Distances
IEEE Transactions on Pattern Analysis and Machine Intelligence
Information Sciences: an International Journal
Pattern Recognition Letters
Introduction to algorithms
Optimal Correspondence of String Subsequences
IEEE Transactions on Pattern Analysis and Machine Intelligence
Introduction to statistical pattern recognition (2nd ed.)
Introduction to statistical pattern recognition (2nd ed.)
Elements of information theory
Elements of information theory
International Journal of Computer Vision
Fundamentals of speech recognition
Fundamentals of speech recognition
Attributed String Matching by Split-and-Merge for On-Line Chinese Character Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Markov random field modeling in computer vision
Markov random field modeling in computer vision
Learning Texture Discrimination Masks
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Normalized String Editing Problem Revisited
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Real-Time Matching System for Large Fingerprint Databases
IEEE Transactions on Pattern Analysis and Machine Intelligence
Geometric and Illumination Invariants for Object Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
The String-to-String Correction Problem
Journal of the ACM (JACM)
An Extension of the String-to-String Correction Problem
Journal of the ACM (JACM)
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
Dynamic Programming
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Pattern Recognition, Third Edition
Pattern Recognition, Third Edition
Color object indexing and retrieval in digital libraries
IEEE Transactions on Image Processing
A Network Analysis Model for Disambiguation of Names in Lists
Computational & Mathematical Organization Theory
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
A general framework for subjective information extraction from unstructured English text
Data & Knowledge Engineering
An Efficient Web Page Change Detection System Based on an Optimized Hungarian Algorithm
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Pattern Analysis and Machine Intelligence
Numerical sequence matching based on local sum functions
Pattern Recognition Letters
Detecting duplicate biological entities using Shortest Path Edit Distance
International Journal of Data Mining and Bioinformatics
Theory of a probabilistic-dependence measure of dissimilarity among multiple clusters
ICANN'06 Proceedings of the 16th international conference on Artificial Neural Networks - Volume Part II
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
A better edit distance measure allowing for block swaps
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Hi-index | 0.14 |
Abstract--Edit distance was originally developed by Levenstein several decades ago to measure the distance between two strings. It was found that this distance can be computed by an elegant dynamic programming procedure. The edit distance has played important roles in a wide array of applications due to its representational efficacy and computational efficiency. To effect a more reasonable distance measure, the normalized edit distance was proposed. Many algorithms and studies have been dedicated along this line with impressive performances in recent years. There is, however, a fundamental problem with the original definition of edit distance that has remained elusive: its context-free nature. In determining the p ossible actions, i.e., insertion, deletion, and substitution, no systematic consideration was given to the local behaviors of the string/pattern in question that indeed encompass great amount of useful information regarding its content. In this paper, inspired by the success of the Markov Random Field theory, a new edit distance called Markov edit distance (MED) within the dynamic programming framework is proposed to take full advantage of the local statistical dependencies in the pattern in order to arrive at enhanced matching performance. Within this framework, two specialized distance measures are developed: The reshuffling MED to handle cases where a subpattern in the target pattern is the reshuffles of that in the source pattern, and the coherence MED which is able to incur local content based substitution, insertion, and deletion. The applications based on these two MEDs in string matching are then explored, whereof encouraging empirical results have been observed.