Consider using a predictable regex library

[mdoering]

There are problematic cases when the name parser takes very, very long to run some regular expressions. It is a well known problem with backreferences in particular and the use of NFA. E.g. see also https://bugs.openjdk.org/browse/JDK-8260688

There are alternative regex implementations using DFA, but all have less features that are currently used by the name parser. But maybe these can be replaced and we can use a deterministic engine and do aways with parsing timeouts?

Alternatives:

• https://github.com/google/re2j port of https://github.com/google/re2/wiki/WhyRE2
• https://github.com/openresty/sregex

Related issues:

• https://github.com/gbif/name-parser/issues/12
• https://github.com/gbif/name-parser/issues/15
• https://github.com/globalbioticinteractions/nomer/issues/89