Show HN: Nevod is easier and faster than RegExp
First of all, thanks everyone for the valuable feedback, critics, suggestions, etc. Truly appreciate that!<p>And thanks for patience to all people who are playing with the Nevod right now and getting errors. We have an unexpectedly high interest and number of visitors is very high in our playground. Meanwhile, it&#x27;s a preview of the technology, please keep in mind.<p>Let me clarify few things. The speed of Nevod is based on two things:<p>1. Nevod operates on words, not individual characters. From my 30 years of coding experience I would say that roughly 95% of text processing&#x2F;rules are word-based. So it covers most of tasks.<p>2. Nevod matches MULTIPLE patterns against document in ONE PASS. Patters&#x2F;expressions are indexed by state machine and filtered effectively during matching.<p>So, at a RULE DECK of 1000 patterns, we got 300 times improvement comparing to RegExp. This is a kind of tasks when you let say need to highlight syntax, to massively verify and route incoming requests in cloud, perform massive text validations, track certain phrases and relations in massive human communication, etc.<p>With growing number of patterns the difference between Nevod and RegExp is higher and higher and go far beyond 300 times. So, I&#x27;m a kind of disagree with moderators removed the word &quot;hundreds&quot; from the headline. :)<p>We will publish benchmark results and we will also release &quot;negrep&quot; (Nevod GREP) command line tool for Windows, Linux, Mac, so everyone will be able to run &quot;negrep&quot;, play with it and verify benchmark him&#x2F;herself. Generally, Nevod technology will be available both in form of a library, in form of command line tool, and in form of service.