Hello monks,

A quick question, if i have a large normal replace list, something like 50,000. and can be shorten to 10,000 with regex.

Which method would be the faster?
#EDIT

sorry for prior unclear briefing, here's an example:

"efg" is a word, and can be precedented by "ab" or "cd" or both, and it is still the same word. and i need to deal with it on word boundaries as it can be a part of another words. so i can use:

1- regex:
s/\b(ab)*(cd)*efg\b/$1$2exg/g;

2- normal replace:

s/\babcdefg\b/abcdexg/g;
s/\babefg\b/abexg/g;
s/\bcdefg\b/cdexg/g;
s/\befg\b/exg/g;
[download]

i know that might seems weird to you, but in my language, it doesn't. so with large list of words like "efg", the question is:

"Which method would be the faster?"