Sciweavers

115 search results - page 5 / 23
» Learning String Edit Distance
Sort
View
STRINGOLOGY
2004
13 years 8 months ago
A Note on Bit-Parallel Alignment Computation
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
Heikki Hyyrö
CAIP
2009
Springer
246views Image Analysis» more  CAIP 2009»
14 years 13 hour ago
A Novel Approach for Word Spotting Using Merge-Split Edit Distance
Edit distance matching has been used in literature for word spotting with characters taken as primitives. The recognition rate however, is limited by the segmentation inconsistenci...
Khurram Khurshid, Claudie Faure, Nicole Vincent
WIA
2000
Springer
13 years 11 months ago
Fast Implementations of Automata Computations
Abstract. In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a paralle...
Anne Bergeron, Sylvie Hamel
FOCS
2004
IEEE
13 years 11 months ago
Approximating Edit Distance Efficiently
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 8 months ago
Approximate String Matching: A Simpler Faster Algorithm
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
Richard Cole, Ramesh Hariharan