The Prague Stringology Club Workshop '96

Pavel Mužátko

Approximate Regular Expression Matching

We extend the definition of Hamming and Levenshtein distance between two strings used in approximate string matching so that these two distance scan be used also in approximate regular expression matching. Next, the methods of construction of nondeterministic finite automata for approximate regular expression matching considering both mentioned distances are presented.

Download paper: Article in PostScript Article in PDF
 PostScript   PDF