In Ordinal Analysis, Proof-theoretic Ordinal of a theory is thought as measure of a consistency strength and computational power. 

Is it always the case? I. e. are there some general results about formal theories which say that if we know the ordinal measure of a formal theory than we would know its consistency strength and computational power to some extent?