Chef and Mutable Strings

Chef has two strings $s$ and $t$ consisting of only of lowercase English characters. He wants to make them equal. $s$ can be made equal to $t$ by changing any vowel in $s$ to any other vowel and any consonant in $s$ to any other consonant. Multiple changes can be made. Can he succeed? Note: In this problem, we consider the letters $a$, $e$, $i$, $o$ and $u$ to be vowels and all the other letter