Let A be an n×n real matrix. As shown in the recent paper S.M. Fallat, H.T. Hall, J.C.-H. Lin, and B.L. Shader (2022) [5], if the manifolds MA={G−1AG:G∈GL(n,R)} and Q(sgn(A)) (consisting of all real matrices having the same sign pattern as A), both considered as embedded submanifolds of Rn×n, intersect transversally at A, then every superpattern of sgn(A) also allows a matrix similar to A. Those authors introduced a condition on A (in terms of certain linear matrix equations) equivalent to the above transversality, called the nonsymmetric strong spectral property (nSSP). In this paper, this transversality property of A is characterized using an alternative, more direct and convenient condition, called the similarity-transversality property (STP). Let X=[xij] be a generic matrix of order n whose entries are independent variables. The STP of A is defined as the full row rank property of the Jacobian matrix of the entries of AX−XA at the zero entry positions of A with respect to the nondiagonal entries of X. This new approach makes it possible to take better advantage of the combinatorial structure of the matrix A, and provides theoretical foundation for constructing matrices similar to a given matrix while the entries have certain desired signs. In particular, several important classes of zero-nonzero patterns and sign patterns that require or allow this transversality property are identified. Examples illustrating many possible applications (such as diagonalizability, number of distinct eigenvalues, nilpotence, idempotence, semi-stability, eigenvalues and their algebraic and geometric multiplicities, Jordan canonical form, minimal polynomial, and rank) are provided.