Results 171 to 180 of about 17,818 (198)

Structural offline handwriting character recognition using levenshtein distance

2015 International Conference on Electrical Engineering and Informatics (ICEEI), 2015
Research in offline handwriting recognition for unconstrained text remains a difficult challenge. Some problems such as noise in image, skew of text, cursive letters, and various handwriting style is still an open problem. Many method has been researched to solve those problems, such as k-NN, Neural Network, SVM and HMM.
Made Edwin Wira Putra, Iping Supriana
openaire   +1 more source

Localizing Unordered Panoramic Images Using the Levenshtein Distance

2007 IEEE 11th International Conference on Computer Vision, 2007
This paper proposes a feature-based method for recovering the relative positions of the viewpoints of a set of panoramic images for which no a priori order information is available, along with certain structure information regarding the imaged environment.
Damien Michel, Antonis A. Argyros, Manolis I.A. Lourakis   +2 more
openaire   +1 more source

Computing the Levenshtein distance of a regular language

IEEE Information Theory Workshop, 2005., 2005
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the words into the other. In this paper we consider the problem of computing the edit distance of a regular language (also known as constraint system), that is, the set of words
openaire   +1 more source

Isolated word recognition using the weighted Levenshtein distance

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
The use of dynamic programming in isolated word recognition is interpreted in terms of symbols-string processing. The use of the weighted Levenshtein distance (WLD) is discussed. A modification of the WLD gives insensitivity to overall word duration while automatically discriminating against warping functions having excessively steep and excessively ...
openaire   +1 more source

Isometry Groups of Formal Languages for Generalized Levenshtein Distances

Mathematical Notes
The paper investigates isometry groups of formal languages equipped with generalized Levenshtein distances, a family of edit distances where insertion and deletion share the same weight \(\gamma > 0\) and substitution has weight \(\theta > 0\) (see [\textit{V. I. Levenshtein}, Dokl. Akad. Nauk SSSR 163, 845--848 (1965; Zbl 0149.15905)]). The main focus
openaire   +1 more source

Automated Test Scenario Selection Based on Levenshtein Distance

2010
Specification based testing involves generating test cases from the specification, here, UML. The number of automatically generated test scenarios from UML activity diagrams is large and hence impossible to test completely. This paper presents a method for selection of test scenarios generated from activity diagrams using Levenshtein distance.
Sapna P.G., Hrushikesha Mohanty
openaire   +1 more source

Codes for the Asymmetric Damerau–Levenshtein Distance

2022 IEEE Information Theory Workshop (ITW), 2022
Shuche Wang, Van Khu Vu, Vincent Y. F. Tan   +2 more
openaire   +1 more source

Levenshtein distance for graph spectral features

Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004., 2004
R.C. Wilson, E.R. Hancock
openaire   +1 more source

A novel approach for the structural comparison of origin-destination matrices: Levenshtein distance

Transportation Research Part C: Emerging Technologies, 2020
Krishna N S Behara, Ashish Bhaskar, Edward Chung   +2 more
exaly  

Comparing Levenshtein distance and dynamic time warping in predicting listeners’ judgments of accent distance

Speech Communication, 2023
Holly Lind-Combs
exaly