scispace - formally typeset
Journal ArticleDOI

Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching

Heikki Hyyrö
- 01 Nov 2008 - 
- Vol. 108, Iss: 5, pp 313-319
TLDR
This paper proposes a new variant of the bit-parallel NFA of Baeza-Yates and Navarro (BPD) for approximate string matching that is more efficient than the original BPD, and takes over/extends the role of theOriginal BPD as one of the most practical approximate string Matching algorithms under moderate values of k and m.
About: 
This article is published in Information Processing Letters.The article was published on 2008-11-01. It has received 9 citations till now. The article focuses on the topics: Approximate string matching & Pattern matching.

read more

Citations
More filters
Journal Article

Bit-parallel approximate string matching algorithms with transposition

Heikki Hyyrö
- 01 Jan 2003 - 
TL;DR: In this article, a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation, transposing two adjacent characters in the pattern, is discussed, which is also known as the Damerau edit distance.
Proceedings ArticleDOI

Hierarchical Parallelism of Bit-Parallel Algorithm for Approximate String Matching on GPUs

Cheng-Hung Lin, +2 more
TL;DR: This paper proposes a hierarchical parallelism approach to accelerate the bit-parallel algorithm on NVIDIA GPUs and proposes to use hashing to reduce the memory usage and achieve 98.4% of memory reduction.
Journal ArticleDOI

BEVA: An Efficient Query Processing Algorithm for Error-Tolerant Autocompletion

Xiaoling Zhou, +5 more
TL;DR: This article systematically study the query processing problem for error-tolerant autocompletion with a given edit distance threshold, and proposes a general framework that encompasses existing methods and characterizes different classes of algorithms and the minimum amount of information they need to maintain under different constraints.
BookDOI

Implementation and Application of Automata : 20th International Conference, CIAA 2015, Umeå, Sweden, August 18-21, 2015, Proceedings

Frank Drewes
TL;DR: Implementation and application of automata : 20th international conference, CIAA 2015, Umea, Sweden, August 18-21, 2015, Proceedings
Book ChapterDOI

Obtaining Precision-Recall Trade-Offs in Fuzzy Searches of Large Email Corpora

Kyle Porter, +1 more
TL;DR: This chapter describes the design and implementation of cedas, a novel constrained edit distance approximate string matching algorithm that provides complete control over the types and numbers of elementary edit operations considered in approximate matches.
References
More filters
Journal Article

Binary codes capable of correcting deletions, insertions and reversals

V.I. Levenshtein
- 01 Jan 1965 - 
Journal Article

Binary codes capable of correcting deletions, insertions, and reversals

V.I. Levenshtein
- 01 Jan 1966 - 
Journal ArticleDOI

A guided tour to approximate string matching

Gonzalo Navarro
- 01 Mar 2001 - 
TL;DR: This work surveys the current techniques to cope with the problem of string matching that allows errors, and focuses on online searching and mostly on edit distance, explaining the problem and its relevance, its statistical behavior, its history and current developments, and the central ideas of the algorithms.
Journal ArticleDOI

A technique for computer detection and correction of spelling errors

Fred J. Damerau
- 01 Mar 1964 - 
TL;DR: The method described assumes that a word which cannot be found in a dictionary has at most one error, which might be a wrong, missing or extra letter or a single transposition.
Journal ArticleDOI

Fast text searching: allowing errors

Sun Wu, +1 more
- 01 Oct 1992 - 
TL;DR: T h e string-matching problem is a very c o m m o n problem; there are many extensions to t h i s problem; for example, it may be looking for a set of patterns, a pattern w i t h "wi ld cards," or a regular expression.