On obtaining the Boyer–Moore string-matching algorithm by partial evaluation

Danvy, Olivier; Rohde, Henning Korsholm

doi:10.1016/j.ipl.2006.04.001

Cited by 21 publications

(13 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Morris-Pratt algorithm has better worst-case running time than the Boyer-Moore algorithm in spite of that the latter is known to be extremely efficient in practice [1,14]. As mentioned in [10,11], the extensive pattern-matching literature has had two main categories: decreases the number of character comparisons required and reducing the time requirement in the worst and average cases. In [12], Horspool presented SFC (Scan for First Character) and SLFC (Scan for Lowest Frequency Character) approach in which searching is based on the occurrences of the first character of the pattern in the text.…”

Section: Literature Reviewmentioning

confidence: 99%

New and Efficient Recursive-based String Matching Algorithm (RSMA-FLFC)

Odeh¹

2014

IJCA

View full text Add to dashboard Cite

The need for simple and efficient string matching algorithms is essential for many applications, and especially for database query. In this paper, two major algorithms are proposed, namely first least frequency character algorithm (FLFC) and recursive-based string matching algorithm (RSMA). FLFC is considered as an enhanced version of scan for lowest frequency character SLFC proposed by Horspool [12]. FLFC algorithm extracts first least frequency character in the pattern and identifies the occurrences of such character in the whole text in a preprocessing phase, while the recursive algorithm (RSMA) recursively partitioning the pattern and the targeted substring in the text and compares them at midpoint (q) each time. The FLFC search accelerates the searching process, while RSMA enhances the speed of performance of the matching phase. The extensive testing and comparisons with Naïve (Brute force), Boyer-Moore (BM), and the FLFC without deploying recursive matching show that the proposed algorithms enhance the speed of performance dramatically.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

New and Efficient Recursive-based String Matching Algorithm (RSMA-FLFC)

Odeh¹

2014

IJCA

View full text Add to dashboard Cite

show abstract

“…In the realm of string matching, Danvy and the author have discovered that the key bad-character-shift heuristic of the efficient Boyer-Moore algorithm [10,31] can be seen as an instance of bounded static variation [17].…”

Section: Selective Bounded Static Variationmentioning

confidence: 99%

Formal Aspects of Polyvariant Specialization

Rohde¹

2005

BRICS

Self Cite

View full text Add to dashboard Cite

show abstract

“…Our approach is to unify ideas from the KMP-test [41], string matching frameworks [6,7,36], and recent analyses [1,2,15,24]. In this overview, we will gloss over some of the technical contributions.…”

Section: Overview Of This Workmentioning

confidence: 99%

“…We notice that picking out the sequence of text indices of the comparisons, which we will call the trace, gives us a concise way of measuring string matchers (and scales to bounded static variation [15]). The set of traces is called the behavior of a matcher.…”

Section: A Measure For Information Propagationmentioning

confidence: 99%

“…This kind of comparison will always produce positive information ('is x') about a text character, where 'x' is taken from the alphabet. Although bounded static variation could be implemented simply by a large case-statement over the alphabet, a key observation is that the constant-time character-key tables -such as the table for the bad-character-shift heuristic -play the exact same role in real algorithms [15]. For this reason we call it a table comparison.…”

Section: The Basic Partial Matchermentioning

confidence: 99%

See 1 more Smart Citation

Measuring the Propagation of Information in Partial Evaluation

Rohde¹

2005

BRICS

Self Cite

View full text Add to dashboard Cite

We present the first measurement-based analysis of the information propagated by a partial evaluator. Our analysis is based on measuring implementations of string-matching algorithms, based on the observation that the sequence of character comparisons accurately reflects maintained information. Notably, we can easily prove matchers to be different and we show that they display more variety and finesse than previously believed. As a consequence, we are able to pinpoint differences and inaccuracies in many results previously considered equivalent.Our analysis includes a framework that lets us obtain string matchersnotably the family of Boyer-Moore algorithms -in a systematic formalismindependent way from a few information-propagation primitives. By leveraging the existing research in string matching, we show that the landscape of information propagation is non-trivial in the sense that small changes in information propagation may dramatically change the properties of the resulting string matchers. We thus expect that this work will prove useful as a test and feedback mechanism for information propagation in the development of advanced program transformations, such as GPC or Supercompilation.

show abstract

On obtaining the Boyer–Moore string-matching algorithm by partial evaluation

Cited by 21 publications

References 10 publications

New and Efficient Recursive-based String Matching Algorithm (RSMA-FLFC)

New and Efficient Recursive-based String Matching Algorithm (RSMA-FLFC)

Formal Aspects of Polyvariant Specialization

Measuring the Propagation of Information in Partial Evaluation

Contact Info

Product

Resources

About