Yes - Jarkko Hietaniemi's Regex::PreSuf does just that.

my $re = presuf( qw{ a about above across 
                     after afterwards } );
# yields:
a(?:bo(?:ut|ve)|cross|fter(?:wards)?)?
[download]

If we assume you aren't incurring the cost of building the regex each time (possibly you keep a stopwords file and stopreg file and rebuild the latter from the former when the former changes, or simply stat and rebuild from the main program...) then you get a significant savings:

         Rate    reg    pre presuf
reg    33.1/s     --   -34%   -59%
pre1   50.4/s    53%     --   -37%
presuf 80.6/s   144%    60%     --
[download]

pre1 is my simple algorithm from upthread, reg is a straight alternation, and presuf is presuf(). I used the english stoplist from Lingua::EN::StopWords (about 200 words) and a 4000 word text.