El 2017-06-19 08:48, Kevin Brubeck Unhammer escribió:
mansur <6688...@gmail.com> čálii:
Hi, Joonas!
Thank you for your answer. Actually, I tried hfst-fst2strings and it
starts to consume all available RAM (8 Gb)
in about 1 hour and then gives an error, that there is no enough
memory.
With hfst-fst2strings you'll have to limit it somehow. You can try
--help to see the options; a common one is -c0 for no cycles (or -c1
for
at most 1).
If you just want to get the results for кеше<n>, then you can use
compose intersect
as follows:
$ echo "к е ш е %<n%> ?*" | hfst-regexp2fst -o /tmp/keše.hfst
$ hfst-compose-intersect -1 /tmp/keše.hfst -2
apertium-tat/.deps/tat.RL.hfst | hfst-fst2strings -c0
You'll probably want to do some postprocessing, e.g. grep -v '\+' to get
rid of clitics.
Fran
------------------------------------------------------------------------------
Check out the vibrant tech community on one of the world's most
engaging tech sites, Slashdot.org! http://sdm.link/slashdot
_______________________________________________
Apertium-stuff mailing list
Apertium-stuff@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/apertium-stuff
