chap09alg.ppt for string matching algorithm

Algorithm 9.1.1 Simple Text Search
This algorithm searches for an occurrence of a pattern p in a text t. It
returns the smallest index i such that t[i..i +m- 1] = p, or -1 if no such
index exists.
Input Parameters: p, t
Output Parameters: None
simple_text_search(p, t) {
m = p.length
n = t.length
i = 0
while (i + m = n) {
j = 0
while (t[i + j] == p[j]) {
j = j + 1
if (j = m)
return i
}
i = i + 1
}
return -1
}

Algorithm 9.2.5 Rabin-Karp Search
rabin_karp_search(p, t) {
m = p.length
n = t.length
q = prime number larger than m
r = 2m-1 mod q
// computation of initial remainders
f[0] = 0
pfinger = 0
for j = 0 to m-1 {
f[0] = 2 * f[0] + t[j] mod q
pfinger = 2 * pfinger + p[j] mod q
}
...
index exists.

Algorithm 9.2.5 continued
...
i = 0
while (i + m ≤ n) {
if (f[i] == pfinger)
if (t[i..i + m-1] == p) // this comparison takes
//time O(m)
return i
f[i + 1] = 2 * (f[i]- r * t[i]) + t[i + m] mod q
i = i + 1
}
return -1
}

Algorithm 9.2.8 Monte Carlo Rabin-Karp
Search
This algorithm searches for occurrences of a pattern p in a text t. It
prints out a list of indexes such that with high probability t[i..i +m− 1]
= p for every index i on the list.

mc_rabin_karp_search(p, t) {
m = p.length
n = t.length
q = randomly chosen prime number less than mn2
r = 2m−1 mod q
// computation of initial remainders
f[0] = 0
pfinger = 0
for j = 0 to m-1 {
f[0] = 2 * f[0] + t[j] mod q
pfinger = 2 * pfinger + p[j] mod q
}
i = 0
if (f[i] == pfinger)
prinln(“Match at position” + i)
f[i + 1] = 2 * (f[i]- r * t[i]) + t[i + m] mod q
i = i + 1
}
}

Algorithm 9.3.5 Knuth-Morris-Pratt Search
index exists.

knuth_morris_pratt_search(p, t) {
m = p.length
n = t.length
knuth_morris_pratt_shift(p, shift)
// compute array shift of shifts
i = 0
j = 0
while (t[i + j] == p[j]) {
j = j + 1
if (j ≥ m)
return i
}
i = i + shift[j − 1]
j = max(j − shift[j − 1], 0)
}
return −1
}

Algorithm 9.3.8 Knuth-Morris-Pratt Shift
Table
This algorithm computes the shift table for a pattern p to be used in the
Knuth-Morris-Pratt search algorithm. The value of shift[k] is the
smallest s > 0 such that p[0..k -s] = p[s..k].

Input Parameter: p
Output Parameter: shift
knuth_morris_pratt_shift(p, shift) {
m = p.length
shift[-1] = 1 // if p[0] ≠ t[i] we shift by one position
shift[0] = 1 // p[0..- 1] and p[1..0] are both
// the empty string
i = 1
j = 0
while (i + j < m)
if (p[i + j] == p[j]) {
shift[i + j] = i
j = j + 1;
}
else {
if (j == 0)
shift[i] = i + 1
i = i + shift[j - 1]
j = max(j - shift[j - 1], 0 )
}
}

Algorithm 9.4.1 Boyer-Moore Simple Text
Search
index exists.
boyer_moore_simple_text_search(p, t) {
m = p.length
n = t.length
i = 0
while (i + m = n) {
j = m - 1 // begin at the right end
while (t[i + j] == p[j]) {
j = j - 1
if (j < 0)
return i
}
i = i + 1
}
return -1
}

Algorithm 9.4.10 Boyer-Moore-Horspool
Search
This algorithm searches for an occurrence of a pattern p in a text t over
alphabet Σ. It returns the smallest index i such that t[i..i +m- 1] = p, or
-1 if no such index exists.

boyer_moore_horspool_search(p, t) {
m = p.length
n = t.length
// compute the shift table
for k = 0 to |Σ| - 1
shift[k] = m
for k = 0 to m - 2
shift[p[k]] = m - 1 - k
// search
i = 0
while (i + m = n) {
j = m - 1
while (t[i + j] == p[j]) {
j = j - 1
if (j < 0)
return i
}
i = i + shift[t[i + m - 1]] //shift by last letter
}
return -1
}

Algorithm 9.5.7 Edit-Distance
Input Parameters: s, t
edit_distance(s, t) {
m = s.length
n = t.length
for i = -1 to m - 1
dist[i, -1] = i + 1 // initialization of column -1
for j = 0 to n - 1
dist[-1, j] = j + 1 // initialization of row -1
for i = 0 to m - 1
for j = 0 to n - 1
if (s[i] == t[j])
dist[i, j] = min(dist[i - 1, j - 1],
dist[i - 1, j] + 1, dist[i, j - 1] + 1)
else
dist[i, j] = 1 + min(dist[i - 1, j - 1],
dist[i - 1, j], dist[i, j - 1])
return dist[m - 1, n - 1]
}
The algorithm returns the edit distance between two words s and t.

