A solution is to add captures for the preceding and following text: str.replace(/(.*name="\w+)(\d+)(\w+".*)/, "$1!NEW_ID!$3")

nstead of using the /regex\d/g syntax, you can construct a new RegExp object: var replace = "regex\\d"; var re = new RegExp(replace,"g");

Pattern for Local Unique Identifiers Local identifiers in arXiv should match this regular expression:^(\w+(\-\w+)?(\.\w+)?)?\d{4,7}(\.\d+(v\d+)?)?$

Pattern for Local Unique Identifiers Local identifiers in arXiv should match this regular expression:^(\w+(\-\w+)?(\.\w+)?)?\d{4,7}(\.\d+(v\d+)?)?$ Example Local Unique Identifier 0807.4956v1   Resolve Pattern for CURIES Compact URIs (CURIEs) constructed from arXiv should match this regular expression:^arxiv:(\w+(\-\w+)?(\.\w+)?)?\d{4,7}(\.\d+(v\d+)?)?$ Example CURIE arxiv:0807.4956v1

regex_arxiv.py author: Matt Bierbaum date: 2019-03-14 RegEx patterns for finding arXiv id citations in fulltext articles.

A combinaison of split(), subString(), removePrefix(), removeSuffix() is usually enough.

/^10.\d{4,9}/[-._;()/:A-Z0-9]+$/i

It will then backtrack from the end until it reaches the first space.

The faster you can throw out non-matching input, the fewer cycles you waste

Character classes Possessive quantifiers (and atomic groups) Lazy quantifiers Anchors and boundaries Optimizing regex order

A person with a bit more insight into RegExp features might come up with the following optimization:

match can be easily implemented in any modern JavaScript interpreter that supports sticky RegExp flag introduced in ES6: