'Positional Anchor' type attacks?

Hello,

I'm a little new to this, so apologies if this feature is in plain sight and I'm missing it. I've been looking in to recovering a bitcoin wallet with btcrecover; I know the approximate positions of each word, with one word missing (likely around 8 characters and all lowercase). With btcrecover, I could use positional anchors (specifying the locations of the words) to crack it. So something like (where the numbers in square brackets indicate the positions):


[2,5]word1
[3,1]word2
[7,4]word5
...
[n] [Random lowercase string]

However, btcrecover is grossly slower than hashcat; while btcrecover can preform around 300,000 attempts per second on a GTX 970, hashcat can run billions per second. I'd imagine a major factor would be the fact that much more sorting must be done every iteration, but I still feel as if hashcat could do this much more efficiently. Does hashcat have a function that can achieve the same result? If so, how much of a speed benefit will I get? Would throwing btcrecover at a powerful EC2 instance be a better idea?

Thanks in advance.