The inexpressive Description Logics in the family have been successful mainly due to their tractability of standard reasoning tasks like subsumption, adoption in modeling of biomedical ontologies, and standardization as an OWL 2 EL profile. This paper proposes two enhanced subsumption algorithms that not only test whether a particular subsumption holds but also give a numeric indicator showing the structural distance between the two concepts in the subsumption relationship. Structural distance is defined in terms of the effort required to obtain the subsumption in question. Both algorithms extend the standard subsumption algorithm for by an axiom labeling technique, originally proposed for finding justifications.