Results 171 to 180 of about 1,611,733 (200)
Some of the next articles are maybe not open access.
Computing the Levenshtein distance of a regular language
IEEE Information Theory Workshop, 2005., 2005The 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 +2 more sources
Parallel Computations of Levenshtein Distances
1997This 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
Localizing Unordered Panoramic Images Using the Levenshtein Distance
2007 IEEE 11th International Conference on Computer Vision, 2007This 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 +2 more
openaire +2 more sources
Automatic keyword extraction with relational clustering and Levenshtein distances
Ninth IEEE International Conference on Fuzzy Systems. FUZZ- IEEE 2000 (Cat. No.00CH37063), 2002Alternating cluster estimation (ACE) is a generalized clustering model. Relational ACE is a modification of ACE that can be used to cluster data which do not possess a clear numerical representation, but for which a meaningful relation matrix can be defined.
Thomas A. Runkler, James C. Bezdek
openaire +1 more source
Online Handwriting Recognition Using Levenshtein Distance Metric
2013 12th International Conference on Document Analysis and Recognition, 2013In 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 +2 more
openaire +1 more source
Privacy preserving string comparisons based on Levenshtein distance
2010 IEEE International Workshop on Information Forensics and Security, 2010Alice and Bob possess strings x and y of length m and n respectively and want to compute the Levenshtein distance L(x, y) between the strings under privacy and communication constraints. The Levenshtein distance, or edit distance, has a dynamic programming formulation that solves a series of minimum-finding problems.
Shantanu Rane, Wei Sun 0008
openaire +2 more sources
Parallelization of the Levenshtein distance algorithm
Technical Transactions. Fundamental Sciences = Czasopismo Techniczne. Nauki Podstawowe, 2014This paper presents a method for the parallelization of the Levenshtein distance algorithm deployed on very large strings. The proposed approach was accomplished using .NET Framework 4.0 technology with a specific implementation of threads using the System. Threading.Task namespace library.
Artur Niewiarowski, Marek Stanuszek
openaire +1 more source
Automated Test Scenario Selection Based on Levenshtein Distance
2010Specification 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 +2 more sources
Evaluation of Assamese Speech Data Transcriptions by Levenshtein Distance
2023 26th Conference of the Oriental COCOSDA International Committee for the Co-ordination and Standardisation of Speech Databases and Assessment Techniques (O-COCOSDA), 2023Rajesha N. +2 more
openaire +2 more sources
Levenshtein distance for graph spectral features
Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004., 2004Richard C. Wilson 0001, Edwin R. Hancock
openaire +2 more sources