In the Chomsky Hierarchy type$-3$ languages are regular, type$-2$ languages are context$-$sensitive$,$ type$-1$ languages are context$-$free, while type$-0$ languages are recursively enumerated.

In order to accept this statement as true $,$ do we take the consideration that type$-3$ regular, type$-2$ context$-$free, type$-1$ context$-$sensitive and type$-0$ recursively enumerated $?$