Mask assumptions

I need some help with a longer password hash. I could only assume a few thing but don't know anything specific. It's a NTLM hash from a Mac OSX 10.6 samba login and may have 10 to 16 key strokes. It's definitely a complex password, so dictionaries won't help me. Is there any chance to mask the attack to reduce the processing time by assumptions like:
I guess no key is pressed more than two times. And in addition: I guess only up to three upper score characters are used and a maximum of four numbers and two special characters. 

I hope there is a chance to limit it in that way or is there any other way to improve my attack?

hmm, maybne this could help u

maybe some one else could tell u more about the same key being pressed twice or less