Algorithm 9.5.10 Best Approximate Match
best_approximate_match(p, t) {
m = p.length
n = t.length
for i = -1 to m - 1
adist[i, -1] = i + 1 // initialization of column -1
for j = 0 to n - 1
adist[-1, j] = 0 // initialization of row -1
for i = 0 to m - 1
for j = 0 to n - 1
if (s[i] == t[j])
adist[i, j] = min(adist[i - 1, j - 1],
adist [i - 1, j] + 1, adist[i, j - 1] + 1)
else
adist [i, j] = 1 + min(adist[i - 1, j - 1],
adist [i - 1, j], adist[i, j - 1])
return adist [m - 1, n - 1]
}
The algorithm returns the smallest edit distance between a pattern p
and a subword of a text t.

Algorithm 9.5.15 Don’t-Care-Search
This algorithm searches for an occurrence of a pattern p with don’t-care
symbols in a text t over alphabet Σ. It returns the smallest index i such that
t[i + j] = p[j] or p[j] = “?” for all j with 0 = j < |p|, or -1 if no such index
exists.

don t_care_search(p, t) {
m = p.length
k = 0
start = 0
for i = 0 to m
c[i] = 0
// compute the subpatterns of p, and store them in sub
for i = 0 to m
if (p[i] ==“?”) {
if (start != i) {
// found the end of a don’t-care free subpattern
sub[k].pattern = p[start..i - 1]
sub[k].start = start
k = k + 1
}
start = i + 1
}
...

...
if (start != i) {
// end of the last don’t-care free subpattern
sub[k].pattern = p[start..i - 1]
sub[k].start = start
k = k + 1
}
P = {sub[0].pattern, . . . , sub[k - 1].pattern}
aho_corasick(P, t)
for each match of sub[j].pattern in t at position i {
c[i - sub[j].start] = c[i - sub[j].start] + 1
if (c[i - sub[j].start] == k)
return i - sub[j].start
}
return - 1
}

Algorithm 9.6.5 Epsilon
Input Parameter: t
epsilon(t) {
if (t.value == “·”)
t.eps = epsilon(t.left) && epsilon(t.right)
else if (t.value == “|”)
t.eps = epsilon(t.left) || epsilon(t.right)
else if (t.value == “*”) {
t.eps = true
epsilon(t.left) // assume only child is a left child
}
else
// leaf with letter in Σ
t.eps = false
}
This algorithm takes as input a pattern tree t. Each node contains a field
value that is either ·, |, * or a letter from Σ. For each node, the algorithm
computes a field eps that is true if and only if the pattern corresponding to
the subtree rooted in that node matches the empty word.

Algorithm 9.6.7 Initialize Candidates
This algorithm takes as input a pattern tree t. Each node contains a field
value that is either ·, |, * or a letter from Σ and a Boolean field eps. Each
leaf also contains a Boolean field cand (initially false) that is set to true if
the leaf belongs to the initial set of candidates.

Input Parameter: t
start(t) {
if (t.value == “·”) {
start(t.left)
if (t.left.eps)
start(t.right)
}
else if (t.value == “|”) {
start(t.left)
start(t.right)
}
else if (t.value == “*”)
start(t.left)
else
t.cand = true
}

Algorithm 9.6.10 Match Letter
This algorithm takes as input a pattern tree t and a letter a. It computes for
each node of the tree a Boolean field matched that is true if the letter a
successfully concludes a matching of the pattern corresponding to that
node. Furthermore, the cand fields in the leaves are reset to false.

Input Parameters: t, a
match_letter(t, a) {
if (t.value == “·”) {
match_letter(t.left, a)
t.matched = match_letter(t.right, a)
}
else if (t.value == “|”)
t.matched = match_letter(t.left, a)
|| match_letter(t.right, a)
else if (t.value == “*” )
t.matched = match_letter(t.left, a)
else {
t.matched = t.cand && (a == t.value)
t.cand = false
}
return t.matched
}

Algorithm 9.6.10 New Candidates
This algorithm takes as input a pattern tree t that is the result of a run of
match_letter, and a Boolean value mark. It computes the new set of
candidates by setting the Boolean field cand of the leaves.

Input Parameters: t, mark
next(t, mark) {
if (t.value == “·”) {
next(t.left, mark)
if (t.left.matched)
next(t.right, true) // candidates following a match
else if (t.left.eps) && mark)
next(t.right, true)
else
next(t.right, false)
else if (t.value == “|”) {
next(t.left, mark)
next(t.right, mark)
}
else if (t.value == “*”)
if (t.matched)
next(t.left, true) // candidates following a match
else
next(t.left, mark)
else
t.cand = mark
}

Algorithm 9.6.15 Match
Input Parameter: w, t
match(w, t) {
n = w.length
epsilon(t)
start(t)
i = 0
while (i < n) {
match_letter(t, w[i])
if (t.matched)
return true
next(t, false)
i = i + 1
}
return false
}
This algorithm takes as input a word w and a pattern tree t and returns true
if a prefix of w matches the pattern described by t.

Algorithm 9.6.16 Find
Input Parameter: s, t
find(s,t) {
n = s.length
epsilon(t)
start(t)
i = 0
while (i < n) {
match_letter(t, s[i])
if (t.matched)
return true
next(t, true)
i = i + 1
}
return false
}
This algorithm takes as input a text s and a pattern tree t and returns true if
there is a match for the pattern described by t in s.

chap09alg.ppt for string matching algorithm

Recommended

More Related Content

Similar to chap09alg.ppt for string matching algorithm (20)

More from SadiaSharmin40 (8)

Recently uploaded (19)

chap09alg.ppt for string matching algorithm