Weighted voting games are simple games that can be represented by a collection of integer weights for each player so that a coalition wins if the sum of the player weights matches or exceeds a given quota. It is known that a simple game can be expressed as the intersection or the union of weighted voting games. The dimension (codimension) of a simple game is the minimum number of weighted voting games such that their intersection (union) is the given game. In this work, we analyze some subclasses of weighted voting games and their closure under intersection or union. We introduce generalized notions of dimension and codimension regarding some subclasses of weighted voting games. In particular, we show that not all simple games can be expressed as intersection (union) of pure weighted voting games (those in which dummy players are not allowed) and we provide a characterization of such simple games. Finally, we experimentally study the generalized dimension (codimension) for some subclasses defined by establishing restrictions on the representations of weighted voting games.