Results 201 to 210 of about 2,255,682 (232)

A Comprehensive Approach to Misspelling Correction with BERT and Levenshtein Distance

arXiv.org
Writing, as an omnipresent form of human communication, permeates nearly every aspect of contemporary life. Consequently, inaccuracies or errors in written communication can lead to profound consequences, ranging from financial losses to potentially life-
Amirreza Naziri, Hossein Zeinali
semanticscholar   +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

OCR and Levenshtein distance as a measure of image quality accuracy for identification documents

2022 International Conference on Electrical, Computer and Energy Technologies (ICECET), 2022
Optical Character Recognition (OCR) is a technology used to distinguish printed or handwritten text characters inside digital images. The areas that it is applied differ from text editors where the scanned images are converted to text, to text ...
Kreshnik Vukatana
semanticscholar   +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

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