| jeblad added a comment. |
This will not cover most of world languages in any adequate quality anytime soon. Researchers are spending years to build morphological engines which are far from perfect. Regular expressions are not a tool that allows creating such complex systems (but finite state methods in general are) in a maintainable way.
Actually, what you need is a regular language, which can be a FSM in some form - or a regex. Still note that some regex languages are not regular languages.
TASK DETAIL
EMAIL PREFERENCES
To: jeblad
Cc: jeblad, Nikerabbit, Scott_WUaS, Amire80, Nemo_bis, hoo, mxn, Snipre, Ricordisamoa, Lydia_Pintscher, thiemowmde, Tobi_WMDE_SW, JeroenDeDauw, JanZerebecki, adrianheine, aude, Snaterlicious, Aklapper, Stryn, daniel, Smalyshev, D3r1ck01, Izno, Luke081515, Wikidata-bugs, fbstj, Mbch331
Cc: jeblad, Nikerabbit, Scott_WUaS, Amire80, Nemo_bis, hoo, mxn, Snipre, Ricordisamoa, Lydia_Pintscher, thiemowmde, Tobi_WMDE_SW, JeroenDeDauw, JanZerebecki, adrianheine, aude, Snaterlicious, Aklapper, Stryn, daniel, Smalyshev, D3r1ck01, Izno, Luke081515, Wikidata-bugs, fbstj, Mbch331
_______________________________________________ Wikidata-bugs mailing list [email protected] https://lists.wikimedia.org/mailman/listinfo/wikidata-bugs
