This is the same problem people have with closures, where it's unclear to the user whether the argument is captured by name or by value.
For example, when you have
fn f x = (y -> x + y)
then a sequence of invocations of f f 1 3
f 2 6
will yield 4 and 8 respectively, but never will the second invocation yield 7 due to reusing the value of x from the first invocation. However, that is precisely what happens in the article's regex example, because the equivalent is for the closure value (y -> x + y) to be cached between invocations, so that the x retains the value of the first invocation of f — regardless of whether x is a reference by name or by value.