摘要: Abstract * Fundamentally, generalization can be seen as a technique for performing compression of information; the result this process provides basis to learn new knowledge. However, in all domains, use an elementary requires implementation both fast and efficient algorithms. In paper, we present mechanism, inspired by structural matching algorithm. The principle our method consists using domain theory order perform saturation examples given expert. We will see that “rough” approach some advantages quality construction rapidity.