Considering that the unranked tree languages L(G) and L(G') are those defined by given possibly-recursive XML types G and G',
this paper proposes a method to verify whether L(G) is “approximatively” included in L(G').
The approximation consists in weakening the father-children relationships.
Experimental results are discussed, showing the efficiency of our method in many situations.