Show HN: Nevod is easier and faster than RegExp
nevod.nezaboodka.com
Show HN: Nevod is easier and faster than RegExp
1–10 of 82 posts
Re: Show HN: Nevod is easier and faster than RegExp
#2Any details and/or reproducible benchmarks backing up the "100s of times faster" claim?
Re: Show HN: Nevod is easier and faster than RegExp
#3> Nevod is a language and technology that provide pattern-based text search. Nevod is specially aimed to rapidly reveal entities and their relationships in texts written in the natural language. This patent pending technology is unique on the market.
What is this? A website, a tool? Can I run it locally? Is it free software, open source, close source? Where is the information about the patent?
Also, you mention it's easier (why?) and hundred time faster, but I don't see anywhere a comparison with traditional regular expressions.
Re: Show HN: Nevod is easier and faster than RegExp
#4I’m just glancing at the reference (https://nevod.nezaboodka.com/#reference) and this looks like a superset of regular expressions? I’m curious as to how you’re getting the speedup you claim on this.
Re: Show HN: Nevod is easier and faster than RegExp
#5Now you've got 3 problems!
Re: Show HN: Nevod is easier and faster than RegExp
#6This 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 instead of matching. Matching is nearly always the wrong tool and cause more bugs than anything. The only reason it's used is that the engines are easier to implement. I wrote a small paper on how to retrofit parsing on top of an engine that only gives you matching recently (https://gabriel.radanne.net/papers/tyre/tyre_paper.pdf).
Given the amount of prior art in the academic community, patenting this is probably worthless, but eh ...
Re: Show HN: Nevod is easier and faster than RegExp
#7> Pattern definition language is simple and clear, thus very easy to learn
Once you get into more complicated expressions, I don't see this as much easier or simpler than regexes. For example, this expression from the tutorial looks as much like gibberish to me as an equivalent regex:
Domain = Word + [1+] ("." + Word + [0+] {Word, "_", "-"});
Re: Show HN: Nevod is easier and faster than RegExp
#8Found the Github repo https://github.com/Nezaboodka but I can't seem to find the code :/
Stepping thru code in Inspector is pretty troublesome as well...
Re: Show HN: Nevod is easier and faster than RegExp
#9> Pattern definition language is simple and clear, thus very easy to learn Once you get into more complicated expressions, I don't see this as much easier or simpler than regexes. For example, this expression from the tutorial looks as much like gibberish to me as an equivalent regex: Domain = Word + [1+] ("." + Word + [0+] {Word, "_", "-"}); That said, I can see some possible value in pattern matching based on text…
> That said, I can see some possible value in pattern matching based on text tokens, rather than individual characters.
It just sounds like Perl's extended regular expressions.
Re: Show HN: Nevod is easier and faster than RegExp
#10This 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"?