Using exponential generating functions, since there are 3 A's, 2 N's, 1 B, and 1 S, we get
$g_e(x)=\left(1+x+\frac{x^2}{2!}+\frac{x^3}{3!}\right)\left(1+x+\frac{x^2}{2!}\right)(1+x)^2=1+4x+7x^2+\frac{43}{6}x^3+\frac{19}{4}x^4+\cdots$,
so there are $(4!)(\frac{19}{4})=\color{red}{114}$ words of length 4.
Alternatively, we can consider the number of A's used:
1) 3 A's: There are 3 choices for the remaining letter, giving $4\cdot3=12$ cases
2) 2 A's: With 2 N's, there are 6 cases, and with BN, SN, or SB we get $3\cdot12=36$ additional cases
3) 1 A: with 2 N's, we get $2\cdot12=24$ cases, and with NBS we get $4!=24$ additional cases
4) 0 A's: this gives $4\cdot3=12$ cases
Therefore the total is given by $12+42+48+12=\color{red}{114}$ cases.