Results 161 to 170 of about 17,818 (198)

A Normalized Levenshtein Distance Metric

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2007
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 ...
Li, Yujian, Liu, Bo
openaire   +4 more sources

Representing Tone in Levenshtein Distance

International Journal of Humanities and Arts Computing, 2008
Levenshtein distance, also known as string edit distance, has been shown to correlate strongly with both perceived distance and intelligibility in various Indo-European languages ( Gooskens and Heeringa, 2004 ; Gooskens, 2006 ). We apply Levenshtein distance to dialect data from Bai ( Allen, 2004 ), a Sino-Tibetan language, and Hongshuihe (HSH) Zhuang
Castro, Andy., Yang, Cathryn.
openaire   +1 more source

Kernels based on weighted Levenshtein distance

2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541), 2005
In some real world applications, the sample could be described as a string of symbols rather than a vector of real numbers. It is necessary to determine the similarity or dissimilarity of two strings in many training algorithms. The widely used notion of similarity of two strings with different lengths is the weighted Levenshtein distance (WLD), which ...
null Jianhua Xu, null Xuegong Zhang
openaire   +1 more source

Parallel Computations of Levenshtein Distances

1997
This chapter discusses parallel solutions for the string editing problem introduced in Chapter 5. The model of computation used is the synchronous, shared - memory machine referred to as PRAM and discussed also earlier in this book. The algorithms of this chapter are based on the CREW and CRCW variants of the PRAM.
A. Apostolico, M.J. Atallah
openaire   +1 more source

Online Handwriting Recognition Using Levenshtein Distance Metric

2013 12th International Conference on Document Analysis and Recognition, 2013
In this article, we propose a novel scheme for online handwritten character recognition based on Levenshtein distance metric. Both shape and position information are considered in our feature representation scheme. The shape information is encoded by a string of quantized values of angular displacements between successive sample points along the ...
S. Dutta Chowdhury, U. Bhattacharya, S.K. Parui   +2 more
openaire   +1 more source

Approximate Periods with Levenshtein Distance

2008
We present a new algorithm deciding for strings tand wwhether wis an approximate generator of twith Levenshtein distance at most k. The algorithm is based on finite state transducers.
Martin Šimůnek, Bořivoj Melichar
openaire   +1 more source

IRIS RECOGNITION USING ADABOOST AND LEVENSHTEIN DISTANCES

International Journal of Pattern Recognition and Artificial Intelligence, 2012
This paper presents an efficient IrisCode classifier, built from phase features which uses AdaBoost for the selection of Gabor wavelets bandwidths. The final iris classifier consists of a weighted contribution of weak classifiers. As weak classifiers we use three-split decision trees that identify a candidate based on the Levenshtein distance between ...
JOAN CLIMENT, ROBERTO A. HEXSEL
openaire   +1 more source

Levenshtein distance metric based holistic handwritten word recognition

Proceedings of the 4th International Workshop on Multilingual OCR, 2013
The rapid spread of pen-based digital devices and touch screen devices coupled with their affordability, and capability to take technology and digitization of data to the grassroots, has made online handwriting recognition an active field of research. The relevance of research on on-line handwriting recognition for Indian scripts is particularly high ...
Souvik Dutta Chowdhury, Ujjwal Bhattacharya, Swapan K. Parui   +2 more
openaire   +1 more source

Modified levenshtein distance for real-time gesture recognition

2013 6th International Congress on Image and Signal Processing (CISP), 2013
In this paper, a real time dynamic gesture recognition method based on a modified Levenshtein distance is proposed. The method addresses the issues faced in dynamic gesture recognition methods that are due to gesture variability within the class due to differences in the gesture speed.
Clementine Nyirarugira, Hyo-Rim Choi, JunYoung Kim, Monson Hayes, TaeYong Kim   +4 more
openaire   +1 more source