regex101 has a few more distinguishing features:

- more flavor support,

- a regex debugger,

- code generator, with support for a lot of languages,

- a complete quick reference with examples,

- an extensive regex library,

- a regex quiz for "golfing" and learning purposes,

Perhaps, most importantly, it runs entirely client side and does not submit any information to the server unless you hit save (which returns a delete link to remove all data). You can even run the website and (most) of its features offline.

Regexr submits all input to the server for processing.

But, I'm biased, since I wrote regex101 :)

Typically not. Sometimes they are tagged as nominal mentions.

Don't agree. LSTM is a very good option for NER. I have personally experimented with simple FFNN and language models to accommodate variable width input and achieved very good results. I will be publishing a paper on this soon.

The system in the article fails at quite simple sentences, such as:

"Rex Tillerson is the secretary of state."

It tags "Rex Tillerson" as ORG instead of PER. If you change "is" to "was" it tags it as PER.

Disclaimer: as you may notice, the tagger is far from being perfect. Some errors are due to the fact that the demo uses a reduced vocabulary (lighter for the API). But not all. It is also very sensible to capital letters, which comes both from the architecture of the model and the training data. For more information about the demo, see here.

The unit testing feature is located in the menu on the left, under the submenu "TOOLS" (the checkbox icon).

I posted this last night but was told it was incorrect format so I'm giving it another try. Hope this is alright! Please enjoy the site and any feedback is appreciated.

Hello

I'm the creator. PCRE offers a neat feature to limit backtracking, Python does not. I still havent found a decent solution to this issue.

Javascript is run in your own browser so you'll only be screwing yourself there :p

I think this shows quite clearly what is going on and why I get the result I get: http://regex101.com/r/kU3cJ6/#debugger (imgur link: http://imgur.com/H2IkNGy)

If you don't agree with me, could you perhaps suggest an improvement?

I mean it does its job and it is good. I would use it. But look at this case; test string inout [123:0] Asdfg

Exp (made it wrong in purpose) ^inout\s+\[[0-9]\: It just display "No Matches".

It would be cool if it kind of guide what exp you want to use to match test string. What you put in Test string is what you want to get.

I have thought about this, but in cases where it would be useful, it's impossible to generate a sample match string. For example, creating a match string for /(?:a|[bc])efg?/ is super simple, but for something like: /(ab(?1)*)/ it becomes much harder. Not to mention the performance hit you would see for these more complex expressions. (These are just dummy expressions for illustrative purposes, but I'm sure you get my gist.)

If there is a modifier with a variable number like ?,+,* you could just repeat it X times.

For example if it is ? repeat 1 time, + repeat 2, * repeat 3 etc...

If it is |, choose the first or choose randomly.

Forgot to tell you how to use it. Simply insert an expression and some text and press the little red button right above the input for the regex. That's all you have to do! Enjoy :)

You could always comment the regex. My website provides a full and accurate explanation, step by step, of almost any given regex. Have a look here: http://regex101.com/r/dG4lP3