The artcle deals with the approximate pattern searching in ordered labelled trees in application to semantic searching of mathematical expressions. We introduce a new approach to approximate searching in trees which uses set of allowed subtree transformations for target tree. Each allowed transformation is assigned with some weight and the problem is to find the minimal total weight of transformations which allow to match pattern tree with the target.