Combining Information from Multiple Internet Sources

Input: Two lists with URLs
Output: Levenshtein distance between lists
int LevenshteinDistance(List list1, List list2)
declare int d[list1.size() + 1, list2.size() + 1]
for i from 0 to m
d[i, 0] := i
for j from 0 to n
d[0, j] := j
for i from 1 to m
for j from 1 to n
if list1[i-1] = list2[j-1] then
cost := 0
else cost := 1
d[i, j] := minimum(
d[i-1, j] + 1, // deletion
d[i, j-1] + 1, // insertion
d[i-1, j-1] + cost // substitution
)
return d[list1.size(),list2.size()]
Listing 3.4.4 Pseudo code of variation of algorithm for Levenshtein distance
Next chapter presents conducted tests of the three methods. Each of the methods was
compared to search engines and then methods were compared between themselves. Next chapter
presents those results and contains comments on those.
41