The new tool allows you to easily construct optimized regexp from a word list.For example, with the list:
optimal optimize optimise optimization optimisationyou will get the following regexp:optim(i[sz](e|ation)|al)As you can see, Visual REGEXP will try to find not only the common prefixes but the common suffixes too.
Back
List Regexp a
ab
ac
bar
bars
barst
barta[bc]?|bar(st?|t)? save-current-buffer-extension
save-current-file-extension
save-excursion
save-restriction
save-window-excursionsave-((current-(file|buffer)-exten|(window-)?excur)s|restrict)ion a
aa
ac
ad
ba
bc
bd
ea
ec
ed[be][acd]|a[acd]? ab
abcd
abdab(c?d)? aa
ac
ad
ba
bc
bd
ea
ec
ed[abe][acd]