ReadableRegex.jl
hfst
| ReadableRegex.jl | hfst | |
|---|---|---|
| 3 | 3 | |
| 183 | 116 | |
| - | 0.9% | |
| 0.0 | 4.0 | |
| almost 2 years ago | about 1 month ago | |
| Julia | C++ | |
| MIT License | GNU General Public License v3.0 only |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
ReadableRegex.jl
-
A portable, modern regular expression language
I find something like this a lot more readable:
https://github.com/jkrumbiegel/ReadableRegex.jl
It is in Julia, but if you have it installed locally it’s just a few taps away. You can even generate the regex, and use that in Python and just add the ReadableRegex in a comment nearby.
- Learn RegEx step by step, from zero to advanced
-
luna is a Domain specific language that translates to regex. It's an attempt to make regex more readable.
Looks kinda like https://github.com/jkrumbiegel/ReadableRegex.jl
hfst
- A portable, modern regular expression language
-
Search-and-replace with correct grammatical case - does it exist?
So you want to go from Spende to Spende+genitive to Beitrag+genitive to Beitrags. In addition to Spacy etc. you might look at Finite State Transducers, which I believe are bidirectional, i.e. for both analysis and generation. XFST and SFST and OpenFST are a few of the FST toolkits. See https://github.com/hfst/hfst for the Helsinki FST; there's a German transducer for it at https://sourceforge.net/projects/hfst/files/resources/morphological-transducers/hfst-german-installable.tar.gz/download. I don't think there is much of a learning curve, and there should be plenty of documentation.
-
Foldable Words
The regex syntax is a bit quirky due to backwards compatibility with lexicons written in XFST, see https://github.com/hfst/hfst/wiki/Regular-Expression-Operato...
What are some alternatives?
pyparsing - Python library for creating PEG parsers
HFSM2 - High-Performance Hierarchical Finite State Machine Framework
iregex - A way to write regex with objects instead of strings.
lttoolbox - Finite state compiler, processor and helper tools used by apertium
rx - Standalone version of Emacs' rx macro
apertium - Core tools (driver script, transfer, tagger, formatters) for the FOSS RBMT system Apertium
kbnf - KBNF has been renamed to Dogma
simplenlg - Java API for Natural Language Generation. Originally developed by Ehud Reiter at the University of Aberdeen’s Department of Computing Science and co-founder of Arria NLG. This git repo is the official SimpleNLG version.
common-regex - Most common regex
apertium-lex-tools - Module for compiling lexical selection rules and processing them in the pipeline.
fluent-plugin-grok-parser - Fluentd's Grok parser