You could easily do something like this using open source parser generators, like Pegjs(https://github.com/pegjs/pegjs) and own the final code yourself.
Show HN: Nevod is easier and faster than RegExp
21–30 of 82 posts
Re: Show HN: Nevod is easier and faster than RegExp
#22This is cute! It's basically a nice syntax for full parsing of extended regular expressions. It would make for a very nice tool. Far too often, regular expression tools only implement "matching" (i.e., extract a list of strings). Full parsing gives you the complete parsetree, and thus preserve more structural information, especially under repetitions. I'm very much in support of anything that uses regex parsing inste…
This might be the real value from this thread. Any more resources on this? Is this the same as "Parsing expression grammar"?
No, Parsing expression grammar (PEG) are not regular grammars at all.
For more resources, I think the related work of my paper has the main ones. The "Kleene meets Church" project has lot's of very good publications on the topic: https://di.ku.dk/kmc/publications/
Re: Show HN: Nevod is easier and faster than RegExp
#23This is cute! It's basically a nice syntax for full parsing of extended regular expressions. It would make for a very nice tool. Far too often, regular expression tools only implement "matching" (i.e., extract a list of strings). Full parsing gives you the complete parsetree, and thus preserve more structural information, especially under repetitions. I'm very much in support of anything that uses regex parsing inste…
The Perl 6 grammar engine does full parsing, and gives you the parse tree that matches the structure of the rules.
Well, except Perl doesn't parse regular grammars (it parses much more) and is far from being "one pass" (since the complexity guarantees are not valid anymore) ....
Re: Show HN: Nevod is easier and faster than RegExp
#24> […] works in every language
> Operates on words, not characters.
Yeah, well. How shall I tell you?
Re: Show HN: Nevod is easier and faster than RegExp
#25Like the other sibling comments mentioned, I too was confused about "100x faster than regex" and what the actual product was about.
After digging around their website, I found this blog post which explains it better:
https://blog.nezaboodka.com/post/2019/594-using-nevod-for-te...
So my summary would be:
1) it works "faster" than regex in a specific scenario of treating text as entities in natural language. (E.g. higher conceptual abstractions such as qualifiers, variations, etc). If one were to reconstruct Nevod's rules using pure traditional regex (a very complicated regex), executing that regex would be slower because it's more of a "dumb" character sequence matching engine instead of a higher level natural language parser.
2) it's currently an unreleased "text search engine" that presumably will be licensed for you to integrate into your own software. The text matching engine is currently only used in their proprietary database engine. Whether the engine is a library one statically links in like Sqlite -- or -- it's a separate runtime like ElasticSearch that you make API calls to, I don't know.
I notice the CEO is Yury Chetyrko and the submitter is ychetyrko, so maybe he can explain in more detail what exactly Nevod is.
Re: Show HN: Nevod is easier and faster than RegExp
#26You lost me at "patent pending"
Re: Show HN: Nevod is easier and faster than RegExp
#27Like the other sibling comments mentioned, I too was confused about "100x faster than regex" and what the actual product was about. After digging around their website, I found this blog post which explains it better: https://blog.nezaboodka.com/post/2019/594-using-nevod-for-te... So my summary would be: 1) it works "faster" than regex in a specific scenario of treating text as entities in natural language . (E.g. hig…
That sounds very much like what Rust's RegEx engine does. I understand it extracts longer literals (when available) to find a starting point for where a match might be according to [1].
[1] https://blog.burntsushi.net/ripgrep/#literal-optimizations
Re: Show HN: Nevod is easier and faster than RegExp
#28"Nevod is a language and patent-pending technology for pattern-based text search."
Yawn. I will stay with my patent-free regexps (or whatever other tech I may need) than to rely on something that will let you put a gun to my head if I ever wish to sell my product.
No thanks. Software patents are evil crap.
Re: Show HN: Nevod is easier and faster than RegExp
#29Earlier quoted context omitted.
The Perl 6 grammar engine does full parsing, and gives you the parse tree that matches the structure of the rules.
Well, except Perl doesn't parse regular grammars (it parses much more) and is far from being "one pass" (since the complexity guarantees are not valid anymore) ....
Regular grammars a strict subset of what Perl 6 will parse, no? If you stick to that subset it will parse in a single pass.
Re: Show HN: Nevod is easier and faster than RegExp
#30The syntax reminds me very much of the under-appreciated pyparsing library.