In the paper we define and study a generalization of the Weisfeiler-Lehman algo which constructs the cellular closure of a set of matrices. The new technique The underlying construction gives a new sufficient condition for a cellular algebra to be Schurian.