Hello!
If you guys recall, I am improving en_GB with my own Hunspell tool.
I have decided to dedicate some time in my vacations to add support for
the three flags:
1) chr
2) num
3) long
So far I have added the part that grabs the .AFF and optimises it
(removes all spaces and creates an array with the position of each code).
With numbers it takes 18 seconds on my T4300 laptop with the *gl_ES.aff*
after I optimised the code to the limit... before optimising it, it
would take near one minute. Since numbers have a variable size, that is
what makes it slower, since I have to check when the number ends (last
digit).
I found dictionaries in my hdd with *2) num* and *3) long* which I had
access to some time ago thanks to the LanguageTool team.
I don't understand how recursivity works:
*gl_ES.aff*
SFX 520 er éren/666,134,135 er . is:infinitivo P6 + enclítico
*nl.aff*
SFX Yb 0 jes-/CaCbCp [^m] ts:NN2r
These two examples shown above are from Mozilla dictionaries.
Could one of you send me a small dictionary that I could test with
Proofing Tool GUI and explain how I should make it work?
Thanks!
Kind regards,
>Marco A.G.Pinto
-----------------------
--
