hfst
simplenlg
| hfst | simplenlg | |
|---|---|---|
| 3 | 3 | |
| 116 | 804 | |
| 0.9% | 0.2% | |
| 4.0 | 0.0 | |
| about 1 month ago | 11 months ago | |
| C++ | Java | |
| GNU General Public License v3.0 only | GNU General Public License v3.0 or later |
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.
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...
simplenlg
-
Is there any alternative Python's word-forms?
I don't know any Java library that fully accomplish this. There is SimpleNLG but it seems pretty hard to use if you're not an expert in the natural language subject.
-
A system that changes words of input text but retains meaning?
That said, if you really want to do some coding excersize instead of being results oriented, you can have a look at Natural Language Generation systems. Eg: https://github.com/simplenlg/simplenlg
-
Search-and-replace with correct grammatical case - does it exist?
Realization to generate a new word on the same form
What are some alternatives?
HFSM2 - High-Performance Hierarchical Finite State Machine Framework
CogCompNLP - CogComp's Natural Language Processing Libraries and Demos: Modules include lemmatizer, ner, pos, prep-srl, quantifier, question type, relation-extraction, similarity, temporal normalizer, tokenizer, transliteration, verb-sense, and more.
lttoolbox - Finite state compiler, processor and helper tools used by apertium
languagetool - Style and Grammar Checker for 25+ Languages
apertium - Core tools (driver script, transfer, tagger, formatters) for the FOSS RBMT system Apertium
language-detection-cld2 - Natural language detection, Java bindings for CLD2
apertium-lex-tools - Module for compiling lexical selection rules and processing them in the pipeline.
BotLibre - An open platform for artificial intelligence, chat bots, virtual agents, social media automation, and live chat automation.
fluent-plugin-grok-parser - Fluentd's Grok parser
timur - Finite-state morphology for German
kbnf - KBNF has been renamed to Dogma
word_forms - Accurately generate all possible forms of an English word e.g "election" --> "elect", "electoral", "electorate" etc.