Panferov

This work presents generalized search tree application for approximate string search. The task is to find all the strings from data domain which have distance to given string less than given threshold. Levenshtein metric is used in the capacity of string distance measure. Some subclass of regular expressions is used in the capacity of tree keys. The analysis of test results was performed and fields of further research is presented.